dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Jan Kratochvíl Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Torsten Ueckerdt: Non-crossing Connectors in the Plane CoRR abs/1201.0917: (2012)
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVít Jelínek, Jan Kratochvíl, Ignaz Rutter: A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs CoRR abs/1204.2915: (2012)
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJames Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil: Matching and l-Subgraph Contractibility to Planar Graphs CoRR abs/1204.6070: (2012)
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak: Extending partial representations of function graphs and permutation graphs CoRR abs/1204.6391: (2012)
130Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski: Guest editors' foreword. Discrete Applied Mathematics 160(6): 683-684 (2012)
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma: Distance three labelings of trees. Discrete Applied Mathematics 160(6): 764-779 (2012)
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Jan Kratochvíl, Ondrej Suchý: Parameterized complexity of generalized domination problems. Discrete Applied Mathematics 160(6): 780-792 (2012)
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMathew C. Francis, Jan Kratochvíl, Tomás Vyskocil: Segment representation of a subclass of co-planar graphs. Discrete Mathematics 312(10): 1815-1818 (2012)
2011
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr Kolman, Jan Kratochvíl: Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers Springer 2011
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVít Jelínek, Jan Kratochvíl, Ignaz Rutter: A kuratowski-type theorem for planarity of partially embedded graphs. Symposium on Computational Geometry 2011: 107-116
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs). Symposium on Computational Geometry 2011: 75-76
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavel Klavík, Jan Kratochvíl, Tomás Vyskocil: Extending Partial Representations of Interval Graphs. TAMC 2011: 276-285
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKonstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski: Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. TAMC 2011: 82-93
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica 59(2): 169-194 (2011)
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica 61(2): 252-273 (2011)
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl: Parameterized Problems Related to Seidel's Switching. Discrete Mathematics & Theoretical Computer Science 13(2): 19-44 (2011)
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle: On the complexity of reconstructing H-free graphs from their Star Systems. Journal of Graph Theory 68(2): 113-124 (2011)
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412(23): 2513-2523 (2011)
2010
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman: Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings Springer 2010
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris Horvat, Jan Kratochvíl, Tomaz Pisanski: On the Computational Complexity of Degenerate Unit Distance Representations of Graphs. IWOCA 2010: 274-285
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil: Faithful Representations of Graphs by Islands in the Extended Grid. LATIN 2010: 131-142
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter: Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski: Guest Editors' Foreword. Discrete Applied Mathematics 158(7): 729-730 (2010)
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Jaroslav Nesetril, Zdenek Ryjácek: Preface. Discrete Mathematics 310(3): 371-372 (2010)
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan: Pursuing a fast robber on a graph. Theor. Comput. Sci. 411(7-9): 1167-1181 (2010)
2009
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl, Mirka Miller: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers Springer 2009
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil: The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graph Drawing 2009: 304-315
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Jan Kratochvíl, Ondrej Suchý: Parameterized Complexity of Generalized Domination Problems. WG 2009: 133-142
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff: Untangling a Planar Graph. Discrete & Computational Geometry 42(4): 542-569 (2009)
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Andrzej Proskurowski, Oriol Serra: Guest editors' foreword. Discrete Applied Mathematics 157(12): 2575-2576 (2009)
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl: The capture time of a graph. Discrete Mathematics 309(18): 5588-5595 (2009)
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMitre Costa Dourado, John G. Gimbel, Jan Kratochvíl, Fábio Protti, Jayme Luiz Szwarcfiter: On the computation of the hull number of a graph. Discrete Mathematics 309(18): 5668-5674 (2009)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14): 795-798 (2009)
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil: Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. J. Graph Algorithms Appl. 13(3): 379-422 (2009)
2008
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický: Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. Graph Drawing 2008: 121-132
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) 2008: 294-305
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEva Jelínková, Jan Kratochvíl: On Switching to H-Free Graphs. ICGT 2008: 379-395
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl: On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle: On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN 2008: 194-205
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Trees. TAMC 2008: 125-135
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Jan Kratochvíl: Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. TAMC 2008: 182-191
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl: Locally constrained graph homomorphisms - structure, complexity, and applications. Computer Science Review 2(2): 97-111 (2008)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl, Attila Pór: On the computational complexity of partial covers of Theta graphs. Discrete Applied Mathematics 156(7): 1143-1149 (2008)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Martin Pergel: Intersection graphs of homothetic polygons. Electronic Notes in Discrete Mathematics 31: 277-280 (2008)
2007
89no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMelanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta: Homothetic Triangle Contact Representations of Planar Graphs. CCCG 2007: 233-236
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Martin Pergel: Geometric Intersection Graphs: Do Short Cycles Help? COCOON 2007: 118-128
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane. Graph Drawing 2007: 101-112
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil: Clustered Planarity: Small Clusters in Eulerian Graphs. Graph Drawing 2007: 303-314
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Exact Algorithms for L (2, 1)-Labeling of Graphs. MFCS 2007: 513-524
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Jan Kratochvíl: Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG 2007: 1-11
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane CoRR abs/0706.1002: (2007)
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Josep Díaz, Jirí Fiala: Editorial. Discrete Applied Mathematics 155(2): 79-80 (2007)
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kára, Jan Kratochvíl, David R. Wood: On the Complexity of the Balanced Vertex Ordering Problem. Discrete Mathematics & Theoretical Computer Science 9(1): (2007)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera: Preface. Electronic Notes in Discrete Mathematics 28: 1 (2007)
2006
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kára, Jan Kratochvíl: Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. IWPEC 2006: 166-174
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran R. Subramanian: Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. SODA 2006: 832-841
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl: Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. WG 2006: 15-26
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica 44(4): 343-361 (2006)
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring mixed hypertrees. Discrete Applied Mathematics 154(4): 660-672 (2006)
2005
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kára, Jan Kratochvíl, David R. Wood: On the Complexity of the Balanced Vertex Ordering Problem. COCOON 2005: 849-858
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl: On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs. ICTCS 2005: 228-236
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Andrzej Proskurowski, Oriol Serra: Structural decompositions, width parameters, and graph labelings. Discrete Applied Mathematics 145(2): 141-142 (2005)
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTon Kloks, Jan Kratochvíl, Haiko Müller: Computing the branchwidth of interval graphs. Discrete Applied Mathematics 145(2): 266-275 (2005)
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Systems of distant representatives. Discrete Applied Mathematics 145(2): 306-316 (2005)
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl, Attila Pór: On the computational complexity of partial covers of Theta graphs. Electronic Notes in Discrete Mathematics 19: 79-85 (2005)
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVáclav Koubek, Jan Kratochvíl: Preface. Theor. Comput. Sci. 345(2-3): 171-172 (2005)
2004
65no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Václav Koubek, Jan Kratochvíl: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings Springer 2004
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Mixed hypercacti. Discrete Mathematics 286(1-2): 99-113 (2004)
2003
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Martin Pergel: Two Results on Intersection Graphs of Polygons. Graph Drawing 2003: 59-70
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: Complexity of Hypergraph Coloring and Seidel's Switching. WG 2003: 297-308
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theor. Comput. Sci. 295: 263-278 (2003)
2002
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Geometric Systems of Disjoint Representatives. Graph Drawing 2002: 110-117
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT 2002: 160-169
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Zsolt Tuza, Margit Voigt: On the b-Chromatic Number of Graphs. WG 2002: 310-320
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau: On the injective chromatic number of graphs. Discrete Mathematics 256(1-2): 179-192 (2002)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Zsolt Tuza: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45(1): 40-54 (2002)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHubert de Fraysseix, Jan Kratochvíl: Guest Editors' Foreword. J. Graph Algorithms Appl. 6(1): 3-5 (2002)
2001
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Distance Constrained Labeling of Precolored Trees. ICTCS 2001: 285-292
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Jan Kratochvíl: Complexity of Partial Covers of Graphs. ISAAC 2001: 537-549
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Complexity Note on Mixed Hypergraphs. MFCS 2001: 474-486
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Ton Kloks, Jan Kratochvíl: Fixed-parameter complexity of lambda-labelings. Discrete Applied Mathematics 113(1): 59-72 (2001)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril: DIMATIA surveys (related to the Fifth Czech and Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications held in Prague on July 6-11, 1998). Discrete Mathematics 229(1-3): 1-2 (2001)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr Hlinený, Jan Kratochvíl: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Mathematics 229(1-3): 101-124 (2001)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril: Foreword. Discrete Mathematics 233(1-3): 1-2 (2001)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu: Efficient algorithms for graphs with few P4's. Discrete Mathematics 235(1-3): 29-51 (2001)
2000
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Zsolt Tuza: On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). SODA 2000: 40-41
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring Mixed Hypertrees. WG 2000: 279-289
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Independent Sets with Domination Constraints. Discrete Applied Mathematics 99(1-3): 39-54 (2000)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Peter Mihók: Hom-properties are uniquely factorizable into irreducible factors. Discrete Mathematics 213(1-3): 189-194 (2000)
40no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Mod-2 Independence and Domination in Graphs. Int. J. Found. Comput. Sci. 11(3): 355-363 (2000)
1999
39no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings Springer 1999
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTon Kloks, Jan Kratochvíl, Haiko Müller: New Branchwidth Territories. STACS 1999: 173-183
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Mod-2 Independence and Domination in Graphs. WG 1999: 101-109
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Ton Kloks, Jan Kratochvíl: Fixed-Parameter Complexity of lambda-Labelings. WG 1999: 350-363
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Zsolt Tuza: Rankings of Directed Graphs. SIAM J. Discrete Math. 12(3): 374-384 (1999)
1998
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: Crossing Number of Abstract Topological Graphs. Graph Drawing 1998: 238-245
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Independent Sets with Domination Constraints. ICALP 1998: 176-187
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Zsolt Tuza: Rankings of Directed Graphs. WG 1998: 114-123
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Ales Kubena: On intersection representations of co-planar graphs. Discrete Mathematics 178(1-3): 251-255 (1998)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Zsolt Tuza, Margit Voigt: Complexity of choosing subsets from color sets. Discrete Mathematics 191(1-3): 139-148 (1998)
29no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: On the Complexity of Graph Covering Problems. Nord. J. Comput. 5(3): 173-195 (1998)
1997
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr Hlinený, Jan Kratochvíl: Computational Complexity of the Krausz Dimension of Graphs. WG 1997: 214-228
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG 1997: 242-257
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller: Transversal Partitioning in Balanced Hypergraphs. Discrete Applied Mathematics 79(1-3): 75-89 (1997)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Jan Kratochvíl: Covering and coloring polygon-circle graphs. Discrete Mathematics 163(1-3): 299-305 (1997)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Covering Regular Graphs. J. Comb. Theory, Ser. B 71(1): 1-16 (1997)
1996
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. Graph Drawing 1996: 257-270
1995
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Teresa M. Przytycka: Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract). Graph Drawing 1995: 365-372
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jan Kratochvíl, Martin Middendorf, Frank Pfeiffer: The Complexity of Induced Minors and Related Problems. Algorithmica 13(3): 266-282 (1995)
20no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Paul D. Manuel, Mirka Miller: Generalized Domination in Chordal Graphs. Nord. J. Comput. 2(1): 41-50 (1995)
1994
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: Complexity of Graph Covering Problems. WG 1994: 93-105
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Zsolt Tuza: Algorithmic complexity of list colorings. Discrete Applied Mathematics 50(3): 297-302 (1994)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness. Discrete Applied Mathematics 52(3): 233-252 (1994)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: Regular codes in regular graphs are difficult. Discrete Mathematics 133(1-3): 191-205 (1994)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Zsolt Tuza: Intersection Dimensions of Graph Classes. Graphs and Combinatorics 10(2-4): 159-168 (1994)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Jirí Matousek: Intersection Graphs of Segments. J. Comb. Theory, Ser. B 62(2): 289-315 (1994)
1993
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Mirko Krivánek: Satisfiability of Co-Nested Formulas. Acta Inf. 30(4): 397-403 (1993)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Petr Savický, Zsolt Tuza: One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete. SIAM J. Comput. 22(1): 203-210 (1993)
1992
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Svatopluk Poljak: Compatible 2-factors. Discrete Applied Mathematics 36(3): 253-266 (1992)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSvante Janson, Jan Kratochvíl: Thresholds for classes of intersection graphs. Discrete Mathematics 108(1-3): 307-326 (1992)
1991
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer: Induced minors and related problems. Graph Structure Theory 1991: 179-182
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: String graphs. I. The number of critical nonstring graphs is infinite. J. Comb. Theory, Ser. B 52(1): 53-66 (1991)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: String graphs. II. recognizing string graphs is NP-hard. J. Comb. Theory, Ser. B 52(1): 67-78 (1991)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Jirí Matousek: String graphs requiring exponential representations. J. Comb. Theory, Ser. B 53(1): 1-4 (1991)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSvante Janson, Jan Kratochvíl: Proportional Graphs. Random Struct. Algorithms 2(2): 209-224 (1991)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Anna Lubiw, Jaroslav Nesetril: Noncrossing Subgraphs in Topological Layouts. SIAM J. Discrete Math. 4(2): 223-244 (1991)
1988
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl, Mirko Krivánek: On the Computational Complexity of Codes in Graphs. MFCS 1988: 396-404
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz: On Restricted Two-Factors. SIAM J. Discrete Math. 1(4): 472-484 (1988)
1986
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Kratochvíl: Perfect codes over graphs. J. Comb. Theory, Ser. B 40(2): 224-228 (1986)

Coauthor Index

1James Abello [132]
2Patrizio Angelini [113]
3Luitpold Babel [45]
4Melanie Badent [89]
5Giuseppe Di Battista [113]
6Carla Binucci [89]
7Anthony Bonato [103]
8Hajo Broersma (H. J. Broersma) [58] [75]
9Michael D. Coury [114]
10Elias Dahlhaus [26]
11Josep Díaz [81]
12Walter Didimo [89]
13Mitre Costa Dourado [102]
14Michael R. Fellows (Mike Fellows) [9] [21]
15Stefan Felsner [89]
16Jirí Fiala [36] [49] [52] [53] [59] [64] [65] [67] [68] [71] [72] [76] [81] [91] [92] [94] [98] [107] [109] [116] [117] [129]
17Miroslav Fiedler [46] [48]
18Fedor V. Fomin [58] [75] [84] [95] [96] [101] [110] [118] [120]
19Mathew C. Francis [127]
20Fabrizio Frati [113]
21Hubert de Fraysseix [54]
22Emilio Di Giacomo [89]
23John G. Gimbel [102]
24Francesco Giordano [89]
25Xavier Goaoc [82] [87] [105]
26Petr A. Golovach [64] [72] [83] [84] [93] [94] [96] [98] [101] [103] [106] [107] [110] [117] [120] [128] [129]
27Gena Hahn [56] [103]
28Magnús M. Halldórsson [33] [37] [40] [42]
29Frédéric Havet [121]
30Pinar Heggernes [112] [130]
31Pavol Hell [2] [114]
32Petr Hlinený [28] [47] [79] [119]
33Boris Horvat [115]
34Svante Janson [5] [10]
35Vít Jelínek (Vítek Jelínek) [99] [108] [113] [125] [133]
36Eva Jelínková [86] [97] [99] [100] [108] [119]
37Konstanty Junosza-Szaniawski [122]
38Jan Kára [73] [78] [80] [86] [100]
39Michael Kaufmann [77]
40David G. Kirkpatrick [2]
41Pavel Klavík [123] [131] [132]
42Martin Klazar [121]
43Ton Kloks (Antonius J. J. Kloks) [36] [38] [45] [49] [69]
44Petr Kolman [116] [126]
45Alexandr V. Kostochka [25]
46Václav Koubek [65] [66]
47Daniel Král (Daniel Král') [43] [50] [51] [60] [63] [74]
48Dieter Kratsch [45] [84] [85] [101] [120] [121]
49Tomasz Krawczyk [131]
50Mirko Krivánek [3] [13]
51Igor Kríz [2]
52Ales Kubena [31]
53Angsheng Li [116]
54Bernard Lidický [99] [108] [129]
55Mathieu Liedloff [84] [85] [101] [120] [121] [122]
56Daniel Lokshtanov [95] [118]
57Anna Lubiw [4]
58Federico Mancini [95] [118]
59Paul D. Manuel [20] [26]
60Jirí Matousek [6] [14]
61Martin Middendorf [21]
62Matthias Middendorf [9]
63Peter Mihók [41]
64Mirka Miller [20] [26] [109]
65Haiko Müller [38] [45] [69]
66Roman Nedela [79]
67Jaroslav Nesetril (Jarik Nesetril) [4] [46] [48] [111]
68Nicolas Nisse [110]
69Yoshio Okamoto [82] [87] [105]
70Stephan Olariu [45]
71Pietro Palladino [89]
72Maurizio Patrignani [89] [113]
73Daniël Paulusma [129]
74Martin Pergel [62] [86] [88] [90] [100]
75Frank Pfeiffer [9] [21]
76Tomaz Pisanski [115]
77Svatopluk Poljak [11]
78Attila Pór [67] [91]
79Andrzej Proskurowski [19] [24] [27] [29] [43] [53] [59] [68] [70] [74] [104] [112] [130]
80Fábio Protti [102]
81Teresa M. Przytycka [22]
82Peter Rossmanith [122]
83Ignaz Rutter [113] [125] [133]
84Zdenek Ryjácek [111]
85Pawel Rzazewski [122]
86Petr Savický [12]
87Oriol Serra [70] [104]
88Chan-Su Shin [82] [87] [105]
89Jozef Sirán [56]
90Martin Skoviera [79]
91Dominique Sotteau [56]
92Andreas Spillner [105]
93Amarendran R. Subramanian [77]
94Karol Suchan [110]
95Ondrej Suchý [86] [100] [106] [119] [128]
96Jayme Luiz Szwarcfiter [102]
97Jan Arne Telle [19] [24] [27] [29] [33] [37] [40] [42] [95] [118]
98Marek Tesar [108]
99Francesco Trotta [89]
100Zsolt Tuza [12] [15] [18] [30] [32] [35] [44] [50] [55] [57]
101Torsten Ueckerdt [134]
102Margit Voigt [30] [57]
103Heinz-Jürgen Voss [43] [51] [60] [63] [74]
104Tomás Vyskocil [86] [100] [108] [114] [123] [127] [132]
105Bartosz Walczak [131]
106Gerhard J. Woeginger [50] [58] [75]
107Alexander Wolff [82] [87] [105]
108David R. Wood [73] [80]
109Katharina Anna Zweig (Katharina Anna Lehmann) [77]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page