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
[3]
Hilfe
Suche: Author="Vysko{\v{c}}il, Tom{\'a}{\v{s}}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Extending partial representations of proper and unit interval graphs
Pavel Klavík
,
Jan Kratochvíl
,
Yota Otachi
,
Ignaz Rutter
,
Toshiki Saitoh
,
Maria Saumell
,
Tomás̑ Vyskoc̑il
Lecture Notes in Computer Science
8503
, 2014, pp. 253-264
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
Faithful representations of graphs by islands in the extended grid
Michael D. Coury
,
Pavol Hell
,
Jan Kratochvíl
,
Tomás̑ Vyskoc̑il
Lecture Notes in Computer Science
6034
, 2010, pp. 131-142
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: 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
Clustered planarity: Small clusters in Eulerian graphs
Eva Jelínková
,
Jan Kára
,
Jan Kratochvíl
,
Martin Pergel
,
Ondȓej Suchý
,
Tomás̑ Vyskoc̑il
Lecture Notes in Computer Science
4875
, 2008, pp. 303-314