14 citations · 19 across the 8 of their papers we have counts for
8 papers
The Price of Connectivity for Feedback Vertex Set
Rémy Belmonte, Pim van 't Hof, Marcin Kamiński +1
Let fvs and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph , respectively. The price of connectivi…
Editing to a Planar Graph of Given Degrees
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof +2
We consider the following graph modification problem. Let the input consist of a graph , a weight function , a cost function $c\colo…
Editing to Eulerian Graphs
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof +1
We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let , and denote t…
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree
Steven Chaplick, Jiří Fiala, Pim van 't Hof +2
A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its restriction to the neighborhood of every vertex of G is bijective, surjective, or i…
Hadwiger number of graphs with small chordality
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof +1
The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph…
On the Computational Complexity of Vertex Integrity and Component Order Connectivity
Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
The Weighted Vertex Integrity (wVI) problem takes as input an -vertex graph , a weight function , and an integer . The task is to decide if there exis…