Pim van ’t Hof

On the Computational Complexity of Vertex Integrity and Component Order Connectivity

Pål Grønås Drange, Markus Sortland Dregi, Pim van ’t Hof · Algorithmica · 2016 · 85 citations

Vertex Integrity, Engineering, Graph Theory +13

Minimal dominating sets in graph classes: Combinatorial bounds and enumeration

Jean-Fraņcois Couturier, Pinar Heggernes, Pim van ’t Hof et al. · Theoretical Computer Science · 2013 · 59 citations

Graph Minor, Engineering, Graph Theory +8

Obtaining a Bipartite Graph by Contracting Few Edges

Pinar Heggernes, Pim van ’t Hof, Daniel Lokshtanov et al. · SIAM Journal on Discrete Mathematics · 2013 · 50 citations · Full text

Engineering, Planar Graph, Network Analysis +16

Contracting Graphs to Paths and Trees

Pinar Heggernes, Pim van ’t Hof, Benjamin Lévêque et al. · Algorithmica · 2012 · 46 citations

Geometric Graph Theory, Network Science, Graph Theory +7

On graph contractions and induced minors

Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma et al. · Discrete Applied Mathematics · 2010 · 38 citations · Full text

Mathematical Programming, Graph Minor, Network Science +6