Jirí Fiala

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)

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)

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma: Distance three labelings of trees. Discrete Applied Mathematics 160(6): 764-779 (2012)

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

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)

Jirí Fiala, Petr A. Golovach: Complexity of the packing coloring problem for trees. Discrete Applied Mathematics 158(7): 771-778 (2010)

Jirí Fiala, Daniël Paulusma: Comparing Universal Covers in Polynomial Time. Theory Comput. Syst. 46(4): 620-635 (2010)

Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-path Problem for Claw-free Graphs. STACS 2010: 371-382

Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman (Eds.): 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

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)

Jirí Fiala, Sandi Klavzar, Bernard Lidický: The packing chromatic number of infinite product graphs. Eur. J. Comb. 30(5): 1101-1113 (2009)

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230

Jirí Fiala, Jan Kratochvíl, Mirka Miller (Eds.): 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

Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-path problem for claw-free graphs. CoRR abs/0912.5468 (2009)

Jirí Fiala, Jan Kratochvíl: Locally constrained graph homomorphisms - structure, complexity, and applications. Computer Science Review 2(2): 97-111 (2008)

Jirí Fiala, Jan Kratochvíl, Attila Pór: On the computational complexity of partial covers of Theta graphs. Discrete Applied Mathematics 156(7): 1143-1149 (2008)

Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4): 850-880 (2008)

José Soto, Jirí Fiala: Block transitivity and degree matrices. Eur. J. Comb. 29(5): 1160-1172 (2008)

Jirí Fiala, Daniël Paulusma: Comparing Universal Covers in Polynomial Time. CSR 2008: 158-167

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

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Trees. TAMC 2008: 125-135

Jirí Fiala, Petr A. Golovach: Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145

Jan Kratochvíl, Josep Díaz, Jirí Fiala: Editorial. Discrete Applied Mathematics 155(2): 79-80 (2007)

Jirí Fiala, José Soto: Block transitivity and degree matrices: (Extended abstract). Electronic Notes in Discrete Mathematics 28: 77-82 (2007)

Jirí Fiala, Jana Maxová: Cantor-Bernstein type theorem for locally constrained graph homomorphisms. Eur. J. Comb. 27(7): 1111-1116 (2006)

Jirí Fiala, Jan Kratochvíl: Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. WG 2006: 15-26

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Systems of distant representatives. Discrete Applied Mathematics 145(2): 306-316 (2005)

Jirí Fiala, Riste Skrekovski: Generalized list T-colorings of cycles. Discrete Applied Mathematics 148(1): 13-25 (2005)

Jirí Fiala, Jan Kratochvíl, Attila Pór: On the computational complexity of partial covers of Theta graphs. Electronic Notes in Discrete Mathematics 19: 79-85 (2005)

Jirí Fiala, Daniel Král, Riste Skrekovski: A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discrete Math. 19(3): 588-609 (2005)

Jirí Fiala, Daniël Paulusma: A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349(1): 67-81 (2005)

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372

Jirí Fiala, Jan Kratochvíl: On the Computational Complexity of the L_{(2, 1)}-Labeling Problem for Regular Graphs. ICTCS 2005: 228-236

Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351

Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG 2005: 115-126

Massimiliano Caramia, Jirí Fiala: New lower bounds on the weighted chromatic number of a graph. Discussiones Mathematicae Graph Theory 24(2): 183-195 (2004)

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)

Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1-3): 261-292 (2004)

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67

Jirí Fiala, Václav Koubek, Jan Kratochvíl (Eds.): 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

Jirí Fiala: NP completeness of the edge precoloring extension problem on bipartite graphs. Journal of Graph Theory 43(2): 156-160 (2003)

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)

Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel: Graph Subcolorings: Complexity and Algorithms. SIAM J. Discrete Math. 16(4): 635-650 (2003)

Jirí Fiala, Daniël Paulusma: The Computational Complexity of the Role Assignment Problem. ICALP 2003: 817-828

Thomas Erlebach, Jirí Fiala: On-line coloring of geometric intersection graphs. Comput. Geom. 23(2): 243-255 (2002)

Jirí Fiala, Jan Kratochvíl: Partial covers of graphs. Discussiones Mathematicae Graph Theory 22(1): 89-99 (2002)

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Geometric Systems of Disjoint Representatives. Graph Drawing 2002: 110-117

Jochen Alber, Jirí Fiala: Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs. IFIP TCS 2002: 26-37

Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella: Scheduling of Independent Dedicated Multiprocessor Tasks. ISAAC 2002: 391-402

Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle: Generalized H-Coloring and H-Covering of Trees. WG 2002: 198-210

Jirí Fiala, Ton Kloks, Jan Kratochvíl: Fixed-parameter complexity of lambda-labelings. Discrete Applied Mathematics 113(1): 59-72 (2001)

Jirí Fiala: Computational complexity of covering cyclic graphs. Discrete Mathematics 235(1-3): 87-94 (2001)

Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: Online and Offline Distance Constrained Labeling of Disk Graphs. ESA 2001: 464-475

Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Distance Constrained Labeling of Precolored Trees. ICTCS 2001: 285-292

Jirí Fiala, Jan Kratochvíl: Complexity of Partial Covers of Graphs. ISAAC 2001: 537-549

Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel: Graph Subcolorings: Complexity and Algorithms. WG 2001: 154-165

Jirí Fiala, Ton Kloks, Jan Kratochvíl: Fixed-Parameter Complexity of lambda-Labelings. WG 1999: 350-363