default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJirí Fiala 0001
Person information
- affiliation: Charles University, Department of Applied Mathematics, Prague, Czech Republic
Other persons with the same name
- Jirí Fiala 0002 — Czech Technical University in Prague, Faculty of Electrical Engineering, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]Jan Bok
, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs with Semi-edges. Algorithmica 86(3): 782-807 (2024)- [j43]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational complexity of covering disconnected multigraphs. Discret. Appl. Math. 359: 229-243 (2024) - [c35]Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. SOFSEM 2024: 211-225 - 2023
- [c34]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: 101-115 - [i19]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Disconnected Multigraphs. CoRR abs/2306.06431 (2023) - [i18]Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. CoRR abs/2311.13523 (2023) - 2022
- [c33]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs. IWOCA 2022: 228-242 - [c32]Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman:
Extending Partial Representations of Circular-Arc Graphs. WG 2022: 230-243 - [i17]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List covering of regular multigraphs. CoRR abs/2204.04280 (2022) - 2021
- [j42]Jirí Fiala, Jaroslav Nesetril:
Foreword. Eur. J. Comb. 91: 103199 (2021) - [j41]Václav Blazj, Jirí Fiala, Giuseppe Liotta:
On Edge-Length Ratios of Partial 2-Trees. Int. J. Comput. Geom. Appl. 31(2-3): 141-162 (2021) - [c31]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Disconnected Multigraphs. FCT 2021: 85-99 - [c30]Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. MFCS 2021: 21:1-21:15 - [i16]Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. CoRR abs/2103.15214 (2021) - [i15]Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman:
Extending Partial Representations of Circular-Arc Graphs. CoRR abs/2108.13076 (2021) - 2020
- [j40]Carl Feghali, Jirí Fiala:
Reconfiguration graph for vertex colourings of weakly chordal graphs. Discret. Math. 343(3): 111733 (2020) - [c29]Václav Blazej, Jirí Fiala, Giuseppe Liotta:
On the Edge-Length Ratio of 2-Trees. GD 2020: 85-98 - [i14]Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
On Layered Fan-Planar Graph Drawings. CoRR abs/2002.09597 (2020)
2010 – 2019
- 2019
- [i13]Carl Feghali, Jirí Fiala:
Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs. CoRR abs/1902.08071 (2019) - [i12]Václav Blazej, Jirí Fiala, Giuseppe Liotta, Simon Lomic:
On the edge-length ratio of 2-trees. CoRR abs/1909.11152 (2019) - 2018
- [j39]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: 46-55 (2018) - [j38]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
3-connected reduction for regular graph covers. Eur. J. Comb. 73: 170-210 (2018) - 2017
- [j37]Jirí Fiala, Jan Hubicka, Yangjing Long, Jaroslav Nesetril:
Fractal property of the graph homomorphism order. Eur. J. Comb. 66: 101-109 (2017) - [j36]Jirí Fiala, Jan Hubicka, Yangjing Long:
Gaps in full homomorphism order. Electron. Notes Discret. Math. 61: 429-435 (2017) - [c28]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. GD 2017: 24-37 - [i11]Jirí Fiala, Jan Hubicka, Yangjing Long:
Gaps in full homomorphism order. CoRR abs/1705.02690 (2017) - [i10]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 abs/1708.09233 (2017) - 2016
- [c27]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: 67-78 - [i9]Jirí Fiala, Jan Hubicka, Yangjing Long, Jaroslav Nesetril:
Fractal property of the graph homomorphism order. CoRR abs/1606.07881 (2016) - [i8]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers. CoRR abs/1609.03013 (2016) - 2015
- [j35]Jirí Fiala, Jan Hubicka, Yangjing Long:
An universality argument for graph homomorphisms. Electron. Notes Discret. Math. 49: 643-649 (2015) - [j34]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): 282-299 (2015) - [j33]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: 86-95 (2015) - [i7]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Distance constrained labeling on graphs with bounded neighborhood diversity. CoRR abs/1507.00640 (2015) - 2014
- [j32]Jirí Fiala, Jan Hubicka, Yangjing Long:
Universality of intervals of line graph order. Eur. J. Comb. 41: 221-231 (2014) - [c26]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. ICALP (1) 2014: 489-501 - [i6]Jirí Fiala, Jan Hubicka, Yangjing Long:
Universality of intervals of line graph order. CoRR abs/1402.3736 (2014) - [i5]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. CoRR abs/1402.3774 (2014) - [i4]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 abs/1408.6676 (2014) - 2013
- [j31]Jirí Fiala, Marcin Kaminski, Daniël Paulusma:
A note on contracting claw-free graphs. Discret. Math. Theor. Comput. Sci. 15(2): 223-232 (2013) - [j30]Jirí Fiala, Jan Kratochvíl, Angsheng Li:
Preface. Theor. Comput. Sci. 494: 1 (2013) - [c25]Jirí Fiala, Marek Tesar:
Dichotomy of the H-Quasi-Cover Problem. CSR 2013: 310-321 - [c24]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: 121-132 - [c23]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: 127-138 - [i3]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 abs/1301.5953 (2013) - 2012
- [j29]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-Path Problem for Claw-free Graphs. Algorithmica 62(1-2): 499-519 (2012) - [j28]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma:
Distance three labelings of trees. Discret. Appl. Math. 160(6): 764-779 (2012) - [j27]Jirí Fiala, Marcin Kaminski, Daniël Paulusma:
Detecting induced star-like minors in polynomial time. J. Discrete Algorithms 17: 74-85 (2012) - 2011
- [j26]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412(23): 2513-2523 (2011) - 2010
- [j25]Jirí Fiala, Petr A. Golovach:
Complexity of the packing coloring problem for trees. Discret. Appl. Math. 158(7): 771-778 (2010) - [j24]Jirí Fiala, Daniël Paulusma:
Comparing Universal Covers in Polynomial Time. Theory Comput. Syst. 46(4): 620-635 (2010) - [c22]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-path Problem for Claw-free Graphs. STACS 2010: 371-382 - [e3]Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman:
Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings. Lecture Notes in Computer Science 6108, Springer 2010, ISBN 978-3-642-13561-3 [contents] - [i2]Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický:
The packing chromatic number of the square lattice is at least 12. CoRR abs/1003.2291 (2010)
2000 – 2009
- 2009
- [j23]Jirí Fiala, Sandi Klavzar, Bernard Lidický:
The packing chromatic number of infinite product graphs. Eur. J. Comb. 30(5): 1101-1113 (2009) - [c21]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230 - [e2]Jirí Fiala, Jan Kratochvíl, Mirka Miller:
Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5874, Springer 2009, ISBN 978-3-642-10216-5 [contents] - [i1]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-path problem for claw-free graphs. CoRR abs/0912.5468 (2009) - 2008
- [j22]Jirí Fiala, Jan Kratochvíl:
Locally constrained graph homomorphisms - structure, complexity, and applications. Comput. Sci. Rev. 2(2): 97-111 (2008) - [j21]Jirí Fiala, Jan Kratochvíl, Attila Pór:
On the computational complexity of partial covers of Theta graphs. Discret. Appl. Math. 156(7): 1143-1149 (2008) - [j20]Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4): 850-880 (2008) - [j19]José A. Soto, Jirí Fiala:
Block transitivity and degree matrices. Eur. J. Comb. 29(5): 1160-1172 (2008) - [c20]Jirí Fiala, Daniël Paulusma:
Comparing Universal Covers in Polynomial Time. CSR 2008: 158-167 - [c19]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) 2008: 294-305 - [c18]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Distance Constrained Labelings of Trees. TAMC 2008: 125-135 - [c17]Jirí Fiala, Petr A. Golovach:
Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145 - 2007
- [j18]Jan Kratochvíl, Josep Díaz, Jirí Fiala:
Editorial. Discret. Appl. Math. 155(2): 79-80 (2007) - [j17]Jirí Fiala, José A. Soto:
Block transitivity and degree matrices: (Extended abstract). Electron. Notes Discret. Math. 28: 77-82 (2007) - 2006
- [j16]Jirí Fiala, Jana Maxová:
Cantor-Bernstein type theorem for locally constrained graph homomorphisms. Eur. J. Comb. 27(7): 1111-1116 (2006) - [c16]Jirí Fiala, Jan Kratochvíl:
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. WG 2006: 15-26 - [p1]Thomas Erlebach, Jirí Fiala:
Independence and Coloring Problems on Intersection Graphs of Disks. Efficient Approximation and Online Algorithms 2006: 135-155 - 2005
- [j15]Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Systems of distant representatives. Discret. Appl. Math. 145(2): 306-316 (2005) - [j14]Jirí Fiala, Riste Skrekovski:
Generalized list T-colorings of cycles. Discret. Appl. Math. 148(1): 13-25 (2005) - [j13]Jirí Fiala, Jan Kratochvíl, Attila Pór:
On the computational complexity of partial covers of Theta graphs. Electron. Notes Discret. Math. 19: 79-85 (2005) - [j12]Jirí Fiala, Daniel Král, Riste Skrekovski:
A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discret. Math. 19(3): 588-609 (2005) - [j11]Jirí Fiala, Daniël Paulusma:
A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349(1): 67-81 (2005) - [c15]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372 - [c14]Jirí Fiala, Jan Kratochvíl:
On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs. ICTCS 2005: 228-236 - [c13]Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351 - [c12]Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG 2005: 115-126 - 2004
- [j10]Massimiliano Caramia, Jirí Fiala:
New lower bounds on the weighted chromatic number of a graph. Discuss. Math. Graph Theory 24(2): 183-195 (2004) - [j9]Jochen Alber, Jirí Fiala:
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52(2): 134-151 (2004) - [j8]Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin:
On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1-3): 261-292 (2004) - [c11]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67 - [e1]Jirí Fiala, Václav Koubek, Jan Kratochvíl:
Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings. Lecture Notes in Computer Science 3153, Springer 2004, ISBN 3-540-22823-3 [contents] - 2003
- [j7]Jirí Fiala:
NP completeness of the edge precoloring extension problem on bipartite graphs. J. Graph Theory 43(2): 156-160 (2003) - [j6]Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle:
Generalized H-coloring and H-covering of Trees. Nord. J. Comput. 10(3): 206-223 (2003) - [j5]Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel:
Graph Subcolorings: Complexity and Algorithms. SIAM J. Discret. Math. 16(4): 635-650 (2003) - [c10]Jirí Fiala, Daniël Paulusma:
The Computational Complexity of the Role Assignment Problem. ICALP 2003: 817-828 - 2002
- [j4]Thomas Erlebach, Jirí Fiala:
On-line coloring of geometric intersection graphs. Comput. Geom. 23(2): 243-255 (2002) - [j3]Jirí Fiala, Jan Kratochvíl:
Partial covers of graphs. Discuss. Math. Graph Theory 22(1): 89-99 (2002) - [c9]Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Geometric Systems of Disjoint Representatives. GD 2002: 110-117 - [c8]Jochen Alber, Jirí Fiala:
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs. IFIP TCS 2002: 26-37 - [c7]Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella:
Scheduling of Independent Dedicated Multiprocessor Tasks. ISAAC 2002: 391-402 - [c6]Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle:
Generalized H-Coloring and H-Covering of Trees. WG 2002: 198-210 - 2001
- [j2]Jirí Fiala, Ton Kloks, Jan Kratochvíl:
Fixed-parameter complexity of lambda-labelings. Discret. Appl. Math. 113(1): 59-72 (2001) - [j1]Jirí Fiala:
Computational complexity of covering cyclic graphs. Discret. Math. 235(1-3): 87-94 (2001) - [c5]Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin:
Online and Offline Distance Constrained Labeling of Disk Graphs. ESA 2001: 464-475 - [c4]Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Distance Constrained Labeling of Precolored Trees. ICTCS 2001: 285-292 - [c3]Jirí Fiala, Jan Kratochvíl:
Complexity of Partial Covers of Graphs. ISAAC 2001: 537-549 - [c2]Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel:
Graph Subcolorings: Complexity and Algorithms. WG 2001: 154-165
1990 – 1999
- 1999
- [c1]Jirí Fiala, Ton Kloks, Jan Kratochvíl:
Fixed-Parameter Complexity of lambda-Labelings. WG 1999: 350-363
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
