Pim van 't Hof

According to our database, Pim van 't Hof authored at least 50 papers between 2008 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

Anticipatory Vehicle Routing for Same-Day Pick-up and Delivery using Historical Data Clustering.

Jelmer van Lochem, Maximilian Kronmueller, Pim van 't Hof, Javier Alonso-Mora

Proceedings of the 23rd IEEE International Conference on Intelligent Transportation Systems, 2020

2017

The price of connectivity for feedback vertex set.

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Discret. Appl. Math., 2017

2015

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs.

Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger

Theor. Comput. Sci., 2015

Computing the metric dimension for chain graphs.

Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei

Inf. Process. Lett., 2015

Modifying a Graph Using Vertex Elimination.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk

Algorithmica, 2015

Editing to a Planar Graph of Given Degrees.

Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos

Proceedings of the Computer Science - Theory and Applications, 2015

2014

Graph classes and Ramsey numbers.

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei

Discret. Appl. Math., 2014

On the Computational Complexity of Vertex Integrity.

Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof

CoRR, 2014

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.

Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Algorithmica, 2014

Parameterized complexity of three edge contraction problems with degree constraints.

Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

Acta Informatica, 2014

Hadwiger Number of Graphs with Small Chordality.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Maximal Induced Matchings in Triangle-Free Graphs.

Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Finding Disjoint Paths in Split Graphs.

Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set.

Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On the Computational Complexity of Vertex Integrity and Component Order Connectivity.

Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Editing to Eulerian Graphs.

Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Choosability on H-free graphs.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma

Inf. Process. Lett., 2013

Proper Interval Vertex Deletion.

Pim van 't Hof, Yngve Villanger

Algorithmica, 2013

Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs.

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma

Algorithmica, 2013

Vector Connectivity in Graphs.

Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic

Proceedings of the Theory and Applications of Models of Computation, 2013

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.

Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Induced Subtrees in Interval Graphs.

Pinar Heggernes, Pim van 't Hof, Martin Milanic

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree.

Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012

On graph contractions and induced minors.

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos

Discret. Appl. Math., 2012

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.

Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

How to Eliminate a Graph.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration.

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Obtaining Planarity by Contracting Few Edges.

Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.

Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Induced Immersions.

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Ramsey Numbers for Line Graphs and Perfect Graphs.

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Characterizing Graphs of Small Carving-Width.

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Contracting chordal graphs and bipartite graphs to paths and trees.

Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul

Electron. Notes Discret. Math., 2011

Edge Contractions in Subclasses of Chordal Graphs.

Rémy Belmonte, Pinar Heggernes, Pim van 't Hof

Proceedings of the Theory and Applications of Models of Computation, 2011

Contracting Graphs to Paths and Trees.

Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.

Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Obtaining a Bipartite Graph by Contracting Few Edges.

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Parameterized Complexity of Vertex Deletion into Perfect Graph Classes.

Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Exploiting structure to cope with NP-hard graph problems : polynomial and exponential time exact algorithms.

Pim van 't Hof

PhD thesis, 2010

Constructing fair round robin tournaments with a minimum number of breaks.

Pim van 't Hof, Gerhard F. Post, Dirk Briskorn

Oper. Res. Lett., 2010

A new characterization of P₆-free graphs.

Pim van 't Hof, Daniël Paulusma

Discret. Appl. Math., 2010

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

On Contracting Graphs to Fixed Pattern Graphs.

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Computing Role Assignments of Proper Interval Graphs in Polynomial Time.

Pinar Heggernes, Pim van 't Hof, Daniël Paulusma

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Finding Induced Paths of Given Parity in Claw-Free Graphs.

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Computing Role Assignments of Chordal Graphs.

Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Partitioning Graphs into Connected Parts.

Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger

Proceedings of the Computer Science, 2009

2008

A New Characterization of P6-Free Graphs.

Pim van 't Hof, Daniël Paulusma

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008