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
Hilfe
Suche: Author="Kratochv{\'{i}}l, Jan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Extending partial representations of subclasses of chordal graphs
Pavel Klavík
,
Jan Kratochvíl
,
Yota Otachi
,
Toshiki Saitoh
Theoretical Computer Science
576
, 2015, pp. 85-101
Contact representations of planar graphs: Extending a partial representation is hard
Steven Chaplick
,
Paul Dorbec
,
Jan Kratochvíl
,
Mickael Montassier
,
Juraj Stacho
Lecture Notes in Computer Science
8747
, 2014, pp. 139-151
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
Algorithmic aspects of regular graph covers with applications to planar graphs
Jiȓí Fiala
,
Pavel Klavík
,
Jan Kratochvíl
,
Roman Nedela
Lecture Notes in Computer Science
8572
, 2014, pp. 489-501
Drawing simultaneously embedded graphs with few bends
Luca Grilli
,
Seok-Hee Hong
,
Jan Kratochvíl
,
Ignaz Rutter
Lecture Notes in Computer Science
8871
, 2014, pp. 40-51
On switching to
H
-free graphs
Eva Jelínková
,
Jan Kratochvíl
Journal of Graph Theory
75
(4), 2014, pp. 387-405
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
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
Fast exact algorithm for
L(2,l)
-labeling of graphs
Konstanty Junosza-Szaniawski
,
Jan Kratochvíl
,
Mathieu Liedloff
,
Peter Rossmanith
,
Paweƚ Rza̧żewski
Theoretical Computer Science
505
, 2013, pp. 42-54
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
Cluster vertex deletion: A parameterization between vertex cover and clique-width
Martin Doucha
,
Jan Kratochvíl
Lecture Notes in Computer Science
7464
, 2012, pp. 348-359
Determining the
L(2,1)
-span in polynomial space
Konstanty Junosza-Szaniawski
,
Jan Kratochvíl
,
Mathieu Liedloff
,
Paweƚ Rza̧żewski
Lecture Notes in Computer Science
7551
, 2012, pp. 126-137
Determining the
L(2,1)
-span in polynomial space
Konstanty Junosza-Szaniawski
,
Jan Kratochvíl
,
Mathieu Liedloff
,
Paweƚ Rza̧żewski
Lecture Notes in Computer Science
7551
, 2012, pp. 126-137
Beyond homothetic polygons: Recognition and maximum clique
Konstanty Junosza-Szaniawski
,
Jan Kratochvíl
,
Martin Pergel
,
Paweƚ Rza̧żewski
Lecture Notes in Computer Science
7676
, 2012, pp. 619-628
Extending partial representations of function graphs and permutation graphs
Pavel Klavík
,
Jan Kratochvíl
,
Tomasz Krawczyk
,
Bartosz Walczak
Lecture Notes in Computer Science
7501
, 2012, pp. 671-682
Extending partial representations of subclasses of chordal graphs
Pavel Klavík
,
Jan Kratochvíl
,
Yota Otachi
,
Toshiki Saitoh
Lecture Notes in Computer Science
7676
, 2012, pp. 444-454
Split clique graph complexity
Liliana Alcón
,
Luerbio Faria
,
Celina M.H. de Figueiredo
,
Marisa Gutierrez
Lecture Notes in Computer Science
6986
, 2011, pp. 11-22
On searching for small Kochen-Specker vector systems
Felix Arends
,
Joël Ouaknine
,
Charles W. Wampler
Lecture Notes in Computer Science
6986
, 2011, pp. 23-34
Characterizations of deque and queue graphs
Christopher Auer
,
Andreas Gleißner
Lecture Notes in Computer Science
6986
, 2011, pp. 35-46
Graph classes with structured neighborhoods and algorithmic applications
Rémy Belmonte
,
Martin Vatshelle
Lecture Notes in Computer Science
6986
, 2011, pp. 47-58
On the complexity of planar covering of small graphs
Ondȓej Bílka
,
Jozef Jirásek
,
Pavel Klavík
,
Martin Tancer
,
Jan Volec
Lecture Notes in Computer Science
6986
, 2011, pp. 83-94
The Cinderella game on holes and anti-holes
Marijke H.L. Bodlaender
,
Cor A.J. Hurkens
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
6986
, 2011, pp. 71-82
Exact algorithms for Kayles
Hans L. Bodlaender
,
Dieter Kratsch
Lecture Notes in Computer Science
6986
, 2011, pp. 59-70
Seiten 1
2
3
4
5
6
>