Hof Pim

Pim Hof

Information about the author Pim Hof will soon be added to the site.
Found 4 papers in total
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
2015
We study the problem of finding small s – t separators that induce graphs having...
Proper Interval Vertex Deletion
Proper Interval Vertex Deletion
2013
The NP‐complete problem Proper Interval Vertex Deletion is to decide whether an...
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
2013
The Hamiltonian Cycle problem is the problem of deciding whether an n ‐vertex...
Contracting Graphs to Paths and Trees
Contracting Graphs to Paths and Trees
2014
Vertex deletion and edge deletion problems play a central role in parameterized...
Papers per page: