Petr A. Golovach Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Pinar Heggernes: Choosability of P5-Free Graphs. MFCS 2009: 382-391
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor 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
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) 2008: 294-305
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFeodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in Sparse Graphs. ICALP (1) 2008: 597-608
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl: On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph?. ISAAC 2008: 318-329
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFeodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS 2008: 290-298
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Trees. TAMC 2008: 125-135
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Jan Kratochvíl: Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. TAMC 2008: 182-191
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach: Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Yngve Villanger: Parameterized Complexity for Domination Problems on Degenerate Graphs. WG 2008: 195-205
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos: Approximating acyclicity parameters of sparse hypergraphs CoRR abs/0809.3646: (2008)
2007
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Jan Kratochvíl: Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG 2007: 1-11
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372
2004
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJirí Fiala, Petr A. Golovach, Jan Kratochvíl: Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67
2003
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach: Interval degree and bandwidth of a graph. Discrete Applied Mathematics 129(2-3): 345-359 (2003)
2000
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach: Graph Searching and Interval Completion. SIAM J. Discrete Math. 13(4): 454-464 (2000)
1998
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Petr A. Golovach: Interval Completion with the Smallest Max-degree. WG 1998: 359-371

Coauthor Index

1Hajo Broersma (H. J. Broersma) [4] [7] [25]
2Feodor F. Dragan [15] [18]
3Jirí Fiala [5] [6] [12] [14] [19] [21]
4Fedor V. Fomin [1] [2] [3] [4] [7] [9] [10] [15] [16] [17] [18] [20] [22] [23] [25] [26]
5Alexander Hall [16]
6Pinar Heggernes [24]
7Jan Kratochvíl [5] [6] [8] [9] [13] [14] [17] [19] [20] [21]
8Dieter Kratsch [9] [20]
9Mathieu Liedloff [9] [20]
10Daniel Lokshtanov [23]
11Matús Mihalák [16]
12Daniël Paulusma [25]
13Saket Saurabh [23]
14Dimitrios M. Thilikos [10] [22] [26]
15Elias Vicari [16]
16Yngve Villanger [11]
17Peter Widmayer [16]
18Gerhard J. Woeginger [4] [7]

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)