Pim van ’t Hof
- On the Computational Complexity of Vertex Integrity and Component Order\n Connectivity
2014/03/25 by Pål Grønås Drange, Drange, Pål Grønås, Markus Sortland Dregi +3 · 7 citations
Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Optimization and Search Problems
- Contracting Graphs to Paths and Trees
2011/04/19 by Pinar Heggernes, Heggernes, Pinar, Pim van ’t Hof +7 · 1 citation
Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Obtaining Planarity by Contracting Few Edges
2012/04/23 by Petr A. Golovach, Golovach, Petr A., Pim van ’t Hof +3 · 1 citation
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Search Problems
- Editing to a Planar Graph of Given Degrees
2015/08/11 by Konrad K. Dabrowski, Petr A. Golovach, Dabrowski, Konrad K. +7 · 1 citation
Biochemistry, Genetics and Molecular Biology · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Protein Degradation and Inhibitors
- Hadwiger number of graphs with small chordality
2014/06/15 by Petr A. Golovach, Pinar Heggernes, Golovach, Petr A. +5 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Graph Labeling and Dimension Problems