Jan Kratochvíl

251 papers A* 6A 19B 46C 13Misc 4Journal 145Unranked 17

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Complexity of Perfect (1, 2)-Dominating Sets in Low-Degree Graphs. WALCOM Urszula Bednarz, Jan Kratochvíl, Adrian Michalski
2026	J	`jnl`	Computational complexity of covering multigraphs with semi-edges: Small cases. J. Comput. Syst. Sci. Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
2026	B	`conf`	Edge-Constrained Hamiltonian Paths on a Point Set. SOFSEM Todor Antic, Aleksa Dzuklevski, Jirí Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Johannes Zink
2026	J	`jnl`	Grounded String Representations of Series-Parallel Graphs without Transitive Edges. CoRR Sabine Cornelsen, Jan Kratochvíl, Miriam Münch, Giacomo Ortali, Alexandra Weinberger, Alexander Wolff
2026	J	`jnl`	On the structure of Hamiltonian graphs with small independence number. J. Comput. Syst. Sci. Nikola Jedlicková, Jan Kratochvíl
2026	B	`conf`	The Gate-Cover Problem. WALCOM Esther M. Arkin, Alon Efrat, Omrit Filtser, Stephen G. Kobourov, Jan Kratochvíl, Joseph S. B. Mitchell, Ariel Rosenberg
2026	J	`jnl`	Three edge-disjoint plane spanning paths in a point set. Discret. Math. Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
2025	A	`conf`	1-Planar Unit Distance Graphs with More Edges Than Matchstick Graphs. GD Eliska Cervenková, Jan Kratochvíl
2025	J	`jnl`	Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions. CoRR Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová
2025	B	`conf`	Computational Complexity of Covering Regular Trees. MFCS Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl
2025	J	`jnl`	Computational complexity of covering regular trees. CoRR Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl
2025	J	`jnl`	Edge-Constrained Hamiltonian Paths on a Point Set. CoRR Todor Antic, Aleksa Dzuklevski, Jirí Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Johannes Zink
2025	B	`conf`	Simultaneous Contact Representations of Planar Graphs. FCT Jan Kratochvíl, Melanie Reihl
2024	J	`jnl`	Computational complexity of covering disconnected multigraphs. Discret. Appl. Math. Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová
2024	A	`conf`	Constrained Outer-String Representations. GD Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter
2024	J	`jnl`	List Covering of Regular Multigraphs with Semi-edges. Algorithmica Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
2024	A*	`conf`	On a Combinatorial Problem Arising in Machine Teaching. ICML Joakim Sunde, Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Jan Arne Telle
2024	J	`jnl`	On a Combinatorial Problem Arising in Machine Teaching. CoRR Brigt Arve Toppe Håvardstun, Jan Kratochvíl, Joakim Sunde, Jan Arne Telle
2024	C	`conf`	On the Structure of Hamiltonian Graphs with Small Independence Number. IWOCA Nikola Jedlicková, Jan Kratochvíl
2024	J	`jnl`	On the Structure of Hamiltonian Graphs with Small Independence Number. CoRR Nikola Jedlicková, Jan Kratochvíl
2024	J	`jnl`	Preface: Czech-Slovak Graph Theory in honor of Robin Thomas. Discret. Math. Jan Kratochvíl, Martin Loebl, Jaroslav Nesetril
2023	B	`conf`	Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). WG Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová
2023	J	`jnl`	Computational Complexity of Covering Disconnected Multigraphs. CoRR Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová
2023	J	`jnl`	Drawing Simultaneously Embedded Graphs with Few Bends. Int. J. Found. Comput. Sci. Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter
2023	B	`conf`	Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult. WALCOM Jan Kratochvíl
2023	J	`jnl`	Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number. CoRR Nikola Jedlicková, Jan Kratochvíl
2023	B	`conf`	Recognizing H-Graphs - Beyond Circular-Arc Graphs. MFCS Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
2023	—	`conf`	The Parametrized Complexity of the Segment Number. GD (2) Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff
2023	J	`jnl`	The Parametrized Complexity of the Segment Number. CoRR Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff
2023	—	`conf`	Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
2023	J	`jnl`	Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
2022	J	`jnl`	Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. CoRR Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
2022	C	`conf`	List Covering of Regular Multigraphs. IWOCA Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
2022	J	`jnl`	List covering of regular multigraphs. CoRR Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
2022	J	`jnl`	Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. Discret. Appl. Math. Robert Ganian, Jan Kratochvíl, Stefan Szeider
2022	A	`conf`	The Rique-Number of Graphs. GD Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
2022	J	`jnl`	The Rique-Number of Graphs. CoRR Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
2021	B	`conf`	Computational Complexity of Covering Disconnected Multigraphs. FCT Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová
2021	B	`conf`	Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. MFCS Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
2021	J	`jnl`	Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. CoRR Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
2021	J	`jnl`	The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2020	B	`conf`	The Stub Resolution of 1-Planar Graphs. WALCOM Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2020	B	`conf`	U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. MFCS Jan Kratochvíl, Tomás Masarík, Jana Novotná
2020	J	`jnl`	U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited. CoRR Jan Kratochvíl, Tomás Masarík, Jana Novotná
2019	J	`jnl`	Cops, a fast robber and defensive domination on interval graphs. Theor. Comput. Sci. Dariusz Dereniowski, Tomas Gavenciak, Jan Kratochvíl
2018	J	`jnl`	3-connected reduction for regular graph covers. Eur. J. Comb. Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
2018	—	`conf`	Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2018	J	`jnl`	Completion of the mixed unit interval graphs hierarchy. J. Graph Theory Alexandre Talon, Jan Kratochvíl
2018	J	`jnl`	Cops and Robbers on intersection graphs. Eur. J. Comb. Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
2018	J	`jnl`	Homothetic polygons and beyond: Maximal cliques in intersection graphs. Discret. Appl. Math. Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar
2018	J	`jnl`	Parameterized complexity of distance labeling and uniform channel assignment problems. Discret. Appl. Math. Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
2018	J	`jnl`	Preface. Eur. J. Comb. Jan Kratochvíl, Zsuzsanna Lipták
2017	J	`jnl`	Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. J. Graph Algorithms Appl. Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis
2017	J	`jnl`	Extending Partial Representations of Interval Graphs. Algorithmica Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil
2017	J	`jnl`	Extending Partial Representations of Proper and Unit Interval Graphs. Algorithmica Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2017	J	`jnl`	MSOL restricted contractibility to planar graphs. Theor. Comput. Sci. James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil
2017	A	`conf`	On Vertex- and Empty-Ply Proximity Drawings. GD Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
2017	J	`jnl`	On Vertex- and Empty-Ply Proximity Drawings. CoRR Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
2016	J	`jnl`	Algorithmic Aspects of Regular Graph Covers. CoRR Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
2016	J	`jnl`	Computational complexity of covering three-vertex multigraphs. Theor. Comput. Sci. Jan Kratochvíl, Jan Arne Telle, Marek Tesar
2016	J	`jnl`	Cops and Robbers on Intersection Graphs. CoRR Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
2016	Misc	`conf`	Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). COCOON Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
2016	Misc	`conf`	On the Hardness of Switching to a Small Number of Edges. COCOON Vít Jelínek, Eva Jelínková, Jan Kratochvíl
2016	J	`jnl`	On the hardness of switching to a small number of edges. CoRR Vít Jelínek, Eva Jelínková, Jan Kratochvíl
2016	A	`conf`	Simultaneous Orthogonal Planarity. GD Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter
2016	J	`jnl`	Simultaneous Orthogonal Planarity. CoRR Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter
2015	A	`conf`	2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. GD Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis
2015	C	`ed.`	Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers IWOCA Jan Kratochvíl, Mirka Miller, Dalibor Froncek
2015	C	`conf`	Completion of the Mixed Unit Interval Graphs Hierarchy. TAMC Alexandre Talon, Jan Kratochvíl
2015	B	`conf`	Cops and Robbers on String Graphs. ISAAC Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
2015	J	`jnl`	Distance constrained labeling on graphs with bounded neighborhood diversity. CoRR Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
2015	J	`jnl`	Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
2015	J	`jnl`	Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter
2014	—	`conf`	Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. ICALP (1) Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
2014	J	`jnl`	Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. CoRR Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
2014	J	`jnl`	Completion of the mixed unit interval graphs hierarchy. CoRR Alexandre Talon, Jan Kratochvíl
2014	—	`conf`	Computational Complexity of Covering Three-Vertex Multigraphs. MFCS (2) Jan Kratochvíl, Jan Arne Telle, Marek Tesar
2014	B	`conf`	Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. WG Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickaël Montassier, Juraj Stacho
2014	A	`conf`	Drawing Simultaneously Embedded Graphs with Few Bends. GD Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter
2014	—	`conf`	Extending Partial Representations of Proper and Unit Interval Graphs. SWAT Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2014	J	`jnl`	Firefighting on square, hexagonal, and triangular grids. Discret. Math. Tomas Gavenciak, Jan Kratochvíl, Pawel Pralat
2014	J	`jnl`	Guest editors' foreword. Discret. Appl. Math. Pinar Heggernes, Jan Kratochvíl, Sang-il Oum
2014	J	`jnl`	Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. CoRR Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar
2014	J	`jnl`	Locally injective k-colourings of planar graphs. Discret. Appl. Math. Jan Kratochvíl, Mark H. Siggers
2014	J	`jnl`	On Switching to J. Graph Theory Eva Jelínková, Jan Kratochvíl
2014	B	`conf`	Planar Embeddings with Small and Uniform Faces. ISAAC Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2014	J	`jnl`	Planar Embeddings with Small and Uniform Faces. CoRR Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2013	J	`jnl`	A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2013	B	`conf`	Cops and Robbers on Intersection Graphs. ISAAC Tomas Gavenciak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
2013	J	`jnl`	Determining the Discret. Appl. Math. Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski
2013	J	`jnl`	Fast exact algorithm for L(2, 1)-labeling of graphs. Theor. Comput. Sci. Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
2013	J	`jnl`	Linear-time Algorithm for Partial Representation Extension of Interval Graphs. CoRR Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil
2013	C	`conf`	Non-crossing Connectors in the Plane. TAMC Jan Kratochvíl, Torsten Ueckerdt
2013	J	`jnl`	Preface. Eur. J. Comb. Jan Kratochvíl, Mirka Miller
2013	J	`jnl`	Preface. Eur. J. Comb. Jan Kratochvíl, Mirka Miller
2013	J	`jnl`	Preface. Theor. Comput. Sci. Jirí Fiala, Jan Kratochvíl, Angsheng Li
2013	J	`jnl`	The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graphs Comb. Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil
2012	J	`jnl`	A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs CoRR Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2012	J	`jnl`	A note on planar partial 3-trees CoRR Jan Kratochvíl, Michal Vaner
2012	J	`jnl`	Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill CoRR Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil
2012	B	`conf`	Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. WG Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil
2012	B	`conf`	Beyond Homothetic Polygons: Recognition and Maximum Clique. ISAAC Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski
2012	B	`conf`	Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width. MFCS Martin Doucha, Jan Kratochvíl
2012	B	`conf`	Determining the L(2, 1)-Span in Polynomial Space. WG Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski
2012	J	`jnl`	Distance three labelings of trees. Discret. Appl. Math. Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma
2012	A	`conf`	Extending Partial Representations of Function Graphs and Permutation Graphs. ESA Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak
2012	J	`jnl`	Extending Partial Representations of Proper and Unit Interval Graphs CoRR Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2012	J	`jnl`	Extending Partial Representations of Subclasses of Chordal Graphs CoRR Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
2012	B	`conf`	Extending Partial Representations of Subclasses of Chordal Graphs. ISAAC Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
2012	J	`jnl`	Extending partial representations of function graphs and permutation graphs CoRR Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak
2012	J	`jnl`	Guest editors' foreword. Discret. Appl. Math. Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski
2012	B	`conf`	MSOL Restricted Contractibility to Planar Graphs. IPEC James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil
2012	J	`jnl`	Matching and l-Subgraph Contractibility to Planar Graphs CoRR James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil
2012	J	`jnl`	Non-crossing Connectors in the Plane CoRR Jan Kratochvíl, Torsten Ueckerdt
2012	J	`jnl`	Parameterized complexity of generalized domination problems. Discret. Appl. Math. Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý
2012	J	`jnl`	Segment representation of a subclass of co-planar graphs. Discret. Math. Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil
2011	—	`conf`	A kuratowski-type theorem for planarity of partially embedded graphs. SCG Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
2011	J	`jnl`	Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2011	—	`conf`	Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs). SCG Jan Kratochvíl
2011	J	`jnl`	Exact Algorithms for Algorithmica Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2011	C	`conf`	Extending Partial Representations of Interval Graphs. TAMC Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil
2011	C	`conf`	Fast Exact Algorithm for TAMC Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
2011	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers WG Petr Kolman, Jan Kratochvíl
2011	J	`jnl`	On the complexity of reconstructing J. Graph Theory Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
2011	J	`jnl`	Parameterized Problems Related to Seidel's Switching. Discret. Math. Theor. Comput. Sci. Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl
2011	J	`jnl`	Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2010	B	`conf`	Faithful Representations of Graphs by Islands in the Extended Grid. LATIN Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil
2010	J	`jnl`	Guest Editors' Foreword. Discret. Appl. Math. Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski
2010	C	`conf`	On the Computational Complexity of Degenerate Unit Distance Representations of Graphs. IWOCA Boris Horvat, Jan Kratochvíl, Tomaz Pisanski
2010	J	`jnl`	Preface. Discret. Math. Jan Kratochvíl, Jaroslav Nesetril, Zdenek Ryjácek
2010	J	`jnl`	Pursuing a fast robber on a graph. Theor. Comput. Sci. Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan
2010	A*	`conf`	Testing Planarity of Partially Embedded Graphs. SODA Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter
2010	C	`ed.`	Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings TAMC Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman
2009	J	`jnl`	Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. J. Graph Algorithms Appl. Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil
2009	C	`ed.`	Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers IWOCA Jirí Fiala, Jan Kratochvíl, Mirka Miller
2009	J	`jnl`	Guest editors' foreword. Discret. Appl. Math. Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra
2009	J	`jnl`	On the computation of the hull number of a graph. Discret. Math. Mitre Costa Dourado, John G. Gimbel, Jan Kratochvíl, Fábio Protti, Jayme Luiz Szwarcfiter
2009	C	`conf`	Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2009	B	`conf`	Parameterized Complexity of Generalized Domination Problems. WG Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý
2009	J	`jnl`	Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2009	A	`conf`	The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. GD Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil
2009	J	`jnl`	The capture time of a graph. Discret. Math. Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl
2009	J	`jnl`	Untangling a Planar Graph. Discret. Comput. Geom. Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff
2008	A	`conf`	Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. GD Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický
2008	—	`conf`	Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2008	C	`conf`	Distance Constrained Labelings of Trees. TAMC Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2008	C	`conf`	Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. TAMC Petr A. Golovach, Jan Kratochvíl
2008	J	`jnl`	Intersection graphs of homothetic polygons. Electron. Notes Discret. Math. Jan Kratochvíl, Martin Pergel
2008	J	`jnl`	Locally constrained graph homomorphisms - structure, complexity, and applications. Comput. Sci. Rev. Jirí Fiala, Jan Kratochvíl
2008	B	`conf`	On Switching to H-Free Graphs. ICGT Eva Jelínková, Jan Kratochvíl
2008	B	`conf`	On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
2008	J	`jnl`	On the computational complexity of partial covers of Theta graphs. Discret. Appl. Math. Jirí Fiala, Jan Kratochvíl, Attila Pór
2008	—	`conf`	On tractability of Cops and Robbers game. IFIP TCS Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl
2007	B	`conf`	Branch and Recharge: Exact Algorithms for Generalized Domination. WADS Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2007	A	`conf`	Clustered Planarity: Small Clusters in Eulerian Graphs. GD Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil
2007	B	`conf`	Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG Petr A. Golovach, Jan Kratochvíl
2007	J	`jnl`	Dislocation dynamics - analytical description of the interaction force between dipolar loops. Kybernetika Vojtech Minárik, Jan Kratochvíl
2007	J	`jnl`	Editorial. Discret. Appl. Math. Jan Kratochvíl, Josep Díaz, Jirí Fiala
2007	B	`conf`	Exact Algorithms for MFCS Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2007	Misc	`conf`	Geometric Intersection Graphs: Do Short Cycles Help? COCOON Jan Kratochvíl, Martin Pergel
2007	—	`conf`	Homothetic Triangle Contact Representations of Planar Graphs. CCCG Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta
2007	A	`conf`	Moving Vertices to Make Drawings Plane. GD Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
2007	J	`jnl`	On the Complexity of the Balanced Vertex Ordering Problem. Discret. Math. Theor. Comput. Sci. Jan Kára, Jan Kratochvíl, David R. Wood
2007	J	`jnl`	Preface. Electron. Notes Discret. Math. Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera
2006	J	`jnl`	Coloring mixed hypertrees. Discret. Appl. Math. Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss
2006	—	`conf`	Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. IWPEC Jan Kára, Jan Kratochvíl
2006	B	`conf`	Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. WG Jirí Fiala, Jan Kratochvíl
2006	A*	`conf`	Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. SODA Michael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian
2006	J	`jnl`	Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
2005	J	`jnl`	Computing the branchwidth of interval graphs. Discret. Appl. Math. Ton Kloks, Jan Kratochvíl, Haiko Müller
2005	A*	`conf`	Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2005	Misc	`conf`	On the Complexity of the Balanced Vertex Ordering Problem. COCOON Jan Kára, Jan Kratochvíl, David R. Wood
2005	—	`conf`	On the Computational Complexity of the ICTCS Jirí Fiala, Jan Kratochvíl
2005	J	`jnl`	On the computational complexity of partial covers of Theta graphs. Electron. Notes Discret. Math. Jirí Fiala, Jan Kratochvíl, Attila Pór
2005	J	`jnl`	Preface. Theor. Comput. Sci. Václav Koubek, Jan Kratochvíl
2005	J	`jnl`	Structural decompositions, width parameters, and graph labelings. Discret. Appl. Math. Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra
2005	J	`jnl`	Systems of distant representatives. Discret. Appl. Math. Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
2004	B	`conf`	Elegant Distance Constrained Labelings of Trees. WG Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2004	B	`ed.`	Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings MFCS Jirí Fiala, Václav Koubek, Jan Kratochvíl
2004	J	`jnl`	Mixed hypercacti. Discret. Math. Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
2003	B	`conf`	Complexity of Hypergraph Coloring and Seidel's Switching. WG Jan Kratochvíl
2003	J	`jnl`	Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theor. Comput. Sci. Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
2003	A	`conf`	Two Results on Intersection Graphs of Polygons. GD Jan Kratochvíl, Martin Pergel
2002	A	`conf`	Geometric Systems of Disjoint Representatives. GD Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
2002	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Hubert de Fraysseix, Jan Kratochvíl
2002	B	`conf`	On the b-Chromatic Number of Graphs. WG Jan Kratochvíl, Zsolt Tuza, Margit Voigt
2002	J	`jnl`	On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms Jan Kratochvíl, Zsolt Tuza
2002	J	`jnl`	On the injective chromatic number of graphs. Discret. Math. Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau
2002	J	`jnl`	Partial covers of graphs. Discuss. Math. Graph Theory Jirí Fiala, Jan Kratochvíl
2002	—	`conf`	Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
2001	B	`conf`	Complexity Note on Mixed Hypergraphs. MFCS Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss
2001	B	`conf`	Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger
2001	B	`conf`	Complexity of Partial Covers of Graphs. ISAAC Jirí Fiala, Jan Kratochvíl
2001	J	`jnl`	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). Discret. Math. Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril
2001	—	`conf`	Distance Constrained Labeling of Precolored Trees. ICTCS Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
2001	J	`jnl`	Efficient algorithms for graphs with few Discret. Math. Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
2001	J	`jnl`	Fixed-parameter complexity of lambda-labelings. Discret. Appl. Math. Jirí Fiala, Ton Kloks, Jan Kratochvíl
2001	J	`jnl`	Foreword. Discret. Math. Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril
2001	J	`jnl`	Representing graphs by disks and balls (a survey of recognition-complexity results). Discret. Math. Petr Hlinený, Jan Kratochvíl
2000	B	`conf`	Coloring Mixed Hypertrees. WG Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss
2000	J	`jnl`	Hom-properties are uniquely factorizable into irreducible factors. Discret. Math. Jan Kratochvíl, Peter Mihók
2000	J	`jnl`	Independent Sets with Domination Constraints. Discret. Appl. Math. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
2000	J	`jnl`	Mod-2 Independence and Domination in Graphs. Int. J. Found. Comput. Sci. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
2000	A*	`conf`	On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). SODA Jan Kratochvíl, Zsolt Tuza
1999	—	`ed.`	Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997 Contemporary Trends in Discrete Mathematics Ronald L. Graham, Jan Kratochvíl, Jaroslav Nesetril, Fred S. Roberts
1999	B	`conf`	Fixed-Parameter Complexity of lambda-Labelings. WG Jirí Fiala, Ton Kloks, Jan Kratochvíl
1999	A	`ed.`	Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings GD Jan Kratochvíl
1999	B	`conf`	Mod-2 Independence and Domination in Graphs. WG Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
1999	A	`conf`	New Branchwidth Territories. STACS Ton Kloks, Jan Kratochvíl, Haiko Müller
1999	J	`jnl`	Rankings of Directed Graphs. SIAM J. Discret. Math. Jan Kratochvíl, Zsolt Tuza
1998	J	`jnl`	Brooks-type theorems for choosability with separation. J. Graph Theory Jan Kratochvíl, Zsolt Tuza, Margit Voigt
1998	J	`jnl`	Complexity of choosing subsets from color sets. Discret. Math. Jan Kratochvíl, Zsolt Tuza, Margit Voigt
1998	A	`conf`	Crossing Number of Abstract Topological Graphs. GD Jan Kratochvíl
1998	J	`jnl`	Disjoint and unfolding domination in graphs. Australas. J Comb. Jan Kratochvíl, Paul D. Manuel, Mirka Miller, Andrzej Proskurowski
1998	A*	`conf`	Independent Sets with Domination Constraints. ICALP Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
1998	J	`jnl`	On intersection representations of co-planar graphs. Discret. Math. Jan Kratochvíl, Ales Kubena
1998	J	`jnl`	On the Complexity of Graph Covering Problems. Nord. J. Comput. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1998	B	`conf`	Rankings of Directed Graphs. WG Jan Kratochvíl, Zsolt Tuza
1997	J	`jnl`	Coloring precolored perfect graphs. J. Graph Theory Jan Kratochvíl, András Sebö
1997	B	`conf`	Complexity of Colored Graph Covers I. Colored Directed Multigraphs. WG Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1997	B	`conf`	Computational Complexity of the Krausz Dimension of Graphs. WG Petr Hlinený, Jan Kratochvíl
1997	J	`jnl`	Covering Regular Graphs. J. Comb. Theory B Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1997	J	`jnl`	Covering and coloring polygon-circle graphs. Discret. Math. Alexandr V. Kostochka, Jan Kratochvíl
1997	J	`jnl`	Graphs maximal with respect to hom-properties. Discuss. Math. Graph Theory Jan Kratochvíl, Peter Mihók, Gabriel Semanisin
1997	—	`conf`	New trends in the theory of graph colorings: Choosability and list coloring. Contemporary Trends in Discrete Mathematics Jan Kratochvíl, Zsolt Tuza, Margit Voigt
1997	J	`jnl`	On the computational complexity of (O, P)-partition problems. Discuss. Math. Graph Theory Jan Kratochvíl, Ingo Schiermeyer
1997	J	`jnl`	Transversal Partitioning in Balanced Hypergraphs. Discret. Appl. Math. Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller
1996	A	`conf`	Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. GD Jan Kratochvíl
1995	J	`jnl`	Generalized Domination in Chordal Graphs. Nord. J. Comput. Jan Kratochvíl, Paul D. Manuel, Mirka Miller
1995	A	`conf`	Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract). GD Jan Kratochvíl, Teresa M. Przytycka
1995	J	`jnl`	The Complexity of Induced Minors and Related Problems. Algorithmica Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer
1994	J	`jnl`	A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness. Discret. Appl. Math. Jan Kratochvíl
1994	J	`jnl`	Algorithmic complexity of list colorings. Discret. Appl. Math. Jan Kratochvíl, Zsolt Tuza
1994	B	`conf`	Complexity of Graph Covering Problems. WG Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
1994	J	`jnl`	Intersection Dimensions of Graph Classes. Graphs Comb. Jan Kratochvíl, Zsolt Tuza
1994	J	`jnl`	Intersection Graphs of Segments. J. Comb. Theory B Jan Kratochvíl, Jirí Matousek
1994	J	`jnl`	Regular codes in regular graphs are difficult. Discret. Math. Jan Kratochvíl
1993	J	`jnl`	One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete. SIAM J. Comput. Jan Kratochvíl, Petr Savický, Zsolt Tuza
1993	J	`jnl`	Satisfiability of Co-Nested Formulas. Acta Informatica Jan Kratochvíl, Mirko Krivánek
1992	J	`jnl`	Compatible 2-factors. Discret. Appl. Math. Jan Kratochvíl, Svatopluk Poljak
1992	J	`jnl`	Thresholds for classes of intersection graphs. Discret. Math. Svante Janson, Jan Kratochvíl
1991	—	`conf`	Induced minors and related problems. Graph Structure Theory Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer
1991	J	`jnl`	Noncrossing Subgraphs in Topological Layouts. SIAM J. Discret. Math. Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril
1991	J	`jnl`	Proportional Graphs. Random Struct. Algorithms Svante Janson, Jan Kratochvíl
1991	J	`jnl`	String graphs requiring exponential representations. J. Comb. Theory B Jan Kratochvíl, Jirí Matousek
1991	J	`jnl`	String graphs. I. The number of critical nonstring graphs is infinite. J. Comb. Theory B Jan Kratochvíl
1991	J	`jnl`	String graphs. II. recognizing string graphs is NP-hard. J. Comb. Theory B Jan Kratochvíl
1988	J	`jnl`	On Restricted Two-Factors. SIAM J. Discret. Math. Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz
1988	B	`conf`	On the Computational Complexity of Codes in Graphs. MFCS Jan Kratochvíl, Mirko Krivánek
1988	J	`jnl`	On the number of Hamiltonian cycles in triangulations. J. Graph Theory Jan Kratochvíl, Dainis Zeps
1986	J	`jnl`	Perfect codes over graphs. J. Comb. Theory B Jan Kratochvíl