dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Pim van 't Hof Coauthor index pubzone.org

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

DBLP keys2012
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTinaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister: Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN 2012: 279-290
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch: Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM 2012: 202-213
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Marcin Kaminski, Daniël Paulusma: Finding Induced Paths of Given Parity in Claw-Free Graphs. Algorithmica 62(1-2): 537-563 (2012)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges CoRR abs/1204.5113: (2012)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On graph contractions and induced minors. Discrete Applied Mathematics 160(6): 799-809 (2012)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRémy Belmonte, Pinar Heggernes, Pim van 't Hof: Edge contractions in subclasses of chordal graphs. Discrete Applied Mathematics 160(7-8): 999-1010 (2012)
2011
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger: Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT 2011: 240-251
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul: Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS 2011: 217-228
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul: Contracting Graphs to Paths and Trees. IPEC 2011: 55-66
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRé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
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRémy Belmonte, Pinar Heggernes, Pim van 't Hof: Edge Contractions in Subclasses of Chordal Graphs. TAMC 2011: 528-539
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul: Obtaining a Bipartite Graph by Contracting Few Edges CoRR abs/1102.5441: (2011)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul: Contracting Graphs to Paths and Trees CoRR abs/1104.3677: (2011)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul: Contracting chordal graphs and bipartite graphs to paths and trees. Electronic Notes in Discrete Mathematics 37: 87-92 (2011)
2010
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Pim van 't Hof, Daniël Paulusma: Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA 2010: 167-180
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof: Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG 2010: 75-87
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Daniël Paulusma: A new characterization of P6-free graphs. Discrete Applied Mathematics 158(7): 731-740 (2010)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Gerhard F. Post, Dirk Briskorn: Constructing fair round robin tournaments with a minimum number of breaks. Oper. Res. Lett. 38(6): 592-596 (2010)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij: Computing role assignments of chordal graphs. Theor. Comput. Sci. 411(40-42): 3601-3613 (2010)
2009
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning Graphs into Connected Parts. CSR 2009: 143-154
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij: Computing Role Assignments of Chordal Graphs. FCT 2009: 193-204
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Marcin Kaminski, Daniël Paulusma: Finding Induced Paths of Given Parity in Claw-Free Graphs. WG 2009: 341-352
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma: Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning graphs into connected parts. Theor. Comput. Sci. 410(47-49): 4834-4843 (2009)
2008
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPim van 't Hof, Daniël Paulusma: A New Characterization of P6-Free Graphs. COCOON 2008: 415-424

Coauthor Index

1Rémy Belmonte [16] [17] [21]
2Dirk Briskorn [8]
3Hajo Broersma (H. J. Broersma) [3]
4Jean-François Couturier [25]
5Tinaz Ekim [26]
6Aysel Erey [26]
7Fedor V. Fomin [3]
8Petr A. Golovach [17] [23]
9Pinar Heggernes [10] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [25] [26]
10Bart M. P. Jansen [20]
11Marcin Jakub Kaminski (Marcin Kaminski) [4] [11] [17] [22] [24]
12Dieter Kratsch [25]
13Stefan Kratsch [20]
14Benjamin Lévêque [13] [14] [18]
15Daniel Lokshtanov [10] [14] [15] [18] [19]
16Daniel Meister [26]
17Jesper Nederlof [10]
18Christophe Paul [13] [14] [15] [18] [19]
19Daniël Paulusma [1] [2] [3] [4] [5] [6] [7] [9] [11] [12] [17] [22] [23] [24]
20Gerhard F. Post [8]
21Johan M. M. van Rooij [5] [7]
22Stefan Szeider [11] [22]
23Dimitrios M. Thilikos [11] [22]
24Yngve Villanger [20]
25Gerhard J. Woeginger [2] [6]

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