Petr A. Golovach

2009
21	EE	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
20	EE	Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456
2008
19	EE	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	EE	Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in Sparse Graphs. ICALP (1) 2008: 597-608
17	EE	Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl: On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185
16	EE	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	EE	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	EE	Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Trees. TAMC 2008: 125-135
13	EE	Petr A. Golovach, Jan Kratochvíl: Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. TAMC 2008: 182-191
12	EE	Jirí Fiala, Petr A. Golovach: Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145
11	EE	Petr A. Golovach, Yngve Villanger: Parameterized Complexity for Domination Problems on Degenerate Graphs. WG 2008: 195-205
10	EE	Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating acyclicity parameters of sparse hypergraphs CoRR abs/0809.3646: (2008)
2007
9	EE	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	EE	Petr A. Golovach, Jan Kratochvíl: Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG 2007: 1-11
7	EE	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	EE	Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372
2004
5	EE	Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67
2003
4	EE	Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142
3	EE	Fedor V. Fomin, Petr A. Golovach: Interval degree and bandwidth of a graph. Discrete Applied Mathematics 129(2-3): 345-359 (2003)
2000
2	EE	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	Hajo Broersma (H. J. Broersma)	[4] [7]
2	Feodor F. Dragan	[15] [18]
3	Jirí Fiala	[5] [6] [12] [14] [19]
4	Fedor V. Fomin	[1] [2] [3] [4] [7] [9] [10] [15] [16] [17] [18] [20] [21]
5	Alexander Hall	[16]
6	Jan Kratochvíl	[5] [6] [8] [9] [13] [14] [17] [19]
7	Dieter Kratsch	[9]
8	Mathieu Liedloff	[9]
9	Daniel Lokshtanov	[21]
10	Matús Mihalák	[16]
11	Saket Saurabh	[21]
12	Dimitrios M. Thilikos	[10] [20]
13	Elias Vicari	[16]
14	Yngve Villanger	[11]
15	Peter Widmayer	[16]
16	Gerhard J. Woeginger	[4] [7]