Online and Offline Distance Constrained Labeling of Disk Graphs. - Jirí Fiala 001; Aleksei V. Fishkin; Fedor V. Fomin (ESA, 2001)

Distance Constrained Labeling of Precolored Trees. - Jirí Fiala 001; Jan Kratochvíl; Andrzej Proskurowski (ICTCS, 2001)

Complexity of Partial Covers of Graphs. - Jirí Fiala 001; Jan Kratochvíl (ISAAC, 2001)

Fixed-parameter complexity of lambda-labelings. - Jirí Fiala 001; Ton Kloks; Jan Kratochvíl (Discret. Appl. Math., 2001)

Computational complexity of covering cyclic graphs. - Jirí Fiala 001 (Discret. Math., 2001)

Geometric Systems of Disjoint Representatives. - Jirí Fiala 001; Jan Kratochvíl; Andrzej Proskurowski (GD, 2002)

Scheduling of Independent Dedicated Multiprocessor Tasks. - Evripidis Bampis; Massimiliano Caramia; Jirí Fiala 001; Aleksei V. Fishkin; Antonio Iovanella (ISAAC, 2002)

On-line coloring of geometric intersection graphs. - Thomas Erlebach; Jirí Fiala 001 (Comput. Geom., 2002)

Partial covers of graphs. - Jirí Fiala 001; Jan Kratochvíl (Discuss. Math. Graph Theory, 2002)

The Computational Complexity of the Role Assignment Problem. - Jirí Fiala 001; Daniël Paulusma (ICALP, 2003)

NP completeness of the edge precoloring extension problem on bipartite graphs. - Jirí Fiala 001 (J. Graph Theory, 2003)

Generalized H-coloring and H-covering of Trees. - Jirí Fiala 001; Pinar Heggernes; Petter Kristiansen; Jan Arne Telle (Nord. J. Comput., 2003)

Graph Subcolorings: Complexity and Algorithms. - Jirí Fiala 001; Klaus Jansen; Van Bang Le; Eike Seidel (SIAM J. Discret. Math., 2003)

Elegant Distance Constrained Labelings of Trees. - Jirí Fiala 001; Petr A. Golovach; Jan Kratochvíl (WG, 2004)

New lower bounds on the weighted chromatic number of a graph. - Massimiliano Caramia; Jirí Fiala 001 (Discuss. Math. Graph Theory, 2004)

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. - Jochen Alber; Jirí Fiala 001 (J. Algorithms, 2004)

On distance constrained labeling of disk graphs. - Jirí Fiala 001; Aleksei V. Fishkin; Fedor V. Fomin (Theor. Comput. Sci., 2004)

Distance Constrained Labelings of Graphs of Bounded Treewidth. - Jirí Fiala 001; Petr A. Golovach; Jan Kratochvíl (ICALP, 2005)

On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs. - Jirí Fiala 001; Jan Kratochvíl (ICTCS, 2005)

Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. - Jirí Fiala 001; Daniël Paulusma; Jan Arne Telle (MFCS, 2005)

Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. - Jirí Fiala 001; Daniël Paulusma; Jan Arne Telle (WG, 2005)

Systems of distant representatives. - Jirí Fiala 001; Jan Kratochvíl; Andrzej Proskurowski (Discret. Appl. Math., 2005)

Generalized list T-colorings of cycles. - Jirí Fiala 001; Riste Skrekovski (Discret. Appl. Math., 2005)

A Brooks-Type Theorem for the Generalized List T-Coloring. - Jirí Fiala 001; Daniel Král; Riste Skrekovski (SIAM J. Discret. Math., 2005)

A complete complexity classification of the role assignment problem. - Jirí Fiala 001; Daniël Paulusma (Theor. Comput. Sci., 2005)

Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. - Jirí Fiala 001; Jan Kratochvíl (WG, 2006)

Cantor-Bernstein type theorem for locally constrained graph homomorphisms. - Jirí Fiala 001; Jana Maxová (Eur. J. Comb., 2006)

Independence and Coloring Problems on Intersection Graphs of Disks. - Thomas Erlebach; Jirí Fiala 001 (Efficient Approximation and Online Algorithms, 2006)

Editorial. - Jan Kratochvíl; Josep Díaz; Jirí Fiala 001 (Discret. Appl. Math., 2007)

Block transitivity and degree matrices: (Extended abstract). - Jirí Fiala 001; José A. Soto (Electron. Notes Discret. Math., 2007)

Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). - Jirí Fiala 001; Petr A. Golovach; Jan Kratochvíl (ICALP (1), 2008)

Distance Constrained Labelings of Trees. - Jirí Fiala 001; Petr A. Golovach; Jan Kratochvíl (TAMC, 2008)

Locally constrained graph homomorphisms - structure, complexity, and applications. - Jirí Fiala 001; Jan Kratochvíl (Comput. Sci. Rev., 2008)

On the computational complexity of partial covers of Theta graphs. - Jirí Fiala 001; Jan Kratochvíl; Attila Pór (Discret. Appl. Math., 2008)

Locally constrained graph homomorphisms and equitable partitions. - Jirí Fiala 001; Daniël Paulusma; Jan Arne Telle (Eur. J. Comb., 2008)

Block transitivity and degree matrices. - José A. Soto; Jirí Fiala 001 (Eur. J. Comb., 2008)

The packing chromatic number of infinite product graphs. - Jirí Fiala 001; Sandi Klavzar; Bernard Lidický (Eur. J. Comb., 2009)

The packing chromatic number of the square lattice is at least 12 - Jan Ekstein; Jirí Fiala 001; Premysl Holub; Bernard Lidický (CoRR, 2010)

Complexity of the packing coloring problem for trees. - Jirí Fiala 001; Petr A. Golovach (Discret. Appl. Math., 2010)

Comparing Universal Covers in Polynomial Time. - Jirí Fiala 001; Daniël Paulusma (Theory Comput. Syst., 2010)

Parameterized complexity of coloring problems: Treewidth versus vertex cover. - Jirí Fiala 001; Petr A. Golovach; Jan Kratochvíl (Theor. Comput. Sci., 2011)

The k-in-a-Path Problem for Claw-free Graphs. - Jirí Fiala 001; Marcin Kaminski 001; Bernard Lidický; Daniël Paulusma (Algorithmica, 2012)

Distance three labelings of trees. - Jirí Fiala 001; Petr A. Golovach; Jan Kratochvíl; Bernard Lidický; Daniël Paulusma (Discret. Appl. Math., 2012)

Detecting induced star-like minors in polynomial time. - Jirí Fiala 001; Marcin Kaminski 001; Daniël Paulusma (J. Discrete Algorithms, 2012)

Dichotomy of the H-Quasi-Cover Problem. - Jirí Fiala 001; Marek Tesar 001 (CSR, 2013)

A note on contracting claw-free graphs. - Jirí Fiala 001; Marcin Kaminski 001; Daniël Paulusma (Discret. Math. Theor. Comput. Sci., 2013)

Preface. - Jirí Fiala 001; Jan Kratochvíl; Angsheng Li (Theor. Comput. Sci., 2013)

Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. - Jirí Fiala 001; Pavel Klavík; Jan Kratochvíl; Roman Nedela (ICALP (1), 2014)

Universality of intervals of line graph order. - Jirí Fiala 001; Jan Hubicka; Yangjing Long (Eur. J. Comb., 2014)

Distance constrained labeling on graphs with bounded neighborhood diversity. - Jirí Fiala 001; Tomas Gavenciak; Dusan Knop; Martin Koutecký; Jan Kratochvíl (CoRR, 2015)

An universality argument for graph homomorphisms. - Jirí Fiala 001; Jan Hubicka; Yangjing Long (Electron. Notes Discret. Math., 2015)

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. - Hajo Broersma; Jirí Fiala 001; Petr A. Golovach; Tomás Kaiser; Daniël Paulusma; Andrzej Proskurowski (J. Graph Theory, 2015)

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. - Steven Chaplick; Jirí Fiala 001; Pim van 't Hof; Daniël Paulusma; Marek Tesar 001 (Theor. Comput. Sci., 2015)

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). - Jirí Fiala 001; Tomas Gavenciak; Dusan Knop; Martin Koutecký; Jan Kratochvíl (COCOON, 2016)

Algorithmic Aspects of Regular Graph Covers. - Jirí Fiala 001; Pavel Klavík; Jan Kratochvíl; Roman Nedela (CoRR, 2016)

On Vertex- and Empty-Ply Proximity Drawings. - Patrizio Angelini; Steven Chaplick; Felice De Luca; Jirí Fiala 001; Jaroslav Hancl Jr.; Niklas Heinsohn; Michael Kaufmann 001; Stephen G. Kobourov; Jan Kratochvíl; Pavel Valtr 001 (GD, 2017)

Fractal property of the graph homomorphism order. - Jirí Fiala 001; Jan Hubicka; Yangjing Long; Jaroslav Nesetril (Eur. J. Comb., 2017)

Gaps in full homomorphism order. - Jirí Fiala 001; Jan Hubicka; Yangjing Long (Electron. Notes Discret. Math., 2017)

Parameterized complexity of distance labeling and uniform channel assignment problems. - Jirí Fiala 001; Tomas Gavenciak; Dusan Knop; Martin Koutecký; Jan Kratochvíl (Discret. Appl. Math., 2018)

3-connected reduction for regular graph covers. - Jirí Fiala 001; Pavel Klavík; Jan Kratochvíl; Roman Nedela (Eur. J. Comb., 2018)

On the edge-length ratio of 2-trees. - Václav Blazej; Jirí Fiala 001; Giuseppe Liotta; Simon Lomic (CoRR, 2019)

On the Edge-Length Ratio of 2-Trees. - Václav Blazej; Jirí Fiala 001; Giuseppe Liotta (GD, 2020)

On Layered Fan-Planar Graph Drawings. - Therese Biedl; Steven Chaplick; Jirí Fiala 001; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Chrysanthi N. Raftopoulou (CoRR, 2020)

Reconfiguration graph for vertex colourings of weakly chordal graphs. - Carl Feghali; Jirí Fiala 001 (Discret. Math., 2020)

Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. - Jan Bok; Jirí Fiala 001; Petr Hlinený; Nikola Jedlicková; Jan Kratochvíl (MFCS, 2021)

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. - Jan Bok; Jirí Fiala 001; Petr Hlinený; Nikola Jedlicková; Jan Kratochvíl (CoRR, 2021)

Foreword. - Jirí Fiala 001; Jaroslav Nesetril (Eur. J. Comb., 2021)

On Edge-Length Ratios of Partial 2-Trees. - Václav Blazej; Jirí Fiala 001; Giuseppe Liotta (Int. J. Comput. Geom. Appl., 2021)

List Covering of Regular Multigraphs. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Pawel Rzazewski (IWOCA, 2022)

Extending Partial Representations of Circular-Arc Graphs. - Jirí Fiala 001; Ignaz Rutter; Peter Stumpf; Peter Zeman 001 (WG, 2022)

Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Michaela Seifrtová (WG, 2023)

Outerplanar and Forest Storyplans. - Jirí Fiala 001; Oksana Firman; Giuseppe Liotta; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2024)

Computational complexity of covering disconnected multigraphs. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Michaela Seifrtová (Discret. Appl. Math., 2024)

List Covering of Regular Multigraphs with Semi-edges. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Pawel Rzazewski (Algorithmica, 2024)

Computational Complexity of Covering Regular Trees. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl (MFCS, 2025)

A novel approach to covers of multigraphs with semi-edges. - Jirí Fiala 001; Michaela Seifrtová (Discuss. Math. Graph Theory, 2025)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Michaela Seifrtová (CoRR, 2025)