Pim van 't Hof

According to our database1, Pim van 't Hof authored at least 49 papers between 2008 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Editing to a planar graph of given degrees.
J. Comput. Syst. Sci., 2017

The price of connectivity for feedback vertex set.
Discret. Appl. Math., 2017

Maximal Induced Matchings in Triangle-Free Graphs.
J. Graph Theory, 2016

Editing to Eulerian graphs.
J. Comput. Syst. Sci., 2016

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

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs.
Theor. Comput. Sci., 2015

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.
Theor. Comput. Sci., 2015

Hadwiger Number of Graphs with Small Chordality.
SIAM J. Discret. Math., 2015

Finding Disjoint Paths in Split Graphs.
Theory Comput. Syst., 2015

Computing the metric dimension for chain graphs.
Inf. Process. Lett., 2015

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

Modifying a Graph Using Vertex Elimination.
Algorithmica, 2015

Vector connectivity in graphs.
Networks, 2014

Graph classes and Ramsey numbers.
Discret. Appl. Math., 2014

On the Computational Complexity of Vertex Integrity.
CoRR, 2014

Contracting Graphs to Paths and Trees.
Algorithmica, 2014

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.
Algorithmica, 2014

Parameterized complexity of three edge contraction problems with degree constraints.
Acta Informatica, 2014

Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Parameterized complexity of vertex deletion into perfect graph classes.
Theor. Comput. Sci., 2013

Obtaining planarity by contracting few edges.
Theor. Comput. Sci., 2013

Minimal dominating sets in graph classes: Combinatorial bounds and enumeration.
Theor. Comput. Sci., 2013

Obtaining a Bipartite Graph by Contracting Few Edges.
SIAM J. Discret. Math., 2013

Choosability on H-free graphs.
Inf. Process. Lett., 2013

Characterizing graphs of small carving-width.
Discret. Appl. Math., 2013

Proper Interval Vertex Deletion.
Algorithmica, 2013

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

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Induced Subtrees in Interval Graphs.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.
SIAM J. Discret. Math., 2012

Computing role assignments of proper interval graphs in polynomial time.
J. Discrete Algorithms, 2012

On graph contractions and induced minors.
Discret. Appl. Math., 2012

Edge contractions in subclasses of chordal graphs.
Discret. Appl. Math., 2012

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

How to Eliminate a Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

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

Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Ramsey Numbers for Line Graphs and Perfect Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Contracting chordal graphs and bipartite graphs to paths and trees.
Electron. Notes Discret. Math., 2011

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

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

Computing role assignments of chordal graphs.
Theor. Comput. Sci., 2010

Constructing fair round robin tournaments with a minimum number of breaks.
Oper. Res. Lett., 2010

A new characterization of P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2010

On Contracting Graphs to Fixed Pattern Graphs.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Partitioning graphs into connected parts.
Theor. Comput. Sci., 2009

Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

A New Characterization of P6-Free Graphs.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008