| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Updating the complexity status of coloring graphs without a fixed induced linear forest. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Induced packing of odd cycles in planar graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen |
Parameterized Complexity of the Spanning Tree Congestion Problem. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pim van 't Hof, Daniël Paulusma |
Obtaining Planarity by Contracting Few Edges |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen |
Induced Disjoint Paths in Claw-Free Graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma |
Finding vertex-surjective graph homomorphisms |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
Cops and Robber Game Without Recharging. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý |
Parameterized complexity of generalized domination problems. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma |
Distance three labelings of trees. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Containment relations in split graphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Rodica Mihai |
Edge search number of cographs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
k-Gap Interval Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach |
Parameterized Complexity of Connected Even/Odd Subgraph Problems. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Jian Song |
4-Coloring H-Free Graphs When H Is Small. |
SOFSEM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Contraction obstructions for treewidth. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Lift Contractions. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Dimitrios M. Thilikos |
Paths of bounded length and their cuts: Parameterized complexity and algorithms. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen |
Spanners of bounded degree graphs. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Parameterized complexity of coloring problems: Treewidth versus vertex cover. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-free graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
Guard games on graphs: Keep the intruder out! |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
Approximation of minimum weight spanners for sparse graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Branch and Recharge: Exact Algorithms for Generalized Domination. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer |
How to Guard a Graph? |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
k-Gap Interval Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Approximating Width Parameters of Hypergraphs with Excluded Minors. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
Spanners in sparse graphs. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Jian Song |
Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
List Coloring in the Absence of a Linear Forest. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma |
Contracting a Chordal Graph to a Split Graph or a Tree. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Viresh Patel |
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Increasing the Minimum Degree of a Graph by Contractions. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Jian Song |
Coloring Graphs without Short Cycles and Long Induced Paths. |
FCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos |
Odd cyclic surface separators in planar graphs. |
CTW |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma |
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh |
Parameterized algorithm for eternal vertex cover. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan |
Pursuing a fast robber on a graph. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach |
Complexity of the packing coloring problem for trees. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Intractability of Clique-Width Parameterizations. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Dieter Kratsch, Jean-François Couturier |
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Petr A. Golovach, Bernard Lidický, Daniël Paulusma |
L(2, 1, 1)-Labeling Is NP-Complete for Trees. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
Cops and Robber Game without Recharging. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Approximation Algorithms for Domination Search. |
WAOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
On Coloring Graphs without Induced Forests. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Sort and Search: Exact algorithms for generalized domination. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl |
The capture time of a graph. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý |
Parameterized Complexity of Generalized Domination Problems. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Contraction Bidimensionality: The Accurate Picture. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Clique-width: on the price of generality. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes |
Choosability of P5-Free Graphs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Dimitrios M. Thilikos |
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
Bounded length disjoint paths, Bounded length cuts, Parameterized Complexity, Parameterized Algorithms |
| 1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Approximating Acyclicity Parameters of Sparse Hypergraphs. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
Guard Games on Graphs: Keep the Intruder Out! |
WAOA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-Free Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Induced Packing of Odd Cycles in a Planar Graph. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma |
Three Complexity Results on Coloring Pk-Free Graphs. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
P k -free graph, computational complexity, graph coloring |
| 1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Approximating acyclicity parameters of sparse hypergraphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach |
Complexity of the Packing Coloring Problem for Trees. |
WG |
2008 |
DBLP DOI BibTeX RDF |
Packing coloring, computational complexity, graph algorithm, chordal graph |
| 1 | Petr A. Golovach, Yngve Villanger |
Parameterized Complexity for Domination Problems on Degenerate Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
degenerate graphs, algorithms, domination, Parameterized complexity |
| 1 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
Spanners in Sparse Graphs. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Jan Kratochvíl |
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
Subject Computational complexity, graph algorithms |
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Distance Constrained Labelings of Trees. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl |
On tractability of Cops and Robbers game. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
Pursuit-evasion games on graphs, cliquewidth, algorithms, complexity, parameterized complexity |
| 1 | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer |
How to Guard a Graph?. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
Backbone colorings for graphs: Tree and path backbones. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Jan Kratochvíl |
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
Computational complexity, graph algorithms |
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Branch and Recharge: Exact Algorithms for Generalized Domination. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Distance Constrained Labelings of Graphs of Bounded Treewidth. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Elegant Distance Constrained Labelings of Trees. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach |
Interval degree and bandwidth of a graph. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
Backbone Colorings for Networks. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach |
Graph Searching and Interval Completion. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach |
Interval Completion with the Smallest Max-degree. |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")