| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil |
Segment representation of a subclass of co-planar graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil |
Matching and l-Subgraph Contractibility to Planar Graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak |
Extending partial representations of function graphs and permutation graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Vít Jelínek, Jan Kratochvíl, Ignaz Rutter |
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jan Kratochvíl, Torsten Ueckerdt |
Non-crossing Connectors in the Plane |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý |
Parameterized complexity of generalized domination problems. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma |
Distance three labelings of trees. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski |
Guest editors' foreword. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Parameterized complexity of coloring problems: Treewidth versus vertex cover. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl |
Parameterized Problems Related to Seidel's Switching. |
Discrete Mathematics & Theoretical Computer Science |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Branch and Recharge: Exact Algorithms for Generalized Domination. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Exact Algorithms for L(2, 1)-Labeling of Graphs. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Jan Kratochvíl (eds.) |
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil |
Extending Partial Representations of Interval Graphs. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski |
Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vít Jelínek, Jan Kratochvíl, Ignaz Rutter |
A kuratowski-type theorem for planarity of partially embedded graphs. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl |
Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs). |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan |
Pursuing a fast robber on a graph. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Jaroslav Nesetril, Zdenek Ryjácek |
Preface. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski |
Guest Editors' Foreword. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio 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 |
DBLP BibTeX RDF |
|
| 1 | Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman (eds.) |
Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil |
Faithful Representations of Graphs by Islands in the Extended Grid. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Horvat, Jan Kratochvíl, Tomaz Pisanski |
On the Computational Complexity of Degenerate Unit Distance Representations of Graphs. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Sort and Search: Exact algorithms for generalized domination. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl |
The capture time of a graph. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff |
Untangling a Planar Graph. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra |
Guest editors' foreword. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva 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. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý |
Parameterized Complexity of Generalized Domination Problems. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ví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 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl, Mirka Miller (eds.) |
Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl |
Locally constrained graph homomorphisms - structure, complexity, and applications. |
Computer Science Review |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Martin Pergel |
Intersection graphs of homothetic polygons. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl, Attila Pór |
On the computational complexity of partial covers of Theta graphs. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva Jelínková, Jan Kratochvíl |
On Switching to H-Free Graphs. |
ICGT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Jan Kratochvíl |
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
Subject Computational complexity, graph algorithms |
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Distance Constrained Labelings of Trees. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl |
On tractability of Cops and Robbers game. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
Pursuit-evasion games on graphs, cliquewidth, algorithms, complexity, parameterized complexity |
| 1 | Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický |
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. |
Graph Drawing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera |
Preface. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kára, Jan Kratochvíl, David R. Wood |
On the Complexity of the Balanced Vertex Ordering Problem. |
Discrete Mathematics & Theoretical Computer Science |
2007 |
DBLP BibTeX RDF |
|
| 1 | Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff |
Moving Vertices to Make Drawings Plane |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jan Kratochvíl, Josep Díaz, Jirí Fiala |
Editorial. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Jan Kratochvíl |
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
Computational complexity, graph algorithms |
| 1 | Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Exact Algorithms for L (2, 1)-Labeling of Graphs. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
CCCG |
2007 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Branch and Recharge: Exact Algorithms for Generalized Domination. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Martin Pergel |
Geometric Intersection Graphs: Do Short Cycles Help? |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff |
Moving Vertices to Make Drawings Plane. |
Graph Drawing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger |
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Computational complexity, Graph coloring, Planar graph, Graph partitioning, Forbidden subgraph |
| 1 | Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss |
Coloring mixed hypertrees. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl |
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran R. Subramanian |
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kára, Jan Kratochvíl |
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl, Attila Pór |
On the computational complexity of partial covers of Theta graphs. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Václav Koubek, Jan Kratochvíl |
Preface. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra |
Structural decompositions, width parameters, and graph labelings. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Jan Kratochvíl, Haiko Müller |
Computing the branchwidth of interval graphs. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski |
Systems of distant representatives. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl |
On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Distance Constrained Labelings of Graphs of Bounded Treewidth. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kára, Jan Kratochvíl, David R. Wood |
On the Complexity of the Balanced Vertex Ordering Problem. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss |
Mixed hypercacti. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Elegant Distance Constrained Labelings of Trees. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Václav Koubek, Jan Kratochvíl (eds.) |
Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings |
MFCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss |
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl |
Complexity of Hypergraph Coloring and Seidel's Switching. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Martin Pergel |
Two Results on Intersection Graphs of Polygons. |
Graph Drawing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau |
On the injective chromatic number of graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Zsolt Tuza |
On the complexity of bicoloring clique hypergraphs of graphs. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert de Fraysseix, Jan Kratochvíl |
Guest Editors' Foreword. |
J. Graph Algorithms Appl. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Jan Kratochvíl, Zsolt Tuza, Margit Voigt |
On the b-Chromatic Number of Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger |
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
computational complexity, graph coloring, planar graph, graph partitioning, forbidden subgraph |
| 1 | Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski |
Geometric Systems of Disjoint Representatives. |
Graph Drawing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Jan Kratochvíl |
Representing graphs by disks and balls (a survey of recognition-complexity results). |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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). |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril |
Foreword. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu |
Efficient algorithms for graphs with few P4's. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Ton Kloks, Jan Kratochvíl |
Fixed-parameter complexity of lambda-labelings. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger |
Complexity of Coloring Graphs without Forbidden Induced Subgraphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski |
Distance Constrained Labeling of Precolored Trees. |
ICTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss |
Complexity Note on Mixed Hypergraphs. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Jan Kratochvíl |
Complexity of Partial Covers of Graphs. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle |
Mod-2 Independence and Domination in Graphs. |
Int. J. Found. Comput. Sci. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Jan Kratochvíl, Peter Mihók |
Hom-properties are uniquely factorizable into irreducible factors. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle |
Independent Sets with Domination Constraints. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss |
Coloring Mixed Hypertrees. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Zsolt Tuza |
On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Zsolt Tuza |
Rankings of Directed Graphs. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle |
Mod-2 Independence and Domination in Graphs. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Ton Kloks, Jan Kratochvíl |
Fixed-Parameter Complexity of lambda-Labelings. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Jan Kratochvíl, Haiko Müller |
New Branchwidth Territories. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl (eds.) |
Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings |
Graph Drawing |
1999 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")