The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Kratochvíl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
    Geometric Systems of Disjoint Representatives. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:110-117 [Conf]
  3. 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]
  4. Jan Kratochvíl
    Crossing Number of Abstract Topological Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:238-245 [Conf]
  5. Jan Kratochvíl, Martin Pergel
    Two Results on Intersection Graphs of Polygons. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:59-70 [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
    Distance Constrained Labeling of Precolored Trees. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:285-292 [Conf]
  12. Jirí Fiala, Jan Kratochvíl
    Complexity of Partial Covers of Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:537-549 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. Ton Kloks, Jan Kratochvíl, Haiko Müller
    New Branchwidth Territories. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:173-183 [Conf]
  19. 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]
  20. 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]
  21. Jirí Fiala, Jan Kratochvíl
    Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:15-26 [Conf]
  22. Jirí Fiala, Ton Kloks, Jan Kratochvíl
    Fixed-Parameter Complexity of lambda-Labelings. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:350-363 [Conf]
  23. Petr Hlinený, Jan Kratochvíl
    Computational Complexity of the Krausz Dimension of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:214-228 [Conf]
  24. 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]
  25. 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]
  26. 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]
  27. Jan Kratochvíl
    Complexity of Hypergraph Coloring and Seidel's Switching. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:297-308 [Conf]
  28. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
    Complexity of Graph Covering Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:93-105 [Conf]
  29. 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]
  30. Jan Kratochvíl, Zsolt Tuza
    Rankings of Directed Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:114-123 [Conf]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
    Efficient algorithms for graphs with few P4's. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:29-51 [Journal]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. 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]
  54. 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]
  55. 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]
  56. 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]
  57. 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]
  58. 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]
  59. 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]
  60. 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]
  61. 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]
  62. 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]
  63. Svante Janson, Jan Kratochvíl
    Proportional Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:2, pp:209-224 [Journal]
  64. 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]
  65. 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]
  66. 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]
  67. 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]
  68. 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]
  69. 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]
  70. 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]
  71. Jan Kratochvíl, Martin Pergel
    Geometric Intersection Graphs: Do Short Cycles Help? [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:118-128 [Conf]
  72. 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]
  73. 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]
  74. 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]
  75. 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]
  76. 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]
  77. 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]
  78. 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]
  79. 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]

  80. Moving Vertices to Make Drawings Plane. [Citation Graph (, )][DBLP]


  81. Clustered Planarity: Small Clusters in Eulerian Graphs. [Citation Graph (, )][DBLP]


  82. Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. [Citation Graph (, )][DBLP]


  83. The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. [Citation Graph (, )][DBLP]


  84. On Switching to H-Free Graphs. [Citation Graph (, )][DBLP]


  85. Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). [Citation Graph (, )][DBLP]


  86. On tractability of Cops and Robbers game. [Citation Graph (, )][DBLP]


  87. On the Complexity of Reconstructing H -free Graphs from Their Star Systems. [Citation Graph (, )][DBLP]


  88. Faithful Representations of Graphs by Islands in the Extended Grid. [Citation Graph (, )][DBLP]


  89. Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP]


  90. Distance Constrained Labelings of Trees. [Citation Graph (, )][DBLP]


  91. Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. [Citation Graph (, )][DBLP]


  92. Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. [Citation Graph (, )][DBLP]


  93. Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. [Citation Graph (, )][DBLP]


  94. Parameterized Complexity of Generalized Domination Problems. [Citation Graph (, )][DBLP]


  95. On the computational complexity of partial covers of Theta graphs. [Citation Graph (, )][DBLP]


  96. Compatible 2-factors. [Citation Graph (, )][DBLP]


  97. Guest editors' foreword. [Citation Graph (, )][DBLP]


  98. Guest Editors' Foreword. [Citation Graph (, )][DBLP]


  99. Untangling a Planar Graph. [Citation Graph (, )][DBLP]


  100. The capture time of a graph. [Citation Graph (, )][DBLP]


  101. On the computation of the hull number of a graph. [Citation Graph (, )][DBLP]


  102. Preface. [Citation Graph (, )][DBLP]


  103. On the Complexity of the Balanced Vertex Ordering Problem. [Citation Graph (, )][DBLP]


Search in 0.039secs, Finished in 0.044secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002