Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Paul Bonsma
Observed names:
Bonsma, Paul,
P. Bonsma,
Paul S. Bonsma,
Paul Simon Bonsma
Observed institutions:
Saxion,
Humboldt-Universität zu Berlin,
Technische Universität Berlin,
University of Twente
OpenAlex ID:
A5079322669
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances
2009
·
Paul Bonsma
, Luis Cereceda
·
Theoretical Computer Science
·
174
PDF
Edge-cuts leaving components of order at least three
2002
·
Paul Bonsma
, Nicola Ueffing
, et al.
·
Discrete Mathematics
·
78
PDF
Reconfiguring Independent Sets in Claw-Free Graphs
2014
·
Paul Bonsma
, Marcin Kamiński
, et al.
·
Lecture notes in computer science
·
55
PDF
The complexity of rerouting shortest paths
2013
·
Paul Bonsma
·
Theoretical Computer Science
·
55
PDF
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
2011
·
Paul Bonsma
, Jens Schulz
, et al.
·
Annual Symposium on Foundations of Computer Science
·
45
The complexity of the matching‐cut problem for planar graphs and other graph classes
2009
·
Paul Bonsma
·
Journal of Graph Theory
·
44
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
2016
·
Christoph Berkholz
, Paul Bonsma
, et al.
·
Theory of Computing Systems
·
43
PDF
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves
2003
·
Paul S. Bonsma
, Tobias Brueggemann
, et al.
·
Lecture notes in computer science
·
43
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration
2014
·
Paul Bonsma
, Amer E. Mouawad
, et al.
·
Lecture notes in computer science
·
39
A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
2014
·
Paul Bonsma
, Jens Schulz
, et al.
·
SIAM Journal on Computing
·
34
Independent Set Reconfiguration in Cographs and their Generalizations
2015
·
Paul Bonsma
·
Journal of Graph Theory
·
29
The Complexity of Rerouting Shortest Paths
2012
·
Paul Bonsma
·
Lecture notes in computer science
·
29
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
2008
·
Paul Bonsma
, Florian Zickfeld
·
Springer eBooks
·
28
PDF
Rerouting shortest paths in planar graphs
2016
·
Paul Bonsma
·
Discrete Applied Mathematics
·
27
PDF
Complexity results on restricted instances of a paint shop problem for words
2006
·
P. Bonsma
, Th. Epping
, et al.
·
Discrete Applied Mathematics
·
27
PDF
The Fine Details of Fast Dynamic Programming over Tree Decompositions
2013
·
Hans L. Bodlaender
, Paul Bonsma
, et al.
·
Lecture notes in computer science
·
24
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
2008
·
Paul S. Bonsma
·
SIAM Journal on Discrete Mathematics
·
21
Max-leaves spanning tree is APX-hard for cubic graphs
2011
·
Paul Bonsma
·
Journal of Discrete Algorithms
·
20
PDF
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
2013
·
Christoph Berkholz
, Paul Bonsma
, et al.
·
Lecture notes in computer science
·
19
Independent Set Reconfiguration in Cographs
2014
·
Paul Bonsma
·
Lecture notes in computer science
·
15
Most balanced minimum cuts
2009
·
Paul Bonsma
·
Discrete Applied Mathematics
·
15
Feedback Vertex Set in Mixed Graphs
2011
·
Paul Bonsma
, Daniel Lokshtanov
·
Lecture notes in computer science
·
14
Sparse cuts, matching-cuts and leafy trees in graphs
2006
·
Paul S. Bonsma
·
14
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
2007
·
Paul Bonsma
, Luis Cereceda
, et al.
·
Electronic Notes in Discrete Mathematics
·
13
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
2008
·
Paul Bonsma
, Florian Zickfeld
·
Lecture notes in computer science
·
12
Show more works
View as search
Works count:
69
Citation count:
1,088
H-index:
19
I10-index:
30
Year
Topic
Type
