Jirí Fiala - RankMe

109 papers A* 2A 5B 20C 5Misc 3Journal 68Unranked 5

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