Petr A. Golovach Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Jian Song: 4-coloring H-free graphs when H is small. Discrete Applied Mathematics 161(1-2): 140-150 (2013)
j41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three complexity results on coloring Pk-free graphs. Eur. J. Comb. 34(3): 609-619 (2013)
j40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma: Choosability on H-free graphs. Inf. Process. Lett. 113(4): 107-110 (2013)
j39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin: Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52(4): 645-667 (2013)
j38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining planarity by contracting few edges. Theor. Comput. Sci. 476: 38-46 (2013)
j37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. 481: 74-84 (2013)
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Dieter Kratsch, Daniël Paulusma: Detecting induced minors in AT-free graphs. Theor. Comput. Sci. 482: 20-32 (2013)
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Petr A. Golovach, Viresh Patel: Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. 485: 69-84 (2013)
c57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey: Cliques and Clubs. CIAC 2013: 276-287
c56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma: List Coloring in the Absence of Two Subgraphs. CIAC 2013: 288-299
i11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski: Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. CoRR abs/1301.5953 (2013)
i10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Long Circuits and Large Euler Subgraphs. CoRR abs/1304.5746 (2013)
i9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach: Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. CoRR abs/1304.5870 (2013)
i8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen: On the parameterized complexity of cutting a few vertices from a graph. CoRR abs/1304.6189 (2013)
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach: Preventing Unraveling in Social Networks Gets Harder. CoRR abs/1304.6420 (2013)
2012
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding vertex-surjective graph homomorphisms. Acta Inf. 49(6): 381-394 (2012)
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen: Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012)
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Containment relations in split graphs. Discrete Applied Mathematics 160(1-2): 155-163 (2012)
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pinar Heggernes, Rodica Mihai: Edge search number of cographs. Discrete Applied Mathematics 160(6): 734-743 (2012)
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma: Distance three labelings of trees. Discrete Applied Mathematics 160(6): 764-779 (2012)
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý: Parameterized complexity of generalized domination problems. Discrete Applied Mathematics 160(6): 780-792 (2012)
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma: On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms 15: 56-62 (2012)
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game Without Recharging. Theory Comput. Syst. 50(4): 611-620 (2012)
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Pawel Pralat: Cops and Robber with Constraints. SIAM J. Discrete Math. 26(2): 571-590 (2012)
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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. 414(1): 9-19 (2012)
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. 420: 28-35 (2012)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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. 423: 1-10 (2012)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Jian Song: Computing vertex-surjective homomorphisms to partially reflexive trees. Theor. Comput. Sci. 457: 86-100 (2012)
c55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding Vertex-Surjective Graph Homomorphisms. CSR 2012: 160-171
c54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen: Induced Disjoint Paths in Claw-Free Graphs. ESA 2012: 515-526
c53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk: Minimizing Rosenthal Potential in Multicast Games. ICALP (2) 2012: 525-536
c52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Jian Song: Closing Complexity Gaps for Coloring Problems on H-Free Graphs. ISAAC 2012: 14-23
c51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Dieter Kratsch, Daniël Paulusma: Detecting Induced Minors in AT-Free Graphs. ISAAC 2012: 495-505
c50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei: An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. IPEC 2012: 85-96
c49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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: 350-361
c48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Bernard Ries: Coloring Graphs Characterized by a Forbidden Subgraph. MFCS 2012: 443-454
c47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges. MFCS 2012: 455-466
c46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Jian Song: 4-Coloring H-Free Graphs When H Is Small. SOFSEM 2012: 289-300
c45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Parameterized Complexity of Connected Even/Odd Subgraph Problems. STACS 2012: 432-440
c44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen: Induced Disjoint Paths in AT-Free Graphs. SWAT 2012: 153-164
c43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma: Solutions for the Stable Roommates Problem with Payments. WG 2012: 69-80
c42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk: How to Eliminate a Graph. WG 2012: 320-331
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen: Induced Disjoint Paths in Claw-Free Graphs. CoRR abs/1202.4419 (2012)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding vertex-surjective graph homomorphisms. CoRR abs/1204.2124 (2012)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges. CoRR abs/1204.5113 (2012)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger: Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay. CoRR abs/1208.5345 (2012)
2011
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica 61(2): 252-273 (2011)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph? Algorithmica 61(4): 839-856 (2011)
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Dimitrios M. Thilikos: Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discrete Optimization 8(1): 72-86 (2011)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Lift Contractions. Electronic Notes in Discrete Mathematics 38: 407-412 (2011)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen: Spanners of bounded degree graphs. Inf. Process. Lett. 111(3): 142-144 (2011)
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6): 1108-1119 (2011)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction obstructions for treewidth. J. Comb. Theory, Ser. B 101(5): 302-314 (2011)
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Width Parameters of Hypergraphs with Excluded Minors. SIAM J. Discrete Math. 25(3): 1331-1348 (2011)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. 412(8-10): 846-852 (2011)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412(23): 2513-2523 (2011)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. 412(46): 6484-6497 (2011)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh: Bandwidth on AT-free graphs. Theor. Comput. Sci. 412(50): 7001-7008 (2011)
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos: Odd cyclic surface separators in planar graphs. CTW 2011: 165-167
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Jian Song: Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. CSR 2011: 261-274
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Daniël Paulusma, Jian Song: Coloring Graphs without Short Cycles and Long Induced Paths. FCT 2011: 193-204
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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: 110-119
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Increasing the Minimum Degree of a Graph by Contractions. IPEC 2011: 67-79
c36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Petr A. Golovach, Viresh Patel: Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC 2011: 207-218
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Marcin Kaminski, Daniël Paulusma: Contracting a Chordal Graph to a Split Graph or a Tree. MFCS 2011: 339-350
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma: List Coloring in the Absence of a Linear Forest. WG 2011: 119-130
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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 abs/1112.3244 (2011)
2010
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Petr A. Golovach: Complexity of the packing coloring problem for trees. Discrete Applied Mathematics 158(7): 771-778 (2010)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh: Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110(16): 702-706 (2010)
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan: Pursuing a fast robber on a graph. Theor. Comput. Sci. 411(7-9): 1167-1181 (2010)
c33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167
c32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA 2010: 493-502
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game without Recharging. SWAT 2010: 273-284
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Bernard Lidický, Daniël Paulusma: L(2, 1, 1)-Labeling Is NP-Complete for Trees. TAMC 2010: 211-221
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximation Algorithms for Domination Search. WAOA 2010: 130-141
c28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Dieter Kratsch, Jean-François Couturier: Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. WG 2010: 39-50
c27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. WG 2010: 63-74
2009
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl: The capture time of a graph. Discrete Mathematics 309(18): 5588-5595 (2009)
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14): 795-798 (2009)
c26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009: 514-523
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh: Bandwidth on AT-Free Graphs. ISAAC 2009: 573-582
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Dimitrios M. Thilikos: Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. IWPEC 2009: 210-221
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Pinar Heggernes: Choosability of P5-Free Graphs. MFCS 2009: 382-391
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Guard Games on Graphs: Keep the Intruder Out! WAOA 2009: 147-158
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý: Parameterized Complexity of Generalized Domination Problems. WG 2009: 133-142
2008
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) 2008: 294-305
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in Sparse Graphs. ICALP (1) 2008: 597-608
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl: On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph?. ISAAC 2008: 318-329
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS 2008: 290-298
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Trees. TAMC 2008: 125-135
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Jan Kratochvíl: Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. TAMC 2008: 182-191
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Petr A. Golovach: Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Yngve Villanger: Parameterized Complexity for Domination Problems on Degenerate Graphs. WG 2008: 195-205
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating acyclicity parameters of sparse hypergraphs. CoRR abs/0809.3646 (2008)
2007
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory 55(2): 137-152 (2007)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petr A. Golovach, Jan Kratochvíl: Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG 2007: 1-11
2005
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372
2004
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67
2003
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Interval degree and bandwidth of a graph. Discrete Applied Mathematics 129(2-3): 345-359 (2003)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142
2000
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Graph Searching and Interval Completion. SIAM J. Discrete Math. 13(4): 454-464 (2000)
1998
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fedor V. Fomin, Petr A. Golovach: Interval Completion with the Smallest Max-degree. WG 1998: 359-371

Coauthor Index

1Rémy Belmonte
[c38]
2Péter Biró
[c43]
3Hans L. Bodlaender
[j33]
4Matthijs Bomhoff
[c43]
5Anthony Bonato
[j5]
6Hajo Broersma (H. J. Broersma)
[j41] [j35] [i11] [j25] [j23] [c36] [c33] [c27] [c23] [j3] [c2]
7Rajesh Hemant Chitnis
[i9] [i7]
8Jean-François Couturier
[j39] [j28] [c34] [c28]
9Feodor F. Dragan
[j16] [j13] [c14] [c11]
10Jirí Fiala
[i11] [j30] [j12] [j9] [c18] [c15] [c10] [c8] [c4] [c3]
11Fedor V. Fomin
[j41] [i10] [i9] [i8] [i7] [j33] [j27] [j26] [c53] [c49] [c45] [j21] [j20] [j17] [j16] [j15] [j14] [j13] [j11] [i2] [j8] [j7] [j6] [c32] [c31] [c29] [j4] [c26] [c23] [c20] [c19] [c17] [c14] [c13] [c12] [c11] [i1] [j3] [c6] [j2] [c2] [j1] [c1]
12Serge Gaspers
[c49] [i2] [j8]
13Gena Hahn
[j5]
14Alexander Hall
[j20] [c12]
15Pinar Heggernes
[j40] [c57] [j31] [c50] [c42] [i3] [j10] [c38] [c24] [c21]
16Pim van 't Hof
[j40] [j38] [c47] [c42] [i4] [c38]
17Tomás Kaiser
[i11]
18Marcin Jakub Kaminski (Marcin Kaminski)
[j37] [j32] [j24] [j18] [c41] [c38] [c37] [c35] [c25]
19Walter Kern
[c43]
20Janne H. Korhonen
[i8]
21Jan Kratochvíl
[j30] [j29] [j21] [j12] [j6] [j5] [j4] [c18] [c16] [c15] [c13] [c10] [c9] [c6] [c5] [c4] [c3]
22Dieter Kratsch
[j39] [j36] [c57] [j28] [c51] [c50] [i3] [j21] [j10] [c34] [j8] [c28] [j4] [c24] [c6]
23Erik Jan van Leeuwen
[j33] [c54] [c49] [c44] [i6] [j17] [i2]
24Bernard Lidický
[j34] [j30] [c55] [i5] [c30]
25Mathieu Liedloff
[j39] [j21] [j4] [c6]
26Daniel Lokshtanov
[j27] [j11] [j10] [j7] [c32] [c31] [c24] [c20] [c17]
27Fredrik Manne
[c42]
28Barnaby Martin
[j34] [c55] [i5]
29Daniel Meister
[j10] [c24]
30Rodica Mihai
[j31]
31Matús Mihalák
[j20] [c12]
32Jesper Nederlof
[c53]
33Nicolas Nisse
[j6]
34Yota Otachi
[j33]
35Viresh Patel
[j35] [c36]
36Daniël Paulusma
[j42] [j41] [j40] [j38] [j37] [j36] [c56] [i11] [j34] [j32] [j30] [j28] [j25] [j24] [j23] [j22] [c55] [c54] [c52] [c51] [c48] [c47] [c46] [c44] [c43] [c42] [i6] [i5] [i4] [j18] [c40] [c39] [c38] [c37] [c35] [c34] [c33] [c30] [c27] [c25] [c23]
37Michal Pilipczuk
[c53] [c42]
38Pawel Pralat
[j26]
39Andrzej Proskurowski
[i11]
40Artem V. Pyatkin
[j39]
41Arash Rafiey
[c57]
42Bernard Ries
[c48]
43Reza Saei
[c50]
44Saket Saurabh
[j10] [j8] [j7] [c32] [c24] [c20]
45Jian Song
[j42] [j25] [j23] [j22] [c52] [c46] [c40] [c39] [c33] [c27]
46Karol Suchan
[c49] [i2] [j6]
47Ondrej Suchý
[j29] [c16]
48Stefan Szeider
[c49] [i2]
49Dimitrios M. Thilikos
[j37] [j32] [j24] [j19] [j18] [j15] [j14] [c41] [c37] [c29] [c26] [c25] [c22] [c19] [i1]
50Martin Vatshelle
[c49] [i2]
51Elias Vicari
[j20] [c12]
52Yngve Villanger
[c49] [i3] [i2] [c7]
53Peter Widmayer
[j20] [c12]
54Gerhard J. Woeginger
[j3] [c2]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Thu May 23 17:09:37 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page