| 2008 |
|---|
| 39 | EE | Jirí Fiala,
Daniël Paulusma:
Comparing Universal Covers in Polynomial Time.
CSR 2008: 158-167 |
| 38 | EE | 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 |
| 37 | EE | Jirí Fiala,
Petr A. Golovach,
Jan Kratochvíl:
Distance Constrained Labelings of Trees.
TAMC 2008: 125-135 |
| 36 | EE | Jirí Fiala,
Petr A. Golovach:
Complexity of the Packing Coloring Problem for Trees.
WG 2008: 134-145 |
| 35 | EE | Jirí Fiala,
Jan Kratochvíl:
Locally constrained graph homomorphisms - structure, complexity, and applications.
Computer Science Review 2(2): 97-111 (2008) |
| 34 | EE | 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) |
| 33 | EE | Jirí Fiala,
Daniël Paulusma,
Jan Arne Telle:
Locally constrained graph homomorphisms and equitable partitions.
Eur. J. Comb. 29(4): 850-880 (2008) |
| 32 | EE | José Soto,
Jirí Fiala:
Block transitivity and degree matrices.
Eur. J. Comb. 29(5): 1160-1172 (2008) |
| 2007 |
|---|
| 31 | EE | Jan Kratochvíl,
Josep Díaz,
Jirí Fiala:
Editorial.
Discrete Applied Mathematics 155(2): 79-80 (2007) |
| 30 | EE | Jirí Fiala,
José Soto:
Block transitivity and degree matrices: (Extended abstract).
Electronic Notes in Discrete Mathematics 28: 77-82 (2007) |
| 2006 |
|---|
| 29 | EE | Jirí Fiala,
Jan Kratochvíl:
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy.
WG 2006: 15-26 |
| 28 | EE | Jirí Fiala,
Jana Maxová:
Cantor-Bernstein type theorem for locally constrained graph homomorphisms.
Eur. J. Comb. 27(7): 1111-1116 (2006) |
| 2005 |
|---|
| 27 | EE | Jirí Fiala,
Petr A. Golovach,
Jan Kratochvíl:
Distance Constrained Labelings of Graphs of Bounded Treewidth.
ICALP 2005: 360-372 |
| 26 | EE | Jirí Fiala,
Jan Kratochvíl:
On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs.
ICTCS 2005: 228-236 |
| 25 | EE | Jirí Fiala,
Daniël Paulusma,
Jan Arne Telle:
Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms.
MFCS 2005: 340-351 |
| 24 | EE | Jirí Fiala,
Daniël Paulusma,
Jan Arne Telle:
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms.
WG 2005: 115-126 |
| 23 | EE | Jirí Fiala,
Jan Kratochvíl,
Andrzej Proskurowski:
Systems of distant representatives.
Discrete Applied Mathematics 145(2): 306-316 (2005) |
| 22 | EE | Jirí Fiala,
Riste Skrekovski:
Generalized list T-colorings of cycles.
Discrete Applied Mathematics 148(1): 13-25 (2005) |
| 21 | EE | 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) |
| 20 | EE | 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) |
| 19 | EE | Jirí Fiala,
Daniël Paulusma:
A complete complexity classification of the role assignment problem.
Theor. Comput. Sci. 349(1): 67-81 (2005) |
| 2004 |
|---|
| 18 | | 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
Springer 2004 |
| 17 | EE | Jirí Fiala,
Petr A. Golovach,
Jan Kratochvíl:
Elegant Distance Constrained Labelings of Trees.
WG 2004: 58-67 |
| 16 | EE | 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) |
| 15 | EE | Jirí Fiala,
Aleksei V. Fishkin,
Fedor V. Fomin:
On distance constrained labeling of disk graphs.
Theor. Comput. Sci. 326(1-3): 261-292 (2004) |
| 2003 |
|---|
| 14 | EE | Jirí Fiala,
Daniël Paulusma:
The Computational Complexity of the Role Assignment Problem.
ICALP 2003: 817-828 |
| 13 | | 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) |
| 2002 |
|---|
| 12 | EE | Jirí Fiala,
Jan Kratochvíl,
Andrzej Proskurowski:
Geometric Systems of Disjoint Representatives.
Graph Drawing 2002: 110-117 |
| 11 | | Jochen Alber,
Jirí Fiala:
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs.
IFIP TCS 2002: 26-37 |
| 10 | EE | Evripidis Bampis,
Massimiliano Caramia,
Jirí Fiala,
Aleksei V. Fishkin,
Antonio Iovanella:
Scheduling of Independent Dedicated Multiprocessor Tasks.
ISAAC 2002: 391-402 |
| 9 | EE | Jirí Fiala,
Pinar Heggernes,
Petter Kristiansen,
Jan Arne Telle:
Generalized H-Coloring and H-Covering of Trees.
WG 2002: 198-210 |
| 8 | | Thomas Erlebach,
Jirí Fiala:
On-line coloring of geometric intersection graphs.
Comput. Geom. 23(2): 243-255 (2002) |
| 2001 |
|---|
| 7 | EE | Jirí Fiala,
Aleksei V. Fishkin,
Fedor V. Fomin:
Online and Offline Distance Constrained Labeling of Disk Graphs.
ESA 2001: 464-475 |
| 6 | EE | Jirí Fiala,
Jan Kratochvíl,
Andrzej Proskurowski:
Distance Constrained Labeling of Precolored Trees.
ICTCS 2001: 285-292 |
| 5 | EE | Jirí Fiala,
Jan Kratochvíl:
Complexity of Partial Covers of Graphs.
ISAAC 2001: 537-549 |
| 4 | EE | Jirí Fiala,
Klaus Jansen,
Van Bang Le,
Eike Seidel:
Graph Subcolorings: Complexity and Algorithms.
WG 2001: 154-165 |
| 3 | | Jirí Fiala,
Ton Kloks,
Jan Kratochvíl:
Fixed-parameter complexity of lambda-labelings.
Discrete Applied Mathematics 113(1): 59-72 (2001) |
| 2 | EE | Jirí Fiala:
Computational complexity of covering cyclic graphs.
Discrete Mathematics 235(1-3): 87-94 (2001) |
| 1999 |
|---|
| 1 | EE | Jirí Fiala,
Ton Kloks,
Jan Kratochvíl:
Fixed-Parameter Complexity of lambda-Labelings.
WG 1999: 350-363 |
