 | 2012 |
| 26 |  | Tinaz Ekim,
Aysel Erey,
Pinar Heggernes,
Pim van 't Hof,
Daniel Meister:
Computing Minimum Geodetic Sets of Proper Interval Graphs.
LATIN 2012: 279-290 |
| 25 |  | Jean-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 |
| 24 |  | 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) |
| 23 |  | Petr A. Golovach,
Pim van 't Hof,
Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges
CoRR abs/1204.5113: (2012) |
| 22 |  | 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 |  | Ré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 |
| 20 |  | Pinar 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 |
| 19 |  | Pinar Heggernes,
Pim van 't Hof,
Daniel Lokshtanov,
Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges.
FSTTCS 2011: 217-228 |
| 18 |  | Pinar Heggernes,
Pim van 't Hof,
Benjamin Lévêque,
Daniel Lokshtanov,
Christophe Paul:
Contracting Graphs to Paths and Trees.
IPEC 2011: 55-66 |
| 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 |
| 16 |  | Rémy Belmonte,
Pinar Heggernes,
Pim van 't Hof:
Edge Contractions in Subclasses of Chordal Graphs.
TAMC 2011: 528-539 |
| 15 |  | Pinar Heggernes,
Pim van 't Hof,
Daniel Lokshtanov,
Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges
CoRR abs/1102.5441: (2011) |
| 14 |  | Pinar Heggernes,
Pim van 't Hof,
Benjamin Lévêque,
Daniel Lokshtanov,
Christophe Paul:
Contracting Graphs to Paths and Trees
CoRR abs/1104.3677: (2011) |
| 13 |  | Pinar 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 |
| 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 |
| 10 |  | Pinar Heggernes,
Pim van 't Hof,
Daniel Lokshtanov,
Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.
WG 2010: 75-87 |
| 9 |  | Pim van 't Hof,
Daniël Paulusma:
A new characterization of P6-free graphs.
Discrete Applied Mathematics 158(7): 731-740 (2010) |
| 8 |  | Pim 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) |
| 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) |
| 2009 |
| 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) |
| 2008 |
| 1 |  | Pim van 't Hof,
Daniël Paulusma:
A New Characterization of P6-Free Graphs.
COCOON 2008: 415-424 |