Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Jel{\'{i}}nek, V{\'{i}}t"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Planar embeddings with small and uniform faces
Giordano Da Lozzo
,
Vít Jelínek
,
Jan Kratochvíl
,
Ignaz Rutter
Lecture Notes in Computer Science
8889
, 2014, pp. 633-645
Cops and robbers on intersection graphs
Tomás̑ Gavenc̑iak
,
Vít Jelínek
,
Pavel Klavík
,
Jan Kratochvíl
Lecture Notes in Computer Science
8283
, 2013, pp. 174-184
The planar slope number of planar partial 3-trees of bounded degree
Vít Jelínek
,
Eva Jelínková
,
Jan Kratochvíl
,
Bernard Lidický
,
Marek Tesaȓ
,
Tomás̑ Vyskoc̑il
Graphs and Combinatorics
29
(4), 2013, pp. 981-1005
Bend-bounded path intersection graphs: Sausages, noodles, and waffles on a grill
Steven Chaplick
,
Vít Jelínek
,
Jan Kratochvíl
,
Tomás̑ Vyskoc̑il
Lecture Notes in Computer Science
7551
, 2012, pp. 274-285
Bend-bounded path intersection graphs: Sausages, noodles, and waffles on a grill
Steven Chaplick
,
Vít Jelínek
,
Jan Kratochvíl
,
Tomás̑ Vyskoc̑il
Lecture Notes in Computer Science
7551
, 2012, pp. 274-285
Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
Anders Claesson
,
Vít Jelínek
,
Einar Steingrímsson
Journal of Combinatorial Theory Series A
119
(8), 2012, pp. 1680-1691
Counting general and self-dual interval orders
Vít Jelínek
Journal of Combinatorial Theory Series A
119
(3), 2012, pp. 599-614
The Möbius function of separable and decomposable permutations
Alexander Burstein
,
Vít Jelínek
,
Eva Jelínková
,
Einar Steingrímsson
Journal of Combinatorial Theory Series A
118
(8), 2011, pp. 2346-2364
The planar slope number of planar partial 3-trees of bounded degree
Vít Jelínek
,
Eva Jelínková
,
Jan Kratochvíl
,
Bernard Lidický
,
Marek Tesaȓ
,
Tomás̑ Vyskoc̑il
Lecture Notes in Computer Science
5849
, 2010, pp. 304-315
Clustered planarity: Embedded clustered graphs with two-component clusters
Vít Jelínek
,
Eva Jelínková
,
Jan Kratochvíl
,
Bernard Lidický
Lecture Notes in Computer Science
5417
, 2009, pp. 121-132
Monochromatic triangles in two-colored plane
Vít Jelínek
,
Jan Kync̑l
,
Rudolf Stolaȓ
,
Tomás̑ Valla
Combinatorica
29
(6), 2009, pp. 699-718
Clustered planarity: Clusters with few outgoing edges
Vít Jelínek
,
Ondȓej Suchý
,
Marek Tesaȓ
,
Tomás̑ Vyskoc̑il
Lecture Notes in Computer Science
5417
, 2009, pp. 102-113
The rank-width of the square grid
Vít Jelínek
Lecture Notes in Computer Science
5344
, 2008, pp. 230-239
Labelings of graphs with fixed and variable edge-weights
Robert Babilon
,
Vít Jelínek
,
Daniel Král'
,
Pavel Valtr
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 688-706
Three optimal algorithms for balls of three colors
Zdenk Dvoȓák
,
Vít Jelínek
,
Daniel Král'
,
Jan Kync̑l
,
Michael Saks
Lecture Notes in Computer Science
3404
, 2005, pp. 206-217
On the complexity of the
G
-reconstruction problem
Zdenȇk Dvoȓák
,
Vít Jelínek
Lecture Notes in Computer Science
3827
, 2005, pp. 196-205
Noncrossing Hamiltonian paths in geometric graphs
Jakub C̑erný
,
Zdenȇk Dvoȓák
,
Vít Jelínek
,
Jan Kára
Lecture Notes in Computer Science
2912
, 2004, pp. 86-97