| 2026 | ESA | Towards the Recognition of Oriented Interval Graphs. | Lukas P. Bachmann, Jir Fiala, Miriam Mnch, Ignaz Rutter, Peter Stumpf, Alexander Wolff |
| 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 |
| 2025 | MFCS | Computational Complexity of Covering Regular Trees. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl |
| 2024 | SOFSEM | Outerplanar and Forest Storyplans. | Jir Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink |
| 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 | IWOCA | List Covering of Regular Multigraphs. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Pawel Rzazewski |
| 2022 | WG | Extending Partial Representations of Circular-Arc Graphs. | Jir Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman |
| 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 | GD | On the Edge-Length Ratio of 2-Trees. | Vclav Blazej, Jir Fiala, Giuseppe Liotta |
| 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 |
| 2014 | ICALP | Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. | Jir Fiala, Pavel Klavk, Jan Kratochvl, Roman Nedela |
| 2013 | CSR | Dichotomy of the H-Quasi-Cover Problem. | Jir Fiala, Marek Tesar |
| 2013 | FCT | Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. | Steven Chaplick, Jir Fiala, Pim van 't Hof, Danil Paulusma, Marek Tesar |
| 2013 | WG | Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. | Hajo Broersma, Jir Fiala, Petr A. Golovach, Toms Kaiser, Danil Paulusma, Andrzej Proskurowski |
| 2010 | STACS | The k-in-a-path Problem for Claw-free Graphs. | Jir Fiala, Marcin Kaminski, Bernard Lidick, Danil Paulusma |
| 2009 | TAMC | Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2008 | CSR | Comparing Universal Covers in Polynomial Time. | Jir Fiala, Danil Paulusma |
| 2008 | ICALP | Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2008 | TAMC | Distance Constrained Labelings of Trees. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2008 | WG | Complexity of the Packing Coloring Problem for Trees. | Jir Fiala, Petr A. Golovach |
| 2006 | WG | Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. | Jir Fiala, Jan Kratochvl |
| 2005 | ICALP | Distance Constrained Labelings of Graphs of Bounded Treewidth. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2005 | MFCS | Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. | Jir Fiala, Danil Paulusma, Jan Arne Telle |
| 2005 | WG | Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. | Jir Fiala, Danil Paulusma, Jan Arne Telle |
| 2004 | WG | Elegant Distance Constrained Labelings of Trees. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2003 | ICALP | The Computational Complexity of the Role Assignment Problem. | Jir Fiala, Danil Paulusma |
| 2002 | GD | Geometric Systems of Disjoint Representatives. | Jir Fiala, Jan Kratochvl, Andrzej Proskurowski |
| 2002 | ISAAC | Scheduling of Independent Dedicated Multiprocessor Tasks. | Evripidis Bampis, Massimiliano Caramia, Jir Fiala, Aleksei V. Fishkin, Antonio Iovanella |
| 2002 | WG | Generalized H-Coloring and H-Covering of Trees. | Jir Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle |
| 2001 | ESA | Online and Offline Distance Constrained Labeling of Disk Graphs. | Jir Fiala, Aleksei V. Fishkin, Fedor V. Fomin |
| 2001 | ISAAC | Complexity of Partial Covers of Graphs. | Jir Fiala, Jan Kratochvl |
| 2001 | WG | Graph Subcolorings: Complexity and Algorithms. | Jir Fiala, Klaus Jansen, Van Bang Le, Eike Seidel |
| 1999 | WG | Fixed-Parameter Complexity of lambda-Labelings. | Jir Fiala, Ton Kloks, Jan Kratochvl |