Edge-cuts leaving components of order at least three. - Paul S. Bonsma; Nicola Ueffing; Lutz Volkmann (Discret. Math., 2002)

A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. - Paul S. Bonsma; Tobias Brüggemann; Gerhard J. Woeginger (MFCS, 2003)

The Complexity of the Matching-cut Problem for Various Graph Classes. - Paul S. Bonsma (Electron. Notes Discret. Math., 2003)

Sparsest cuts and concurrent flows in product graphs. - Paul S. Bonsma (Discret. Appl. Math., 2004)

Complexity results on restricted instances of a paint shop problem for words. - Paul S. Bonsma; Thomas Epping; Winfried Hochstättler (Discret. Appl. Math., 2006)

Most balanced minimum cuts and partially ordered knapsack. - Paul S. Bonsma (CTW, 2007)

An FPT Algorithm for Directed Spanning k-Leaf - Paul S. Bonsma; Frederic Dorn (CoRR, 2007)

Linear time algorithms for finding sparsest cuts in various graph classes. - Paul S. Bonsma (Electron. Notes Discret. Math., 2007)

Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. - Paul S. Bonsma; Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Electron. Notes Discret. Math., 2007)

Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms. - Paul S. Bonsma; Florian Zickfeld (LATIN, 2008)

Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems - Paul S. Bonsma; Frederic Dorn (CoRR, 2008)

Finding Fullerene Patches in Polynomial Time I: Counting Hexagonal Patches - Paul S. Bonsma; Felix Breuer (CoRR, 2008)

Spanning Trees with Many Leaves in Graphs With Minimum Degree Three. - Paul S. Bonsma (SIAM J. Discret. Math., 2008)

Finding Fullerene Patches in Polynomial Time. - Paul S. Bonsma; Felix Breuer (ISAAC, 2009)

The complexity of the matching-cut problem for planar graphs and other graph classes. - Paul S. Bonsma (J. Graph Theory, 2009)

Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances. - Paul S. Bonsma; Luis Cereceda (Theor. Comput. Sci., 2009)

The Complexity Status of Problems Related to Sparsest Cuts. - Paul S. Bonsma; Hajo Broersma; Viresh Patel; Artem V. Pyatkin (IWOCA, 2010)

Shortest Path Reconfiguration is PSPACE-hard - Paul S. Bonsma (CoRR, 2010)

Most balanced minimum cuts. - Paul S. Bonsma (Discret. Appl. Math., 2010)

Feedback Vertex Set in Mixed Graphs. - Paul S. Bonsma; Daniel Lokshtanov (WADS, 2011)

A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. - Paul S. Bonsma; Florian Zickfeld (SIAM J. Discret. Math., 2011)

Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. - Paul S. Bonsma; Frederic Dorn (ACM Trans. Algorithms, 2011)

Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces. - Paul S. Bonsma (STACS, 2012)

Counting Hexagonal Patches and Independent Sets in Circle Graphs. - Paul S. Bonsma; Felix Breuer (Algorithmica, 2012)

Improved bounds for spanning trees with many leaves. - Paul S. Bonsma; Florian Zickfeld (Discret. Math., 2012)

Max-leaves spanning tree is APX-hard for cubic graphs. - Paul S. Bonsma (J. Discrete Algorithms, 2012)

The complexity of finding uniform sparsest cuts in various graph classes. - Paul S. Bonsma; Hajo Broersma; Viresh Patel; Artem V. Pyatkin (J. Discrete Algorithms, 2012)

Extremal graphs having no matching cuts. - Paul S. Bonsma; Arthur M. Farley; Andrzej Proskurowski (J. Graph Theory, 2012)

The Fine Details of Fast Dynamic Programming over Tree Decompositions. - Hans L. Bodlaender; Paul S. Bonsma; Daniel Lokshtanov (IPEC, 2013)

The complexity of rerouting shortest paths. - Paul S. Bonsma (Theor. Comput. Sci., 2013)

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. - Paul S. Bonsma; Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001 (IPEC, 2014)

Reconfiguring Independent Sets in Claw-Free Graphs. - Paul S. Bonsma; Marcin Kaminski 001; Marcin Wrochna (SWAT, 2014)

Independent Set Reconfiguration in Cographs. - Paul S. Bonsma (WG, 2014)

The Complexity of Bounded Length Graph Recoloring. - Paul S. Bonsma; Amer E. Mouawad (CoRR, 2014)

A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths. - Paul S. Bonsma; Jens Schulz; Andreas Wiese (SIAM J. Comput., 2014)

Independent Set Reconfiguration in Cographs and their Generalizations. - Paul S. Bonsma (J. Graph Theory, 2016)

A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves. - Roberto Solis-Oba; Paul S. Bonsma; Stefanie Lowski (Algorithmica, 2017)

Rerouting shortest paths in planar graphs. - Paul S. Bonsma (Discret. Appl. Math., 2017)

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. - Christoph Berkholz; Paul S. Bonsma; Martin Grohe (Theory Comput. Syst., 2017)

Using contracted solution graphs for solving reconfiguration problems. - Paul S. Bonsma; Daniël Paulusma (Acta Informatica, 2019)