Search the dblp DataBase
Jan Kratochvíl :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jan Kára , Jan Kratochvíl , David R. Wood On the Complexity of the Balanced Vertex Ordering Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2005, pp:849-858 [Conf ] Jirí Fiala , Jan Kratochvíl , Andrzej Proskurowski Geometric Systems of Disjoint Representatives. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2002, pp:110-117 [Conf ] Jan Kratochvíl Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1996, pp:257-270 [Conf ] Jan Kratochvíl Crossing Number of Abstract Topological Graphs. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1998, pp:238-245 [Conf ] Jan Kratochvíl , Martin Pergel Two Results on Intersection Graphs of Polygons. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2003, pp:59-70 [Conf ] Jan Kratochvíl , Teresa M. Przytycka Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1995, pp:365-372 [Conf ] Michael R. Fellows , Jan Kratochvíl , Matthias Middendorf , Frank Pfeiffer Induced minors and related problems. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:179-182 [Conf ] Jirí Fiala , Petr A. Golovach , Jan Kratochvíl Distance Constrained Labelings of Graphs of Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:360-372 [Conf ] Magnús M. Halldórsson , Jan Kratochvíl , Jan Arne Telle Independent Sets with Domination Constraints. [Citation Graph (0, 0)][DBLP ] ICALP, 1998, pp:176-187 [Conf ] Jirí Fiala , Jan Kratochvíl On the Computational Complexity of the L (2, 1) -Labeling Problem for Regular Graphs. [Citation Graph (0, 0)][DBLP ] ICTCS, 2005, pp:228-236 [Conf ] Jirí Fiala , Jan Kratochvíl , Andrzej Proskurowski Distance Constrained Labeling of Precolored Trees. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:285-292 [Conf ] Jirí Fiala , Jan Kratochvíl Complexity of Partial Covers of Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:537-549 [Conf ] Jan Kára , Jan Kratochvíl Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. [Citation Graph (0, 0)][DBLP ] IWPEC, 2006, pp:166-174 [Conf ] Daniel Král , Jan Kratochvíl , Heinz-Jürgen Voss Complexity Note on Mixed Hypergraphs. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:474-486 [Conf ] Jan Kratochvíl , Mirko Krivánek On the Computational Complexity of Codes in Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 1988, pp:396-404 [Conf ] Michael Kaufmann , Jan Kratochvíl , Katharina Anna Lehmann , Amarendran R. Subramanian Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:832-841 [Conf ] Jan Kratochvíl , Zsolt Tuza On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:40-41 [Conf ] Ton Kloks , Jan Kratochvíl , Haiko Müller New Branchwidth Territories. [Citation Graph (0, 0)][DBLP ] STACS, 1999, pp:173-183 [Conf ] Hajo Broersma , Fedor V. Fomin , Jan Kratochvíl , Gerhard J. Woeginger Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. [Citation Graph (0, 0)][DBLP ] SWAT, 2002, pp:160-169 [Conf ] Jirí Fiala , Petr A. Golovach , Jan Kratochvíl Elegant Distance Constrained Labelings of Trees. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:58-67 [Conf ] Jirí Fiala , Jan Kratochvíl Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. [Citation Graph (0, 0)][DBLP ] WG, 2006, pp:15-26 [Conf ] Jirí Fiala , Ton Kloks , Jan Kratochvíl Fixed-Parameter Complexity of lambda-Labelings. [Citation Graph (0, 0)][DBLP ] WG, 1999, pp:350-363 [Conf ] Petr Hlinený , Jan Kratochvíl Computational Complexity of the Krausz Dimension of Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1997, pp:214-228 [Conf ] Magnús M. Halldórsson , Jan Kratochvíl , Jan Arne Telle Mod-2 Independence and Domination in Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1999, pp:101-109 [Conf ] Daniel Král , Jan Kratochvíl , Andrzej Proskurowski , Heinz-Jürgen Voss Coloring Mixed Hypertrees. [Citation Graph (0, 0)][DBLP ] WG, 2000, pp:279-289 [Conf ] Daniel Král , Jan Kratochvíl , Zsolt Tuza , Gerhard J. Woeginger Complexity of Coloring Graphs without Forbidden Induced Subgraphs. [Citation Graph (0, 0)][DBLP ] WG, 2001, pp:254-262 [Conf ] Jan Kratochvíl Complexity of Hypergraph Coloring and Seidel's Switching. [Citation Graph (0, 0)][DBLP ] WG, 2003, pp:297-308 [Conf ] Jan Kratochvíl , Andrzej Proskurowski , Jan Arne Telle Complexity of Graph Covering Problems. [Citation Graph (0, 0)][DBLP ] WG, 1994, pp:93-105 [Conf ] Jan Kratochvíl , Andrzej Proskurowski , Jan Arne Telle Complexity of Colored Graph Covers I. Colored Directed Multigraphs. [Citation Graph (0, 0)][DBLP ] WG, 1997, pp:242-257 [Conf ] Jan Kratochvíl , Zsolt Tuza Rankings of Directed Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:114-123 [Conf ] Jan Kratochvíl , Zsolt Tuza , Margit Voigt On the b-Chromatic Number of Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2002, pp:310-320 [Conf ] Jan Kratochvíl , Mirko Krivánek Satisfiability of Co-Nested Formulas. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1993, v:30, n:4, pp:397-403 [Journal ] Hajo Broersma , Fedor V. Fomin , Jan Kratochvíl , Gerhard J. Woeginger Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2006, v:44, n:4, pp:343-361 [Journal ] Michael R. Fellows , Jan Kratochvíl , Martin Middendorf , Frank Pfeiffer The Complexity of Induced Minors and Related Problems. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1995, v:13, n:3, pp:266-282 [Journal ] Elias Dahlhaus , Jan Kratochvíl , Paul D. Manuel , Mirka Miller Transversal Partitioning in Balanced Hypergraphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:75-89 [Journal ] Jirí Fiala , Ton Kloks , Jan Kratochvíl Fixed-parameter complexity of lambda-labelings. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:113, n:1, pp:59-72 [Journal ] Jirí Fiala , Jan Kratochvíl , Andrzej Proskurowski Systems of distant representatives. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:2, pp:306-316 [Journal ] Magnús M. Halldórsson , Jan Kratochvíl , Jan Arne Telle Independent Sets with Domination Constraints. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:39-54 [Journal ] Ton Kloks , Jan Kratochvíl , Haiko Müller Computing the branchwidth of interval graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:2, pp:266-275 [Journal ] Daniel Král , Jan Kratochvíl , Andrzej Proskurowski , Heinz-Jürgen Voss Coloring mixed hypertrees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:4, pp:660-672 [Journal ] Jan Kratochvíl A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:52, n:3, pp:233-252 [Journal ] Jan Kratochvíl , Andrzej Proskurowski , Oriol Serra Structural decompositions, width parameters, and graph labelings. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:145, n:2, pp:141-142 [Journal ] Jan Kratochvíl , Zsolt Tuza Algorithmic complexity of list colorings. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:50, n:3, pp:297-302 [Journal ] Jan Kratochvíl , Josep Díaz , Jirí Fiala Editorial. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:2, pp:79-80 [Journal ] Luitpold Babel , Ton Kloks , Jan Kratochvíl , Dieter Kratsch , Haiko Müller , Stephan Olariu Efficient algorithms for graphs with few P 4 's. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:235, n:1-3, pp:29-51 [Journal ] Miroslav Fiedler , Jan Kratochvíl , Jaroslav Nesetril Foreword. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:233, n:1-3, pp:1-2 [Journal ] Miroslav 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). [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:229, n:1-3, pp:1-2 [Journal ] Gena Hahn , Jan Kratochvíl , Jozef Sirán , Dominique Sotteau On the injective chromatic number of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:256, n:1-2, pp:179-192 [Journal ] Petr Hlinený , Jan Kratochvíl Representing graphs by disks and balls (a survey of recognition-complexity results). [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:229, n:1-3, pp:101-124 [Journal ] Daniel Král , Jan Kratochvíl , Heinz-Jürgen Voss Mixed hypercacti. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:286, n:1-2, pp:99-113 [Journal ] Jan Kratochvíl , Peter Mihók Hom-properties are uniquely factorizable into irreducible factors. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:213, n:1-3, pp:189-194 [Journal ] Magnús M. Halldórsson , Jan Kratochvíl , Jan Arne Telle Mod-2 Independence and Domination in Graphs. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:355-363 [Journal ] Jan Kratochvíl , Zsolt Tuza On the complexity of bicoloring clique hypergraphs of graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2002, v:45, n:1, pp:40-54 [Journal ] Jan Kratochvíl Perfect codes over graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:224-228 [Journal ] Jan Kratochvíl String graphs. I. The number of critical nonstring graphs is infinite. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:53-66 [Journal ] Jan Kratochvíl String graphs. II. recognizing string graphs is NP-hard. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:67-78 [Journal ] Jan Kratochvíl , Jirí Matousek String graphs requiring exponential representations. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:53, n:1, pp:1-4 [Journal ] Jan Kratochvíl , Jirí Matousek Intersection Graphs of Segments. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1994, v:62, n:2, pp:289-315 [Journal ] Jan Kratochvíl , Andrzej Proskurowski , Jan Arne Telle Covering Regular Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1997, v:71, n:1, pp:1-16 [Journal ] Hubert de Fraysseix , Jan Kratochvíl Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2002, v:6, n:1, pp:3-5 [Journal ] Jan Kratochvíl , Paul D. Manuel , Mirka Miller Generalized Domination in Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 1995, v:2, n:1, pp:41-50 [Journal ] Jan Kratochvíl , Andrzej Proskurowski , Jan Arne Telle On the Complexity of Graph Covering Problems. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 1998, v:5, n:3, pp:173-195 [Journal ] Svante Janson , Jan Kratochvíl Proportional Graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1991, v:2, n:2, pp:209-224 [Journal ] Jan Kratochvíl , Petr Savický , Zsolt Tuza One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1993, v:22, n:1, pp:203-210 [Journal ] Pavol Hell , David G. Kirkpatrick , Jan Kratochvíl , Igor Kríz On Restricted Two-Factors. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1988, v:1, n:4, pp:472-484 [Journal ] Jan Kratochvíl , Anna Lubiw , Jaroslav Nesetril Noncrossing Subgraphs in Topological Layouts. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1991, v:4, n:2, pp:223-244 [Journal ] Jan Kratochvíl , Zsolt Tuza Rankings of Directed Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:3, pp:374-384 [Journal ] Václav Koubek , Jan Kratochvíl Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:345, n:2-3, pp:171-172 [Journal ] Daniel Král , Jan Kratochvíl , Heinz-Jürgen Voss Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:, pp:263-278 [Journal ] Melanie 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. [Citation Graph (0, 0)][DBLP ] CCCG, 2007, pp:233-236 [Conf ] Jan Kratochvíl , Martin Pergel Geometric Intersection Graphs: Do Short Cycles Help? [Citation Graph (0, 0)][DBLP ] COCOON, 2007, pp:118-128 [Conf ] Jan Kratochvíl , Dieter Kratsch , Mathieu Liedloff Exact Algorithms for L (2, 1)-Labeling of Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 2007, pp:513-524 [Conf ] Fedor V. Fomin , Petr A. Golovach , Jan Kratochvíl , Dieter Kratsch , Mathieu Liedloff Branch and Recharge: Exact Algorithms for Generalized Domination. [Citation Graph (0, 0)][DBLP ] WADS, 2007, pp:507-518 [Conf ] Xavier Goaoc , Jan Kratochvil , Yoshio Okamoto , Chan-Su Shin , Alexander Wolff Moving Vertices to Make Drawings Plane [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Jan Kratochvíl , Zsolt Tuza , Margit Voigt Complexity of choosing subsets from color sets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:191, n:1-3, pp:139-148 [Journal ] Jan Kratochvíl , Ales Kubena On intersection representations of co-planar graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:178, n:1-3, pp:251-255 [Journal ] Alexandr V. Kostochka , Jan Kratochvíl Covering and coloring polygon-circle graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:163, n:1-3, pp:299-305 [Journal ] Svante Janson , Jan Kratochvíl Thresholds for classes of intersection graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:108, n:1-3, pp:307-326 [Journal ] Jan Kratochvíl Regular codes in regular graphs are difficult. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:133, n:1-3, pp:191-205 [Journal ] Moving Vertices to Make Drawings Plane. [Citation Graph (, )][DBLP ] Clustered Planarity: Small Clusters in Eulerian Graphs. [Citation Graph (, )][DBLP ] Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. [Citation Graph (, )][DBLP ] The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. [Citation Graph (, )][DBLP ] On Switching to H-Free Graphs. [Citation Graph (, )][DBLP ] Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). [Citation Graph (, )][DBLP ] On tractability of Cops and Robbers game. [Citation Graph (, )][DBLP ] On the Complexity of Reconstructing H -free Graphs from Their Star Systems. [Citation Graph (, )][DBLP ] Faithful Representations of Graphs by Islands in the Extended Grid. [Citation Graph (, )][DBLP ] Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP ] Distance Constrained Labelings of Trees. [Citation Graph (, )][DBLP ] Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. [Citation Graph (, )][DBLP ] Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. [Citation Graph (, )][DBLP ] Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. [Citation Graph (, )][DBLP ] Parameterized Complexity of Generalized Domination Problems. [Citation Graph (, )][DBLP ] On the computational complexity of partial covers of Theta graphs. [Citation Graph (, )][DBLP ] Compatible 2-factors. [Citation Graph (, )][DBLP ] Guest editors' foreword. [Citation Graph (, )][DBLP ] Guest Editors' Foreword. [Citation Graph (, )][DBLP ] Untangling a Planar Graph. [Citation Graph (, )][DBLP ] The capture time of a graph. [Citation Graph (, )][DBLP ] On the computation of the hull number of a graph. [Citation Graph (, )][DBLP ] Preface. [Citation Graph (, )][DBLP ] On the Complexity of the Balanced Vertex Ordering Problem. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.609secs