Petr Golovach
Petr Golovach
Verified email at ii.uib.no
TitleCited byYear
Pursuing a fast robber on a graph
FV Fomin, PA Golovach, J Kratochvíl, N Nisse, K Suchan
Theoretical Computer Science 411 (7-9), 1167-1181, 2010
732010
Intractability of clique-width parameterizations
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
SIAM Journal on Computing 39 (5), 1941-1956, 2010
622010
The capture time of a graph
A Bonato, P Golovach, G Hahn, J Kratochvíl
Discrete Mathematics 309 (18), 5588-5595, 2009
582009
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
572005
A survey on the computational complexity of coloring graphs with forbidden subgraphs
PA Golovach, M Johnson, D Paulusma, J Song
Journal of Graph Theory 84 (4), 331-363, 2017
562017
Complexity of the packing coloring problem for trees
J Fiala, PA Golovach
Discrete Applied Mathematics 158 (7), 771-778, 2010
552010
Graph searching and interval completion
FV Fomin, PA Golovach
SIAM Journal on Discrete Mathematics 13 (4), 454-464, 2000
492000
Updating the complexity status of coloring graphs without a fixed induced linear forest
H Broersma, PA Golovach, D Paulusma, J Song
Theoretical Computer Science 414 (1), 9-19, 2012
472012
Paths of bounded length and their cuts: Parameterized complexity and algorithms
PA Golovach, DM Thilikos
Discrete Optimization 8 (1), 72-86, 2011
472011
Parameterized complexity of coloring problems: Treewidth versus vertex cover
J Fiala, PA Golovach, J Kratochvíl
Theoretical Computer Science 412 (23), 2513-2523, 2011
462011
Clique-width: on the price of generality
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
452009
On tractability of cops and robbers game
FV Fomin, PA Golovach, J Kratochvíl
Fifth Ifip International Conference On Theoretical Computer Science–Tcs 2008 …, 2008
442008
Three complexity results on coloring Pk-free graphs
H Broersma, FV Fomin, PA Golovach, DL Paulusma
European journal of combinatorics 34 (3), 609-619, 2013
43*2013
Contraction obstructions for treewidth
FV Fomin, P Golovach, DM Thilikos
Journal of Combinatorial Theory, Series B 101 (5), 302-314, 2011
412011
Algorithmic lower bounds for problems parameterized by clique-width
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
412010
Backbone colorings for graphs: Tree and path backbones
H Broersma, FV Fomin, PA Golovach, GJ Woeginger
Journal of Graph Theory 55 (2), 137-152, 2007
392007
Parameterized complexity for domination problems on degenerate graphs
PA Golovach, Y Villanger
International Workshop on Graph-Theoretic Concepts in Computer Science, 195-205, 2008
382008
Backbone colorings for networks
H Broersma, FV Fomin, PA Golovach, GJ Woeginger
International Workshop on Graph-Theoretic Concepts in Computer Science, 131-142, 2003
352003
Obtaining planarity by contracting few edges
PA Golovach, P van’t Hof, D Paulusma
Theoretical Computer Science 476, 38-46, 2013
292013
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
292008
The system can't perform the operation now. Try again later.
Articles 1–20