Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances P Bonsma, L Cereceda Theoretical Computer Science 410 (50), 5215-5226, 2009 | 149 | 2009 |

2-approximation algorithm for finding a spanning tree with maximum number of leaves R Solis-Oba European Symposium on Algorithms, 441-452, 1998 | 140 | 1998 |

Edge-cuts leaving components of order at least three P Bonsma, N Ueffing, L Volkmann Discrete Mathematics 256 (1-2), 431-439, 2002 | 108 | 2002 |

A constant-factor approximation algorithm for unsplittable flow on paths P Bonsma, J Schulz, A Wiese SIAM journal on computing 43 (2), 767-799, 2014 | 78 | 2014 |

The complexity of rerouting shortest paths P Bonsma Theoretical computer science 510, 1-12, 2013 | 69 | 2013 |

A faster FPT algorithm for finding spanning trees with many leaves PS Bonsma, T Brueggemann, GJ Woeginger International Symposium on Mathematical Foundations of Computer Science, 259-268, 2003 | 62 | 2003 |

A faster FPT algorithm for finding spanning trees with many leaves PS Bonsma, T Brueggemann, GJ Woeginger International Symposium on Mathematical Foundations of Computer Science, 259-268, 2003 | 62 | 2003 |

Reconfiguring independent sets in claw-free graphs P Bonsma, M Kamiński, M Wrochna Scandinavian Workshop on Algorithm Theory, 86-97, 2014 | 55 | 2014 |

Tight lower and upper bounds for the complexity of canonical colour refinement C Berkholz, P Bonsma, M Grohe Theory of Computing Systems 60 (4), 581-614, 2017 | 45 | 2017 |

The complexity of bounded length graph recoloring and CSP reconfiguration P Bonsma, AE Mouawad, N Nishimura, V Raman International Symposium on Parameterized and Exact Computation, 110-121, 2014 | 43 | 2014 |

Spanning trees with many leaves in graphs without diamonds and blossoms P Bonsma, F Zickfeld Latin American Symposium on Theoretical Informatics, 531-543, 2008 | 38 | 2008 |

The complexity of the matching‐cut problem for planar graphs and other graph classes P Bonsma Journal of graph theory 62 (2), 109-126, 2009 | 32* | 2009 |

Tight bounds and a fast FPT algorithm for Directed Max-Leaf Spanning Tree P Bonsma, F Dorn European Symposium on Algorithms, 222-233, 2008 | 29 | 2008 |

Complexity results on restricted instances of a paint shop problem for words P Bonsma, T Epping, W Hochstättler Discrete Applied Mathematics 154 (9), 1335-1343, 2006 | 29 | 2006 |

A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs P Bonsma, F Zickfeld SIAM Journal on Discrete Mathematics 25 (4), 1652-1666, 2011 | 27 | 2011 |

Independent set reconfiguration in cographs P Bonsma International Workshop on Graph-Theoretic Concepts in Computer Science, 105-116, 2014 | 23 | 2014 |

Rerouting shortest paths in planar graphs P Bonsma arXiv preprint arXiv:1204.5613, 2012 | 21 | 2012 |

The fine details of fast dynamic programming over tree decompositions HL Bodlaender, P Bonsma, D Lokshtanov International Symposium on Parameterized and Exact Computation, 41-53, 2013 | 20 | 2013 |

Spanning trees with many leaves in graphs with minimum degree three PS Bonsma SIAM journal on discrete mathematics 22 (3), 920-937, 2008 | 20 | 2008 |

Max-leaves spanning tree is APX-hard for cubic graphs P Bonsma Journal of Discrete Algorithms 12, 14-23, 2012 | 17 | 2012 |