Jiri Fiala
Jiri Fiala
E-mailová adresa ověřena na: kam.mff.cuni.cz
Název
Citace
Citace
Rok
Fixed-parameter complexity of λ-labelings
J Fiala, T Kloks, J Kratochvıl
Discrete Applied Mathematics 113 (1), 59-72, 2001
1522001
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
J Alber, J Fiala
Journal of Algorithms 52 (2), 134-151, 2004
792004
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
J Alber, J Fiala
Journal of Algorithms 52 (2), 134-151, 2004
792004
Complexity of the packing coloring problem for trees
J Fiala, PA Golovach
Discrete Applied Mathematics 158 (7), 771-778, 2010
682010
Parameterized complexity of coloring problems: Treewidth versus vertex cover
J Fiala, PA Golovach, J Kratochvíl
Theoretical Computer Science 412 (23), 2513-2523, 2011
632011
Distance constrained labelings of graphs of bounded treewidth
J Fiala, PA Golovach, J Kratochvíl
International Colloquium on Automata, Languages, and Programming, 360-372, 2005
622005
The packing chromatic number of infinite product graphs
J Fiala, S Klavžar, B Lidický
European Journal of Combinatorics 30 (5), 1101-1113, 2009
602009
A complete complexity classification of the role assignment problem
J Fiala, D Paulusma
Theoretical computer science 349 (1), 67-81, 2005
602005
Partial covers of graphs
J Fiala, J Kratochvíl
Discussiones Mathematicae Graph Theory 22 (1), 89-99, 2002
592002
Locally constrained graph homomorphisms—structure, complexity, and applications
J Fiala, J Kratochvíl
Computer Science Review 2 (2), 97-111, 2008
572008
Systems of distant representatives
J Fiala, J Kratochvíl, A Proskurowski
Discrete Applied Mathematics 145 (2), 306-316, 2005
462005
Fixed-parameter complexity of λ-labelings
J Fiala, T Kloks, J Kratochvíl
International Workshop on Graph-Theoretic Concepts in Computer Science, 350-363, 1999
451999
Complexity of partial covers of graphs
J Fiala, J Kratochvíl
International Symposium on Algorithms and Computation, 537-549, 2001
392001
NP completeness of the edge precoloring extension problem on bipartite graphs
J Fiala
Journal of Graph Theory 43 (2), 156-160, 2003
372003
The k-in-a-path problem for claw-free graphs
J Fiala, M Kamiński, B Lidický, D Paulusma
Algorithmica 62 (1), 499-519, 2012
312012
The k-in-a-path problem for claw-free graphs
J Fiala, M Kamiński, B Lidický, D Paulusma
Algorithmica 62 (1), 499-519, 2012
312012
Computational complexity of the distance constrained labeling problem for trees
J Fiala, PA Golovach, J Kratochvíl
International Colloquium on Automata, Languages, and Programming, 294-305, 2008
312008
Scheduling of independent dedicated multiprocessor tasks
E Bampis, M Caramia, J Fiala, AV Fishkin, A Iovanella
International Symposium on Algorithms and Computation, 391-402, 2002
302002
Distance constrained labeling of precolored trees
J Fiala, J Kratochvíl, A Proskurowski
Italian Conference on Theoretical Computer Science, 285-292, 2001
282001
Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs
H Broersma, J Fiala, PA Golovach, T Kaiser, D Paulusma, A Proskurowski
Journal of graph theory 79 (4), 282-299, 2015
262015
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20