Jirí Fiala

	2012
52		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)
51		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)
	2011
50		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
49		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 Springer 2010
48		Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-path Problem for Claw-free Graphs. STACS 2010: 371-382
47		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)
46		Jirí Fiala, Petr A. Golovach: Complexity of the packing coloring problem for trees. Discrete Applied Mathematics 158(7): 771-778 (2010)
45		Jirí Fiala, Daniël Paulusma: Comparing Universal Covers in Polynomial Time. Theory Comput. Syst. 46(4): 620-635 (2010)
	2009
44		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 Springer 2009
43		Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230
42		Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-path problem for claw-free graphs CoRR abs/0912.5468: (2009)
41		Jirí Fiala, Sandi Klavzar, Bernard Lidický: The packing chromatic number of infinite product graphs. Eur. J. Comb. 30(5): 1101-1113 (2009)
	2008
40		Jirí Fiala, Daniël Paulusma: Comparing Universal Covers in Polynomial Time. CSR 2008: 158-167
39		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
38		Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Trees. TAMC 2008: 125-135
37		Jirí Fiala, Petr A. Golovach: Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145
36		Jirí Fiala, Jan Kratochvíl: Locally constrained graph homomorphisms - structure, complexity, and applications. Computer Science Review 2(2): 97-111 (2008)
35		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)
34		Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4): 850-880 (2008)
33		José Soto, Jirí Fiala: Block transitivity and degree matrices. Eur. J. Comb. 29(5): 1160-1172 (2008)
	2007
32		Jan Kratochvíl, Josep Díaz, Jirí Fiala: Editorial. Discrete Applied Mathematics 155(2): 79-80 (2007)
31		Jirí Fiala, José Soto: Block transitivity and degree matrices: (Extended abstract). Electronic Notes in Discrete Mathematics 28: 77-82 (2007)
	2006
30		Jirí Fiala, Jan Kratochvíl: Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. WG 2006: 15-26
29		Jirí Fiala, Jana Maxová: Cantor-Bernstein type theorem for locally constrained graph homomorphisms. Eur. J. Comb. 27(7): 1111-1116 (2006)
	2005
28		Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372
27		Jirí Fiala, Jan Kratochvíl: On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs. ICTCS 2005: 228-236
26		Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351
25		Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG 2005: 115-126
24		Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Systems of distant representatives. Discrete Applied Mathematics 145(2): 306-316 (2005)
23		Jirí Fiala, Riste Skrekovski: Generalized list T-colorings of cycles. Discrete Applied Mathematics 148(1): 13-25 (2005)
22		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)
21		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)
20		Jirí Fiala, Daniël Paulusma: A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349(1): 67-81 (2005)
	2004
19		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
18		Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67
17		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)
16		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
15		Jirí Fiala, Daniël Paulusma: The Computational Complexity of the Role Assignment Problem. ICALP 2003: 817-828
14		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)
13		Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel: Graph Subcolorings: Complexity and Algorithms. SIAM J. Discrete Math. 16(4): 635-650 (2003)
	2002
12		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		Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella: Scheduling of Independent Dedicated Multiprocessor Tasks. ISAAC 2002: 391-402
9		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		Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: Online and Offline Distance Constrained Labeling of Disk Graphs. ESA 2001: 464-475
6		Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski: Distance Constrained Labeling of Precolored Trees. ICTCS 2001: 285-292
5		Jirí Fiala, Jan Kratochvíl: Complexity of Partial Covers of Graphs. ISAAC 2001: 537-549
4		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		Jirí Fiala: Computational complexity of covering cyclic graphs. Discrete Mathematics 235(1-3): 87-94 (2001)
	1999
1		Jirí Fiala, Ton Kloks, Jan Kratochvíl: Fixed-Parameter Complexity of lambda-Labelings. WG 1999: 350-363

Coauthor Index

1	Jochen Alber	[11] [17]
2	Evripidis Bampis	[10]
3	Massimiliano Caramia	[10]
4	Josep Díaz	[32]
5	Jan Ekstein	[47]
6	Thomas Erlebach	[8]
7	Aleksei V. Fishkin	[7] [10] [16]
8	Fedor V. Fomin	[7] [16]
9	Petr A. Golovach	[18] [28] [37] [38] [39] [43] [46] [50] [51]
10	Pinar Heggernes	[9] [14]
11	Premysl Holub	[47]
12	Antonio Iovanella	[10]
13	Klaus Jansen	[4] [13]
14	Marcin Jakub Kaminski (Marcin Kaminski)	[42] [48] [52]
15	Sandi Klavzar	[41]
16	Ton Kloks (Antonius J. J. Kloks)	[1] [3]
17	Petr Kolman	[49]
18	Václav Koubek	[19]
19	Daniel Král (Daniel Král')	[21]
20	Jan Kratochvíl	[1] [3] [5] [6] [12] [18] [19] [22] [24] [27] [28] [30] [32] [35] [36] [38] [39] [43] [44] [49] [50] [51]
21	Petter Kristiansen	[9] [14]
22	Van Bang Le	[4] [13]
23	Angsheng Li	[49]
24	Bernard Lidický	[41] [42] [47] [48] [51] [52]
25	Jana Maxová	[29]
26	Mirka Miller	[44]
27	Daniël Paulusma	[15] [20] [25] [26] [34] [40] [42] [45] [48] [51] [52]
28	Attila Pór	[22] [35]
29	Andrzej Proskurowski	[6] [12] [24]
30	Eike Seidel	[4] [13]
31	Riste Skrekovski	[21] [23]
32	José Soto	[31] [33]
33	Jan Arne Telle	[9] [14] [25] [26] [34]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page