Pim van 't Hof

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma: Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65(1): 129-145 (2013)

Pim van 't Hof, Yngve Villanger: Proper Interval Vertex Deletion. Algorithmica 65(4): 845-867 (2013)

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma: Choosability on H-free graphs. Inf. Process. Lett. 113(4): 107-110 (2013)

Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining planarity by contracting few edges. Theor. Comput. Sci. 476: 38-46 (2013)

Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic: Vector Connectivity in Graphs. TAMC 2013: 331-342

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)

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)

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)

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)

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof: Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discrete Math. 26(3): 1008-1021 (2012)

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

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger: Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. COCOON 2012: 133-144

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei: Ramsey Numbers for Line Graphs and Perfect Graphs. COCOON 2012: 204-215

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski: Induced Immersions. ISAAC 2012: 299-308

Tinaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister: Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN 2012: 279-290

Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges. MFCS 2012: 455-466

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

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk: How to Eliminate a Graph. WG 2012: 320-331

Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger: On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. WG 2012: 332-343

Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges. CoRR abs/1204.5113 (2012)

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)

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

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul: Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS 2011: 217-228

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

Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul: Contracting Graphs to Paths and Trees. IPEC 2011: 55-66

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof: Edge Contractions in Subclasses of Chordal Graphs. TAMC 2011: 528-539

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul: Obtaining a Bipartite Graph by Contracting Few Edges. CoRR abs/1102.5441 (2011)

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)

Pim van 't Hof, Daniël Paulusma: A new characterization of P₆-free graphs. Discrete Applied Mathematics 158(7): 731-740 (2010)

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)

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)

Pinar Heggernes, Pim van 't Hof, Daniël Paulusma: Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA 2010: 167-180

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

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof: Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG 2010: 75-87

Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning graphs into connected parts. Theor. Comput. Sci. 410(47-49): 4834-4843 (2009)

Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning Graphs into Connected Parts. CSR 2009: 143-154

Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij: Computing Role Assignments of Chordal Graphs. FCT 2009: 193-204

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

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma: Finding Induced Paths of Given Parity in Claw-Free Graphs. WG 2009: 341-352

Pim van 't Hof, Daniël Paulusma: A New Characterization of P6-Free Graphs. COCOON 2008: 415-424