![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 31 | Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Characterizing Graphs of Small Carving-Width. COCOA 2012: 360-370 | |
| 27 | Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges. MFCS 2012: 455-466 | |
| 25 | Pim 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) | |
| 24 | Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges CoRR abs/1204.5113: (2012) | |
| 23 | Pim 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) | |
| 21 | Pinar Heggernes, Pim van 't Hof, Daniël Paulusma: Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms 14: 173-188 (2012) | |
| 17 | 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 | |
| 12 | Pinar Heggernes, Pim van 't Hof, Daniël Paulusma: Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA 2010: 167-180 | |
| 11 | Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514 | |
| 9 | Pim van 't Hof, Daniël Paulusma: A new characterization of P6-free graphs. Discrete Applied Mathematics 158(7): 731-740 (2010) | |
| 7 | Pim 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) | |
| 6 | Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning Graphs into Connected Parts. CSR 2009: 143-154 | |
| 5 | Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij: Computing Role Assignments of Chordal Graphs. FCT 2009: 193-204 | |
| 4 | Pim van 't Hof, Marcin Kaminski, Daniël Paulusma: Finding Induced Paths of Given Parity in Claw-Free Graphs. WG 2009: 341-352 | |
| 3 | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma: Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53 | |
| 2 | Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning graphs into connected parts. Theor. Comput. Sci. 410(47-49): 4834-4843 (2009) | |
| 1 | Pim van 't Hof, Daniël Paulusma: A New Characterization of P6-Free Graphs. COCOON 2008: 415-424 |
Selection of 17 from 31 records - Pim van 't Hof has 26 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page