Suivre
Petr Golovach
Petr Golovach
Adresse e-mail validée de ii.uib.no
Titre
Citée par
Citée par
Année
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
1452017
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
1262010
Intractability of clique-width parameterizations
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
SIAM Journal on Computing 39 (5), 1941-1956, 2010
1132010
The capture time of a graph
A Bonato, P Golovach, G Hahn, J Kratochvíl
Discrete Mathematics 309 (18), 5588-5595, 2009
1102009
Parameterized complexity of coloring problems: Treewidth versus vertex cover
J Fiala, PA Golovach, J Kratochvíl
Theoretical Computer Science 412 (23), 2513-2523, 2011
912011
Complexity of the packing coloring problem for trees
J Fiala, PA Golovach
Discrete Applied Mathematics 158 (7), 771-778, 2010
792010
Paths of bounded length and their cuts: Parameterized complexity and algorithms
PA Golovach, DM Thilikos
Discrete Optimization 8 (1), 72-86, 2011
752011
How to hunt an invisible rabbit on a graph
TV Abramovskaya, FV Fomin, PA Golovach, M Pilipczuk
European Journal of Combinatorics 52, 12-26, 2016
732016
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
722012
Distance constrained labelings of graphs of bounded treewidth
J Fiala, PA Golovach, J Kratochvíl
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
702005
Contraction obstructions for treewidth
FV Fomin, P Golovach, DM Thilikos
Journal of Combinatorial Theory, Series B 101 (5), 302-314, 2011
652011
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
652009
Almost optimal lower bounds for problems parameterized by clique-width
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
SIAM Journal on Computing 43 (5), 1541-1563, 2014
602014
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
592010
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
592008
Three complexity results on coloring Pk-free graphs
H Broersma, FV Fomin, PA Golovach, D Paulusma
European Journal of Combinatorics 34 (3), 609-619, 2013
56*2013
Parameterized complexity for domination problems on degenerate graphs
PA Golovach, Y Villanger
Graph-Theoretic Concepts in Computer Science: 34th International Workshop …, 2008
562008
Graph searching and interval completion
FV Fomin, PA Golovach
SIAM Journal on Discrete Mathematics 13 (4), 454-464, 2000
532000
On the Tractability of Optimization Problems on H-Graphs
FV Fomin, PA Golovach, JF Raymond
Algorithmica 82 (9), 2432-2473, 2020
522020
A survey of parameterized algorithms and the complexity of edge modification
C Crespelle, PG Drange, FV Fomin, P Golovach
Computer Science Review 48, 100556, 2023
482023
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20