Bonsma, Paul
- Reconfiguring Independent Sets in Claw-Free Graphs
2014/03/03 by Paul Bonsma, Marcin Kamiński, Bonsma, Paul +3 · 4 citations
Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- The Complexity of Rerouting Shortest Paths
2010/09/16 by Paul Bonsma, Bonsma, Paul · 2 citations
Computer Science · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Interconnection Networks and Systems #Optimization and Search Problems
- Max-Leaves Spanning Tree is APX-hard for Cubic Graphs
2009/12/01 by Paul Bonsma, Bonsma, Paul · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Advanced Graph Theory Research
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
2015/09/28 by Berkholz, Christoph, Bonsma, Paul, Grohe, Martin · 1 citation
#Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences