Petr A. Golovach

	2012
79		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
78		Petr A. Golovach, Daniël Paulusma, Jian Song: 4-Coloring H-Free Graphs When H Is Small. SOFSEM 2012: 289-300
77		Fedor V. Fomin, Petr A. Golovach: Parameterized Complexity of Connected Even/Odd Subgraph Problems. STACS 2012: 432-440
76		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)
75		Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen: Induced Disjoint Paths in Claw-Free Graphs CoRR abs/1202.4419: (2012)
74		Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding vertex-surjective graph homomorphisms CoRR abs/1204.2124: (2012)
73		Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges CoRR abs/1204.5113: (2012)
72		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)
71		Petr A. Golovach, Pinar Heggernes, Rodica Mihai: Edge search number of cographs. Discrete Applied Mathematics 160(6): 734-743 (2012)
70		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)
69		Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý: Parameterized complexity of generalized domination problems. Discrete Applied Mathematics 160(6): 780-792 (2012)
68		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)
67		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)
66		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)
65		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game Without Recharging. Theory Comput. Syst. 50(4): 611-620 (2012)
	2011
64		Petr A. Golovach, Daniël Paulusma, Jian Song: Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. CSR 2011: 261-274
63		Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos: Odd cyclic surface separators in planar graphs. CTW 2011: 165-167
62		Petr A. Golovach, Daniël Paulusma, Jian Song: Coloring Graphs without Short Cycles and Long Induced Paths. FCT 2011: 193-204
61		Hajo Broersma, Petr A. Golovach, Viresh Patel: Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC 2011: 207-218
60		Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Increasing the Minimum Degree of a Graph by Contractions. IPEC 2011: 67-79
59		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
58		Petr A. Golovach, Marcin Kaminski, Daniël Paulusma: Contracting a Chordal Graph to a Split Graph or a Tree. MFCS 2011: 339-350
57		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
56		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)
55		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)
54		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)
53		Petr A. Golovach, Dimitrios M. Thilikos: Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discrete Optimization 8(1): 72-86 (2011)
52		Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Lift Contractions. Electronic Notes in Discrete Mathematics 38: 407-412 (2011)
51		Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen: Spanners of bounded degree graphs. Inf. Process. Lett. 111(3): 142-144 (2011)
50		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction obstructions for treewidth. J. Comb. Theory, Ser. B 101(5): 302-314 (2011)
49		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6): 1108-1119 (2011)
48		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)
47		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)
46		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. 412(46): 6484-6497 (2011)
45		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)
44		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)
	2010
43		Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167
42		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA 2010: 493-502
41		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Cops and Robber Game without Recharging. SWAT 2010: 273-284
40		Petr A. Golovach, Bernard Lidický, Daniël Paulusma: L(2, 1, 1)-Labeling Is NP-Complete for Trees. TAMC 2010: 211-221
39		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximation Algorithms for Domination Search. WAOA 2010: 130-141
38		Petr A. Golovach, Dieter Kratsch, Jean-François Couturier: Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. WG 2010: 39-50
37		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
36		Jirí Fiala, Petr A. Golovach: Complexity of the packing coloring problem for trees. Discrete Applied Mathematics 158(7): 771-778 (2010)
35		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)
34		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010)
33		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)
	2009
32		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717
31		Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009: 514-523
30		Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh: Bandwidth on AT-Free Graphs. ISAAC 2009: 573-582
29		Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104
28		Petr A. Golovach, Dimitrios M. Thilikos: Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. IWPEC 2009: 210-221
27		Petr A. Golovach, Pinar Heggernes: Choosability of P5-Free Graphs. MFCS 2009: 382-391
26		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
25		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456
24		Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230
23		Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov: Guard Games on Graphs: Keep the Intruder Out! WAOA 2009: 147-158
22		Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý: Parameterized Complexity of Generalized Domination Problems. WG 2009: 133-142
21		Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl: The capture time of a graph. Discrete Mathematics 309(18): 5588-5595 (2009)
20		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)
	2008
19		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
18		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in Sparse Graphs. ICALP (1) 2008: 597-608
17		Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl: On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185
16		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
15		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
14		Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Trees. TAMC 2008: 125-135
13		Petr A. Golovach, Jan Kratochvíl: Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. TAMC 2008: 182-191
12		Jirí Fiala, Petr A. Golovach: Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145
11		Petr A. Golovach, Yngve Villanger: Parameterized Complexity for Domination Problems on Degenerate Graphs. WG 2008: 195-205
10		Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating acyclicity parameters of sparse hypergraphs CoRR abs/0809.3646: (2008)
	2007
9		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
8		Petr A. Golovach, Jan Kratochvíl: Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG 2007: 1-11
7		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)
	2005
6		Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372
	2004
5		Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67
	2003
4		Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142
3		Fedor V. Fomin, Petr A. Golovach: Interval degree and bandwidth of a graph. Discrete Applied Mathematics 129(2-3): 345-359 (2003)
	2000
2		Fedor V. Fomin, Petr A. Golovach: Graph Searching and Interval Completion. SIAM J. Discrete Math. 13(4): 454-464 (2000)
	1998
1		Fedor V. Fomin, Petr A. Golovach: Interval Completion with the Smallest Max-degree. WG 1998: 359-371

Coauthor Index

1	Rémy Belmonte	[59]
2	Hans L. Bodlaender	[76]
3	Anthony Bonato	[21]
4	Hajo Broersma (H. J. Broersma)	[4] [7] [29] [37] [43] [61] [66] [68]
5	Jean-François Couturier	[38] [57]
6	Feodor F. Dragan	[15] [18] [44] [49]
7	Jirí Fiala	[5] [6] [12] [14] [19] [24] [36] [47] [70]
8	Fedor V. Fomin	[1] [2] [3] [4] [7] [9] [10] [15] [16] [17] [18] [20] [23] [25] [26] [29] [32] [33] [34] [35] [39] [41] [42] [44] [46] [48] [49] [50] [51] [54] [55] [56] [65] [76] [77] [79]
9	Serge Gaspers	[35] [54] [79]
10	Gena Hahn	[21]
11	Alexander Hall	[16] [55]
12	Pinar Heggernes	[27] [30] [45] [59] [71]
13	Pim van 't Hof	[59] [73]
14	Marcin Jakub Kaminski (Marcin Kaminski)	[31] [52] [58] [59] [60] [63] [67] [72]
15	Jan Kratochvíl	[5] [6] [8] [9] [13] [14] [17] [19] [20] [21] [22] [24] [33] [47] [56] [69] [70]
16	Dieter Kratsch	[9] [20] [30] [35] [38] [45] [56] [57]
17	Erik Jan van Leeuwen	[51] [54] [75] [76] [79]
18	Bernard Lidický	[40] [70] [74]
19	Mathieu Liedloff	[9] [20] [56]
20	Daniel Lokshtanov	[23] [26] [30] [34] [41] [42] [45] [46] [65]
21	Barnaby Martin	[74]
22	Daniel Meister	[30] [45]
23	Rodica Mihai	[71]
24	Matús Mihalák	[16] [55]
25	Nicolas Nisse	[33]
26	Yota Otachi	[76]
27	Viresh Patel	[61]
28	Daniël Paulusma	[29] [31] [37] [40] [43] [52] [57] [58] [59] [60] [62] [64] [66] [67] [68] [70] [72] [73] [74] [75] [78]
29	Saket Saurabh	[26] [30] [34] [35] [42] [45]
30	Jian Song	[37] [43] [62] [64] [66] [68] [78]
31	Karol Suchan	[33] [54] [79]
32	Ondrej Suchý	[22] [69]
33	Stefan Szeider	[54] [79]
34	Dimitrios M. Thilikos	[10] [25] [28] [31] [32] [39] [48] [50] [52] [53] [60] [63] [67] [72]
35	Martin Vatshelle	[54] [79]
36	Elias Vicari	[16] [55]
37	Yngve Villanger	[11] [54] [79]
38	Peter Widmayer	[16] [55]
39	Gerhard J. Woeginger	[4] [7]

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page