Pim van 't Hof

ORCID

Publication Activity (10 Years)

Years Active: 2008-2020
Publications (10 Years): 16

Top Venues

Durham University, UK (PHD)

Education History

Durham University, UK

PHD

Publications

Jelmer van Lochem, Maximilian Kronmueller, Pim van 't Hof, Javier Alonso-Mora
Anticipatory Vehicle Routing for Same-Day Pick-up and Delivery using Historical Data Clustering. ITSC (2020)
Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
Editing to a planar graph of given degrees. J. Comput. Syst. Sci. 85 (2017)
Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
The price of connectivity for feedback vertex set. Discret. Appl. Math. 217 (2017)
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
Maximal Induced Matchings in Triangle-Free Graphs. J. Graph Theory 83 (3) (2016)
Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Editing to Eulerian graphs. J. Comput. Syst. Sci. 82 (2) (2016)
Pål Grønås Drange, Markus S. Dregi, Pim van 't Hof
On the Computational Complexity of Vertex Integrity and Component Order Connectivity. Algorithmica 76 (4) (2016)
Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei
Computing the metric dimension for chain graphs. Inf. Process. Lett. 115 (9) (2015)
Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma
The Price of Connectivity for Feedback Vertex Set. CoRR (2015)
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
Editing to a Planar Graph of Given Degrees. CoRR (2015)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
Modifying a Graph Using Vertex Elimination. Algorithmica 72 (1) (2015)
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica 72 (3) (2015)
Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
Editing to a Planar Graph of Given Degrees. CSR (2015)
Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562 (2015)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. 29 (3) (2015)
Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590 (2015)
Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
Finding Disjoint Paths in Split Graphs. Theory Comput. Syst. 57 (1) (2015)
Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
Finding Disjoint Paths in Split Graphs. SOFSEM (2014)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
Contracting Graphs to Paths and Trees. Algorithmica 68 (1) (2014)
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
Maximal Induced Matchings in Triangle-Free Graphs. WG (2014)
Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
On the Computational Complexity of Vertex Integrity and Component Order Connectivity. ISAAC (2014)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
Hadwiger Number of Graphs with Small Chordality. WG (2014)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei
Graph classes and Ramsey numbers. Discret. Appl. Math. 173 (2014)
Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica 51 (7) (2014)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. 164 (2014)
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Editing to Eulerian Graphs. CoRR (2014)
Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Editing to Eulerian Graphs. FSTTCS (2014)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
Hadwiger number of graphs with small chordality. CoRR (2014)
Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
Vector connectivity in graphs. Networks 63 (4) (2014)
Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
On the Computational Complexity of Vertex Integrity. CoRR (2014)
Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR (2014)
Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica 69 (3) (2014)
Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. MFCS (2) (2014)
Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. IPEC (2013)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. 27 (4) (2013)
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
Maximal induced matchings in triangle-free graphs. CoRR (2013)
Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
Characterizing graphs of small carving-width. Discret. Appl. Math. 161 (13-14) (2013)
Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. 511 (2013)
Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Obtaining planarity by contracting few edges. Theor. Comput. Sci. 476 (2013)
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theor. Comput. Sci. 487 (2013)
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) (2013)
Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. FCT (2013)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
Choosability on H-free graphs. Inf. Process. Lett. 113 (4) (2013)
Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
Vector Connectivity in Graphs. TAMC (2013)
Pinar Heggernes, Pim van 't Hof, Martin Milanic
Induced Subtrees in Interval Graphs. IWOCA (2013)
Pim van 't Hof, Yngve Villanger
Proper Interval Vertex Deletion. Algorithmica 65 (4) (2013)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei
Ramsey Numbers for Line Graphs and Perfect Graphs. COCOON (2012)
Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms 14 (2012)
Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Obtaining Planarity by Contracting Few Edges CoRR (2012)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof
Edge contractions in subclasses of chordal graphs. Discret. Appl. Math. 160 (7-8) (2012)
Rémy Belmonte, Pim van 't Hof, Marcin Kaminski
Induced Immersions. ISAAC (2012)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
How to Eliminate a Graph. WG (2012)
Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Obtaining Planarity by Contracting Few Edges. MFCS (2012)
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)
Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
Characterizing Graphs of Small Carving-Width. COCOA (2012)
Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister
Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN (2012)
Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
Finding Induced Paths of Given Parity in Claw-Free Graphs. Algorithmica 62 (1-2) (2012)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. 26 (3) (2012)
Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
On graph contractions and induced minors. Discret. Appl. Math. 160 (6) (2012)
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM (2012)
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)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
Obtaining a Bipartite Graph by Contracting Few Edges CoRR (2011)
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)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
Contracting Graphs to Paths and Trees CoRR (2011)
Rémy Belmonte, Pinar Heggernes, Pim van 't Hof
Edge Contractions in Subclasses of Chordal Graphs. TAMC (2011)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. 37 (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)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS (2011)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
Contracting Graphs to Paths and Trees. IPEC (2011)
Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA (2010)
Pim van 't Hof, Daniël Paulusma
-free graphs. Discret. Appl. Math. 158 (7) (2010)
Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
On Contracting Graphs to Fixed Pattern Graphs. SOFSEM (2010)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG (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) (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) (2010)
Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
Finding Induced Paths of Given Parity in Claw-Free Graphs. WG (2009)
Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger
Partitioning Graphs into Connected Parts. CSR (2009)
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG (2009)
Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij
Computing Role Assignments of Chordal Graphs. FCT (2009)
Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger
Partitioning graphs into connected parts. Theor. Comput. Sci. 410 (47-49) (2009)
Pim van 't Hof, Daniël Paulusma
A New Characterization of P6-Free Graphs. COCOON (2008)

Pim van 't Hof.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pim van 't Hof