Jirí Fiala

According to our database, Jirí Fiala authored at least 74 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

List Covering of Regular Multigraphs with Semi-edges.

Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski

Algorithmica, March, 2024

Outerplanar and Forest Storyplans.

Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

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 Kratochvíl, Michaela Seifrtová

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022

Extending Partial Representations of Circular-Arc Graphs.

Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

List Covering of Regular Multigraphs.

Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

On Edge-Length Ratios of Partial 2-Trees.

Václav Blazj, Jirí Fiala, Giuseppe Liotta

Int. J. Comput. Geom. Appl., 2021

Foreword.

Jirí Fiala, Jaroslav Nesetril

Eur. J. Comb., 2021

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges.

Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl

CoRR, 2021

Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases.

Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Computational Complexity of Covering Disconnected Multigraphs.

Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

Reconfiguration graph for vertex colourings of weakly chordal graphs.

Carl Feghali, Jirí Fiala

Discret. Math., 2020

On Layered Fan-Planar Graph Drawings.

Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou

CoRR, 2020

On the Edge-Length Ratio of 2-Trees.

Václav Blazej, Jirí Fiala, Giuseppe Liotta

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

On the edge-length ratio of 2-trees.

Václav Blazej, Jirí Fiala, Giuseppe Liotta, Simon Lomic

CoRR, 2019

2018

3-connected reduction for regular graph covers.

Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela

Eur. J. Comb., 2018

Parameterized complexity of distance labeling and uniform channel assignment problems.

Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl

Discret. Appl. Math., 2018

2017

Gaps in full homomorphism order.

Jirí Fiala, Jan Hubicka, Yangjing Long

Electron. Notes Discret. Math., 2017

Fractal property of the graph homomorphism order.

Jirí Fiala, Jan Hubicka, Yangjing Long, Jaroslav Nesetril

Eur. J. Comb., 2017

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 Kratochvíl, Pavel Valtr

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Algorithmic Aspects of Regular Graph Covers.

Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela

CoRR, 2016

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract).

Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar

Theor. Comput. Sci., 2015

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.

Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski

J. Graph Theory, 2015

An universality argument for graph homomorphisms.

Jirí Fiala, Jan Hubicka, Yangjing Long

Electron. Notes Discret. Math., 2015

Distance constrained labeling on graphs with bounded neighborhood diversity.

Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl

CoRR, 2015

2014

Universality of intervals of line graph order.

Jirí Fiala, Jan Hubicka, Yangjing Long

Eur. J. Comb., 2014

Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs.

Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Preface.

Jirí Fiala, Jan Kratochvíl, Angsheng Li

Theor. Comput. Sci., 2013

A note on contracting claw-free graphs.

Jirí Fiala, Marcin Kaminski, Daniël Paulusma

Discret. Math. Theor. Comput. Sci., 2013

Dichotomy of the H-Quasi-Cover Problem.

Jirí Fiala, Marek Tesar

Proceedings of the Computer Science - Theory and Applications, 2013

2012

Detecting induced star-like minors in polynomial time.

Jirí Fiala, Marcin Kaminski, Daniël Paulusma

J. Discrete Algorithms, 2012

Distance three labelings of trees.

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma

Discret. Appl. Math., 2012

The k-in-a-Path Problem for Claw-free Graphs.

Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma

Algorithmica, 2012

2011

Parameterized complexity of coloring problems: Treewidth versus vertex cover.

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl

Theor. Comput. Sci., 2011

2010

Comparing Universal Covers in Polynomial Time.

Jirí Fiala, Daniël Paulusma

Theory Comput. Syst., 2010

Complexity of the packing coloring problem for trees.

Jirí Fiala, Petr A. Golovach

Discret. Appl. Math., 2010

The packing chromatic number of the square lattice is at least 12

Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický

CoRR, 2010

2009

The packing chromatic number of infinite product graphs.

Jirí Fiala, Sandi Klavzar, Bernard Lidický

Eur. J. Comb., 2009

2008

Block transitivity and degree matrices.

José A. Soto, Jirí Fiala

Eur. J. Comb., 2008

Locally constrained graph homomorphisms and equitable partitions.

Jirí Fiala, Daniël Paulusma, Jan Arne Telle

Eur. J. Comb., 2008

Locally constrained graph homomorphisms - structure, complexity, and applications.

Jirí Fiala, Jan Kratochvíl

Comput. Sci. Rev., 2008

Distance Constrained Labelings of Trees.

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl

Proceedings of the Theory and Applications of Models of Computation, 2008

Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract).

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Block transitivity and degree matrices: (Extended abstract).

Jirí Fiala, José A. Soto

Electron. Notes Discret. Math., 2007

Editorial.

Jan Kratochvíl, Josep Díaz, Jirí Fiala

Discret. Appl. Math., 2007

2006

Independence and Coloring Problems on Intersection Graphs of Disks.

Thomas Erlebach, Jirí Fiala

Proceedings of the Efficient Approximation and Online Algorithms, 2006

Cantor-Bernstein type theorem for locally constrained graph homomorphisms.

Jirí Fiala, Jana Maxová

Eur. J. Comb., 2006

Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy.

Jirí Fiala, Jan Kratochvíl

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005

A complete complexity classification of the role assignment problem.

Jirí Fiala, Daniël Paulusma

Theor. Comput. Sci., 2005

A Brooks-Type Theorem for the Generalized List T-Coloring.

Jirí Fiala, Daniel Král, Riste Skrekovski

SIAM J. Discret. Math., 2005

On the computational complexity of partial covers of Theta graphs.

Jirí Fiala, Jan Kratochvíl, Attila Pór

Electron. Notes Discret. Math., 2005

Generalized list T-colorings of cycles.

Jirí Fiala, Riste Skrekovski

Discret. Appl. Math., 2005

Systems of distant representatives.

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski

Discret. Appl. Math., 2005

Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms.

Jirí Fiala, Daniël Paulusma, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms.

Jirí Fiala, Daniël Paulusma, Jan Arne Telle

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

On the Computational Complexity of the <i>L</i>_{(2, 1)}-Labeling Problem for Regular Graphs.

Jirí Fiala, Jan Kratochvíl

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

Distance Constrained Labelings of Graphs of Bounded Treewidth.

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

On distance constrained labeling of disk graphs.

Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin

Theor. Comput. Sci., 2004

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs.

Jochen Alber, Jirí Fiala

J. Algorithms, 2004

New lower bounds on the weighted chromatic number of a graph.

Massimiliano Caramia, Jirí Fiala

Discuss. Math. Graph Theory, 2004

Elegant Distance Constrained Labelings of Trees.

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003

Graph Subcolorings: Complexity and Algorithms.

Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel

SIAM J. Discret. Math., 2003

Generalized H-coloring and H-covering of Trees.

Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle

Nord. J. Comput., 2003

NP completeness of the edge precoloring extension problem on bipartite graphs.

Jirí Fiala

J. Graph Theory, 2003

The Computational Complexity of the Role Assignment Problem.

Jirí Fiala, Daniël Paulusma

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Partial covers of graphs.

Jirí Fiala, Jan Kratochvíl

Discuss. Math. Graph Theory, 2002

On-line coloring of geometric intersection graphs.

Thomas Erlebach, Jirí Fiala

Comput. Geom., 2002

Scheduling of Independent Dedicated Multiprocessor Tasks.

Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Geometric Systems of Disjoint Representatives.

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

Computational complexity of covering cyclic graphs.

Jirí Fiala

Discret. Math., 2001

Fixed-parameter complexity of lambda-labelings.

Jirí Fiala, Ton Kloks, Jan Kratochvíl

Discret. Appl. Math., 2001

Complexity of Partial Covers of Graphs.

Jirí Fiala, Jan Kratochvíl

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Distance Constrained Labeling of Precolored Trees.

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Online and Offline Distance Constrained Labeling of Disk Graphs.

Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin

Proceedings of the Algorithms, 2001