| 2026 | MFCS | Generalized Snarks, Disjoint Perfect Matchings, and Graph Covers. | Filip Filipi, Jan Kratochvl, Roman Nedela |
| 2026 | STOC | Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective. | Fedor V. Fomin, Petr A. Golovach, Nikola Jedlickov, Jan Kratochvl, Danil Sagunov, Kirill Simonov |
| 2026 | SOFSEM | Edge-Constrained Hamiltonian Paths on a Point Set. | Todor Antic, Aleksa Dzuklevski, Jir Fiala, Jan Kratochvl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Johannes Zink |
| 2026 | WALCOM | The Gate-Cover Problem. | Esther M. Arkin, Alon Efrat, Omrit Filtser, Stephen G. Kobourov, Jan Kratochvl, Joseph S. B. Mitchell, Ariel Rosenberg |
| 2026 | WALCOM | Complexity of Perfect (1, 2)-Dominating Sets in Low-Degree Graphs. | Urszula Bednarz, Jan Kratochvl, Adrian Michalski |
| 2025 | FCT | Simultaneous Contact Representations of Planar Graphs. | Jan Kratochvl, Melanie Reihl |
| 2025 | GD | 1-Planar Unit Distance Graphs with More Edges Than Matchstick Graphs. | Eliska Cervenkov, Jan Kratochvl |
| 2025 | MFCS | Computational Complexity of Covering Regular Trees. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl |
| 2024 | GD | Constrained Outer-String Representations. | Therese Biedl, Sabine Cornelsen, Jan Kratochvl, Ignaz Rutter |
| 2024 | ICML | On a Combinatorial Problem Arising in Machine Teaching. | Joakim Sunde, Brigt Arve Toppe Hvardstun, Jan Kratochvl, Jan Arne Telle |
| 2024 | IWOCA | On the Structure of Hamiltonian Graphs with Small Independence Number. | Nikola Jedlickov, Jan Kratochvl |
| 2023 | GD | The Parametrized Complexity of the Segment Number. | Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvl, Alexander Wolff |
| 2023 | GD | Three Edge-Disjoint Plane Spanning Paths in a Point Set. | Philipp Kindermann, Jan Kratochvl, Giuseppe Liotta, Pavel Valtr |
| 2023 | MFCS | Recognizing H-Graphs - Beyond Circular-Arc Graphs. | Deniz Agaoglu agirici, Onur agirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinen, Jan Kratochvl, Tomasz Krawczyk, Peter Zeman |
| 2023 | WALCOM | Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult. | Jan Kratochvl |
| 2023 | WG | Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Michaela Seifrtov |
| 2022 | GD | The Rique-Number of Graphs. | Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvl, Ignaz Rutter |
| 2022 | IWOCA | List Covering of Regular Multigraphs. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Pawel Rzazewski |
| 2021 | FCT | Computational Complexity of Covering Disconnected Multigraphs. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Michaela Seifrtov |
| 2021 | MFCS | Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. | Jan Bok, Jir Fiala, Petr Hlinen, Nikola Jedlickov, Jan Kratochvl |
| 2020 | MFCS | U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. | Jan Kratochvl, Toms Masark, Jana Novotn |
| 2020 | WALCOM | The Stub Resolution of 1-Planar Graphs. | Michael Kaufmann, Jan Kratochvl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr |
| 2017 | GD | On Vertex- and Empty-Ply Proximity Drawings. | Patrizio Angelini, Steven Chaplick, Felice De Luca, Jir Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvl, Pavel Valtr |
| 2016 | COCOON | Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). | Jir Fiala, Tomas Gavenciak, Dusan Knop, Martin Kouteck, Jan Kratochvl |
| 2016 | COCOON | On the Hardness of Switching to a Small Number of Edges. | Vt Jelnek, Eva Jelnkov, Jan Kratochvl |
| 2016 | GD | Simultaneous Orthogonal Planarity. | Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvl, Fabian Lipp, Ignaz Rutter |
| 2015 | GD | 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. | Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvl, Fabrizio Montecchiani, Ioannis G. Tollis |
| 2015 | ISAAC | Cops and Robbers on String Graphs. | Tomas Gavenciak, Przemyslaw Gordinowicz, Vt Jelnek, Pavel Klavk, Jan Kratochvl |
| 2015 | TAMC | Completion of the Mixed Unit Interval Graphs Hierarchy. | Alexandre Talon, Jan Kratochvl |
| 2014 | GD | Drawing Simultaneously Embedded Graphs with Few Bends. | Luca Grilli, Seok-Hee Hong, Jan Kratochvl, Ignaz Rutter |
| 2014 | ICALP | Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. | Jir Fiala, Pavel Klavk, Jan Kratochvl, Roman Nedela |
| 2014 | ISAAC | Planar Embeddings with Small and Uniform Faces. | Giordano Da Lozzo, Vt Jelnek, Jan Kratochvl, Ignaz Rutter |
| 2014 | MFCS | Computational Complexity of Covering Three-Vertex Multigraphs. | Jan Kratochvl, Jan Arne Telle, Marek Tesar |
| 2014 | WG | Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. | Steven Chaplick, Paul Dorbec, Jan Kratochvl, Mickal Montassier, Juraj Stacho |
| 2013 | ISAAC | Cops and Robbers on Intersection Graphs. | Tomas Gavenciak, Vt Jelnek, Pavel Klavk, Jan Kratochvl |
| 2013 | TAMC | Non-crossing Connectors in the Plane. | Jan Kratochvl, Torsten Ueckerdt |
| 2012 | ESA | Extending Partial Representations of Function Graphs and Permutation Graphs. | Pavel Klavk, Jan Kratochvl, Tomasz Krawczyk, Bartosz Walczak |
| 2012 | ISAAC | Beyond Homothetic Polygons: Recognition and Maximum Clique. | Konstanty Junosza-Szaniawski, Jan Kratochvl, Martin Pergel, Pawel Rzazewski |
| 2012 | ISAAC | Extending Partial Representations of Subclasses of Chordal Graphs. | Pavel Klavk, Jan Kratochvl, Yota Otachi, Toshiki Saitoh |
| 2012 | MFCS | Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width. | Martin Doucha, Jan Kratochvl |
| 2012 | WG | Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. | Steven Chaplick, Vt Jelnek, Jan Kratochvl, Toms Vyskocil |
| 2012 | WG | Determining the L(2, 1)-Span in Polynomial Space. | Konstanty Junosza-Szaniawski, Jan Kratochvl, Mathieu Liedloff, Pawel Rzazewski |
| 2011 | TAMC | Fast Exact Algorithm for | Konstanty Junosza-Szaniawski, Jan Kratochvl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski |
| 2011 | TAMC | Extending Partial Representations of Interval Graphs. | Pavel Klavk, Jan Kratochvl, Toms Vyskocil |
| 2010 | IWOCA | On the Computational Complexity of Degenerate Unit Distance Representations of Graphs. | Boris Horvat, Jan Kratochvl, Tomaz Pisanski |
| 2010 | LATIN | Faithful Representations of Graphs by Islands in the Extended Grid. | Michael D. Coury, Pavol Hell, Jan Kratochvl, Toms Vyskocil |
| 2010 | SODA | Testing Planarity of Partially Embedded Graphs. | Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vt Jelnek, Jan Kratochvl, Maurizio Patrignani, Ignaz Rutter |
| 2009 | GD | The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. | Vt Jelnek, Eva Jelnkov, Jan Kratochvl, Bernard Lidick, Marek Tesar, Toms Vyskocil |
| 2009 | TAMC | Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2009 | WG | Parameterized Complexity of Generalized Domination Problems. | Petr A. Golovach, Jan Kratochvl, Ondrej Such |
| 2008 | GD | Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. | Vt Jelnek, Eva Jelnkov, Jan Kratochvl, Bernard Lidick |
| 2008 | ICALP | Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2008 | LATIN | On the Complexity of Reconstructing H -free Graphs from Their Star Systems. | Fedor V. Fomin, Jan Kratochvl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle |
| 2008 | TAMC | Distance Constrained Labelings of Trees. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2008 | TAMC | Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. | Petr A. Golovach, Jan Kratochvl |
| 2007 | COCOON | Geometric Intersection Graphs: Do Short Cycles Help? | Jan Kratochvl, Martin Pergel |
| 2007 | GD | Moving Vertices to Make Drawings Plane. | Xavier Goaoc, Jan Kratochvl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff |
| 2007 | GD | Clustered Planarity: Small Clusters in Eulerian Graphs. | Eva Jelnkov, Jan Kra, Jan Kratochvl, Martin Pergel, Ondrej Such, Toms Vyskocil |
| 2007 | MFCS | Exact Algorithms for | Jan Kratochvl, Dieter Kratsch, Mathieu Liedloff |
| 2007 | WADS | Branch and Recharge: Exact Algorithms for Generalized Domination. | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvl, Dieter Kratsch, Mathieu Liedloff |
| 2007 | WG | Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. | Petr A. Golovach, Jan Kratochvl |
| 2006 | SODA | Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. | Michael Kaufmann, Jan Kratochvl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian |
| 2006 | WG | Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. | Jir Fiala, Jan Kratochvl |
| 2005 | COCOON | On the Complexity of the Balanced Vertex Ordering Problem. | Jan Kra, Jan Kratochvl, David R. Wood |
| 2005 | ICALP | Distance Constrained Labelings of Graphs of Bounded Treewidth. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2004 | WG | Elegant Distance Constrained Labelings of Trees. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2003 | GD | Two Results on Intersection Graphs of Polygons. | Jan Kratochvl, Martin Pergel |
| 2003 | WG | Complexity of Hypergraph Coloring and Seidel's Switching. | Jan Kratochvl |
| 2002 | GD | Geometric Systems of Disjoint Representatives. | Jir Fiala, Jan Kratochvl, Andrzej Proskurowski |
| 2002 | WG | On the b-Chromatic Number of Graphs. | Jan Kratochvl, Zsolt Tuza, Margit Voigt |
| 2001 | ISAAC | Complexity of Partial Covers of Graphs. | Jir Fiala, Jan Kratochvl |
| 2001 | MFCS | Complexity Note on Mixed Hypergraphs. | Daniel Krl, Jan Kratochvl, Heinz-Jrgen Voss |
| 2001 | WG | Complexity of Coloring Graphs without Forbidden Induced Subgraphs. | Daniel Krl, Jan Kratochvl, Zsolt Tuza, Gerhard J. Woeginger |
| 2000 | SODA | On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). | Jan Kratochvl, Zsolt Tuza |
| 2000 | WG | Coloring Mixed Hypertrees. | Daniel Krl, Jan Kratochvl, Andrzej Proskurowski, Heinz-Jrgen Voss |
| 1999 | STACS | New Branchwidth Territories. | Ton Kloks, Jan Kratochvl, Haiko Mller |
| 1999 | WG | Fixed-Parameter Complexity of lambda-Labelings. | Jir Fiala, Ton Kloks, Jan Kratochvl |
| 1999 | WG | Mod-2 Independence and Domination in Graphs. | Magns M. Halldrsson, Jan Kratochvl, Jan Arne Telle |
| 1998 | GD | Crossing Number of Abstract Topological Graphs. | Jan Kratochvl |
| 1998 | ICALP | Independent Sets with Domination Constraints. | Magns M. Halldrsson, Jan Kratochvl, Jan Arne Telle |
| 1998 | WG | Rankings of Directed Graphs. | Jan Kratochvl, Zsolt Tuza |
| 1997 | WG | Computational Complexity of the Krausz Dimension of Graphs. | Petr Hlinen, Jan Kratochvl |
| 1997 | WG | Complexity of Colored Graph Covers I. Colored Directed Multigraphs. | Jan Kratochvl, Andrzej Proskurowski, Jan Arne Telle |
| 1996 | GD | Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. | Jan Kratochvl |
| 1995 | GD | Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract). | Jan Kratochvl, Teresa M. Przytycka |
| 1994 | WG | Complexity of Graph Covering Problems. | Jan Kratochvl, Andrzej Proskurowski, Jan Arne Telle |
| 1988 | MFCS | On the Computational Complexity of Codes in Graphs. | Jan Kratochvl, Mirko Krivnek |