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 | 110 | 2017 |

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 | 94 | 2010 |

Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010 | 88 | 2010 |

The capture time of a graph A Bonato, P Golovach, G Hahn, J Kratochvíl Discrete Mathematics 309 (18), 5588-5595, 2009 | 88 | 2009 |

Complexity of the packing coloring problem for trees J Fiala, PA Golovach Discrete Applied Mathematics 158 (7), 771-778, 2010 | 68 | 2010 |

Paths of bounded length and their cuts: Parameterized complexity and algorithms PA Golovach, DM Thilikos Discrete Optimization 8 (1), 72-86, 2011 | 63 | 2011 |

Parameterized complexity of coloring problems: Treewidth versus vertex cover J Fiala, PA Golovach, J Kratochvíl Theoretical Computer Science 412 (23), 2513-2523, 2011 | 62 | 2011 |

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 | 62 | 2005 |

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 | 61 | 2016 |

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 | 60 | 2012 |

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 | 54 | 2009 |

Contraction obstructions for treewidth FV Fomin, P Golovach, DM Thilikos Journal of Combinatorial Theory, Series B 101 (5), 302-314, 2011 | 52 | 2011 |

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 | 52 | 2008 |

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 | 51 | 2010 |

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 | 50* | 2013 |

Graph searching and interval completion FV Fomin, PA Golovach SIAM Journal on Discrete Mathematics 13 (4), 454-464, 2000 | 49 | 2000 |

Parameterized complexity for domination problems on degenerate graphs PA Golovach, Y Villanger International Workshop on Graph-Theoretic Concepts in Computer Science, 195-205, 2008 | 47 | 2008 |

Obtaining planarity by contracting few edges PA Golovach, P van’t Hof, D Paulusma Theoretical Computer Science 476, 38-46, 2013 | 38 | 2013 |

Closing complexity gaps for coloring problems on H-free graphs PA Golovach, D Paulusma, J Song Information and Computation 237, 204-214, 2014 | 37 | 2014 |

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 | 37 | 2014 |