Jirí Fiala

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 32

Top Topics

Extended Abstract

Equivalence Classes

Computational Complexity

Top Venues

Publications

Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink
Outerplanar and Forest Storyplans. SOFSEM (2024)
Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink
Outerplanar and Forest Storyplans. CoRR (2023)
Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová
Computational Complexity of Covering Disconnected Multigraphs. CoRR (2023)
Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). WG (2023)
Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman
Extending Partial Representations of Circular-Arc Graphs. WG (2022)
Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
List Covering of Regular Multigraphs. IWOCA (2022)
Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
List covering of regular multigraphs. CoRR (2022)
Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. MFCS (2021)
Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman
Extending Partial Representations of Circular-Arc Graphs. CoRR (2021)
Jirí Fiala, Jaroslav Nesetril
Foreword. Eur. J. Comb. 91 (2021)
Václav Blazj, Jirí Fiala, Giuseppe Liotta
On Edge-Length Ratios of Partial 2-Trees. Int. J. Comput. Geom. Appl. 31 (2-3) (2021)
Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová
Computational Complexity of Covering Disconnected Multigraphs. FCT (2021)
Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. CoRR (2021)
Carl Feghali, Jirí Fiala
Reconfiguration graph for vertex colourings of weakly chordal graphs. Discret. Math. 343 (3) (2020)
Therese C. Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
On Layered Fan-Planar Graph Drawings. CoRR (2020)
Václav Blazej, Jirí Fiala, Giuseppe Liotta
On the Edge-Length Ratio of 2-Trees. Graph Drawing (2020)
Václav Blazej, Jirí Fiala, Giuseppe Liotta, Simon Lomic
On the edge-length ratio of 2-trees. CoRR (2019)
Carl Feghali, Jirí Fiala
Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs. CoRR (2019)
Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
Parameterized complexity of distance labeling and uniform channel assignment problems. Discret. Appl. Math. 248 (2018)
Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
3-connected reduction for regular graph covers. Eur. J. Comb. 73 (2018)
Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
On Vertex- and Empty-Ply Proximity Drawings. Graph Drawing (2017)
Jirí Fiala, Jan Hubicka, Yangjing Long
Gaps in full homomorphism order. Electron. Notes Discret. Math. 61 (2017)
Jirí Fiala, Jan Hubicka, Yangjing Long, Jaroslav Nesetril
Fractal property of the graph homomorphism order. Eur. J. Comb. 66 (2017)
Jirí Fiala, Jan Hubicka, Yangjing Long
Gaps in full homomorphism order. CoRR (2017)
Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
On Vertex- and Empty-Ply Proximity Drawings. CoRR (2017)
Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). COCOON (2016)
Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
Algorithmic Aspects of Regular Graph Covers. CoRR (2016)
Jirí Fiala, Jan Hubicka, Yangjing Long, Jaroslav Nesetril
Fractal property of the graph homomorphism order. CoRR (2016)
Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
Distance constrained labeling on graphs with bounded neighborhood diversity. CoRR (2015)
Jirí Fiala, Jan Hubicka, Yangjing Long
An universality argument for graph homomorphisms. Electron. Notes Discret. Math. 49 (2015)
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory 79 (4) (2015)
Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590 (2015)
Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. CoRR (2014)
Jirí Fiala, Jan Hubicka, Yangjing Long
Universality of intervals of line graph order. CoRR (2014)
Jirí Fiala, Jan Hubicka, Yangjing Long
Universality of intervals of line graph order. Eur. J. Comb. 41 (2014)
Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR (2014)
Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. ICALP (1) (2014)
Jirí Fiala, Marcin Kaminski, Daniël Paulusma
A note on contracting claw-free graphs. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Jirí Fiala, Marek Tesar
Dichotomy of the H-Quasi-Cover Problem. CSR (2013)
Jirí Fiala, Jan Kratochvíl, Angsheng Li
Preface. Theor. Comput. Sci. 494 (2013)
Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. FCT (2013)
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs CoRR (2013)
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG (2013)
Jirí Fiala, Marcin Kaminski, Daniël Paulusma
Detecting induced star-like minors in polynomial time. J. Discrete Algorithms 17 (2012)
Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
The k-in-a-Path Problem for Claw-free Graphs. Algorithmica 62 (1-2) (2012)
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma
Distance three labelings of trees. Discret. Appl. Math. 160 (6) (2012)
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412 (23) (2011)
Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický
The packing chromatic number of the square lattice is at least 12 CoRR (2010)
Jirí Fiala, Petr A. Golovach
Complexity of the packing coloring problem for trees. Discret. Appl. Math. 158 (7) (2010)
Jirí Fiala, Daniël Paulusma
Comparing Universal Covers in Polynomial Time. Theory Comput. Syst. 46 (4) (2010)
Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
The k-in-a-path Problem for Claw-free Graphs. STACS (2010)
Jirí Fiala, Sandi Klavzar, Bernard Lidický
The packing chromatic number of infinite product graphs. Eur. J. Comb. 30 (5) (2009)
Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
The k-in-a-path problem for claw-free graphs CoRR (2009)
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC (2009)
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) (2008)
Jirí Fiala, Jan Kratochvíl
Locally constrained graph homomorphisms - structure, complexity, and applications. Comput. Sci. Rev. 2 (2) (2008)
Jirí Fiala, Daniël Paulusma
Comparing Universal Covers in Polynomial Time. CSR (2008)
Jirí Fiala, Jan Kratochvíl, Attila Pór
On the computational complexity of partial covers of Theta graphs. Discret. Appl. Math. 156 (7) (2008)
Jirí Fiala, Daniël Paulusma, Jan Arne Telle
Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29 (4) (2008)
José A. Soto, Jirí Fiala
Block transitivity and degree matrices. Eur. J. Comb. 29 (5) (2008)
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
Distance Constrained Labelings of Trees. TAMC (2008)
Jirí Fiala, Petr A. Golovach
Complexity of the Packing Coloring Problem for Trees. WG (2008)
Jan Kratochvíl, Josep Díaz, Jirí Fiala
Editorial. Discret. Appl. Math. 155 (2) (2007)
Jirí Fiala, José A. Soto
Block transitivity and degree matrices: (Extended abstract). Electron. Notes Discret. Math. 28 (2007)
Jirí Fiala, Jana Maxová
Cantor-Bernstein type theorem for locally constrained graph homomorphisms. Eur. J. Comb. 27 (7) (2006)
Jirí Fiala, Jan Kratochvíl
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. WG (2006)
Jirí Fiala, Daniel Král, Riste Skrekovski
A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discret. Math. 19 (3) (2005)
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP (2005)
Jirí Fiala, Jan Kratochvíl, Attila Pór
On the computational complexity of partial covers of Theta graphs. Electron. Notes Discret. Math. 19 (2005)
Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
Systems of distant representatives. Discret. Appl. Math. 145 (2) (2005)
Jirí Fiala, Riste Skrekovski
Generalized list T-colorings of cycles. Discret. Appl. Math. 148 (1) (2005)
Jirí Fiala, Jan Kratochvíl
-Labeling Problem for Regular Graphs. ICTCS (2005)
Jirí Fiala, Daniël Paulusma, Jan Arne Telle
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG (2005)
Jirí Fiala, Daniël Paulusma
A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349 (1) (2005)
Jirí Fiala, Daniël Paulusma, Jan Arne Telle
Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS (2005)
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
Elegant Distance Constrained Labelings of Trees. WG (2004)
Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326 (1-3) (2004)
Jochen Alber, Jirí Fiala
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52 (2) (2004)
Massimiliano Caramia, Jirí Fiala
New lower bounds on the weighted chromatic number of a graph. Discuss. Math. Graph Theory 24 (2) (2004)
Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
Generalized H-coloring and H-covering of Trees. Nord. J. Comput. 10 (3) (2003)
Jirí Fiala, Daniël Paulusma
The Computational Complexity of the Role Assignment Problem. ICALP (2003)
Jirí Fiala
NP completeness of the edge precoloring extension problem on bipartite graphs. J. Graph Theory 43 (2) (2003)
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
Graph Subcolorings: Complexity and Algorithms. SIAM J. Discret. Math. 16 (4) (2003)
Thomas Erlebach, Jirí Fiala
On-line coloring of geometric intersection graphs. Comput. Geom. 23 (2) (2002)
Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
Generalized H-Coloring and H-Covering of Trees. WG (2002)
Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
Geometric Systems of Disjoint Representatives. Graph Drawing (2002)
Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella
Scheduling of Independent Dedicated Multiprocessor Tasks. ISAAC (2002)
Jirí Fiala, Jan Kratochvíl
Partial covers of graphs. Discuss. Math. Graph Theory 22 (1) (2002)
Jochen Alber, Jirí Fiala
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs. IFIP TCS (2002)
Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
Online and Offline Distance Constrained Labeling of Disk Graphs. ESA (2001)
Jirí Fiala, Jan Kratochvíl
Complexity of Partial Covers of Graphs. ISAAC (2001)
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
Graph Subcolorings: Complexity and Algorithms. WG (2001)
Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
Distance Constrained Labeling of Precolored Trees. ICTCS (2001)
Jirí Fiala
Computational complexity of covering cyclic graphs. Discret. Math. 235 (1-3) (2001)
Jirí Fiala, Ton Kloks, Jan Kratochvíl
Fixed-parameter complexity of lambda-labelings. Discret. Appl. Math. 113 (1) (2001)
Jirí Fiala, Ton Kloks, Jan Kratochvíl
Fixed-Parameter Complexity of lambda-Labelings. WG (1999)