Paul S. Bonsma - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2019

Using contracted solution graphs for solving reconfiguration problemsPaul S. Bonsma, Daniël Paulusma. ACTA, 56(7-8):619-648, 2019. [doi]

2017

Tight Lower and Upper Bounds for the Complexity of Canonical Colour RefinementChristoph Berkholz, Paul S. Bonsma, Martin Grohe. mst, 60(4):581-614, 2017. [doi]

Rerouting shortest paths in planar graphsPaul S. Bonsma. DAM, 231:95-112, 2017. [doi]

2010

Most balanced minimum cutsPaul S. Bonsma. DAM, 158(4):261-276, 2010. [doi]

Counting Hexagonal Patches and Independent Sets in Circle GraphsPaul S. Bonsma, Felix Breuer. latin 2010: 603-614 [doi]

2009

Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distancesPaul S. Bonsma, Luis Cereceda. TCS, 410(50):5215-5226, 2009. [doi]

Finding Fullerene Patches in Polynomial TimePaul S. Bonsma, Felix Breuer. isaac 2009: 750-759 [doi]

The complexity of the matching-cut problem for planar graphs and other graph classesPaul S. Bonsma. jgt, 62(2):109-126, 2009. [doi]

2008

Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning TreePaul S. Bonsma, Frederic Dorn. esa 2008: 222-233 [doi]

Spanning Trees with Many Leaves in Graphs without Diamonds and BlossomsPaul S. Bonsma, Florian Zickfeld. latin 2008: 531-543 [doi]

A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic GraphsPaul S. Bonsma, Florian Zickfeld. criwg 2008: 66-77 [doi]

Spanning Trees with Many Leaves in Graphs With Minimum Degree ThreePaul S. Bonsma. siamdm, 22(3):920-937, 2008. [doi]

2007

Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial DistancesPaul S. Bonsma, Luis Cereceda. mfcs 2007: 738-749 [doi]

Most balanced minimum cuts and partially ordered knapsackPaul S. Bonsma. colognetwente 2007: 17-21

Linear time algorithms for finding sparsest cuts in various graph classesPaul S. Bonsma. endm, 28:265-272, 2007. [doi]

Finding Paths between Graph Colourings: Computational Complexity and Possible DistancesPaul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson. endm, 29:463-469, 2007. [doi]

2006

Complexity results on restricted instances of a paint shop problem for wordsPaul S. Bonsma, Thomas Epping, Winfried Hochstättler. DAM, 154(9):1335-1343, 2006. [doi]

2004

Sparsest cuts and concurrent flows in product graphsPaul S. Bonsma. DAM, 136(2-3):173-182, 2004. [doi]

2003

The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph ClassesPaul S. Bonsma. criwg 2003: 93-105 [doi]

The Complexity of the Matching-cut Problem for Various Graph ClassesPaul S. Bonsma. endm, 13:18-21, 2003. [doi]

A Faster FPT Algorithm for Finding Spanning Trees with Many LeavesPaul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger. mfcs 2003: 259-268 [doi]

2002

Edge-cuts leaving components of order at least threePaul S. Bonsma, Nicola Ueffing, Lutz Volkmann. DM, 256(1-2):431-439, 2002. [doi]

Sign in or sign up to see more results.

runs on WebDSL