 | 2009 |
|---|
| 18 |       | Paul S. Bonsma,
Felix Breuer:
Finding Fullerene Patches in Polynomial Time
CoRR abs/0907.2627: (2009) |
| 2008 |
|---|
| 17 | | Paul S. Bonsma,
Frederic Dorn:
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.
ESA 2008: 222-233 |
| 16 | | Paul S. Bonsma,
Florian Zickfeld:
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms.
LATIN 2008: 531-543 |
| 15 | | Paul S. Bonsma,
Florian Zickfeld:
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.
WG 2008: 66-77 |
| 14 | | Paul S. Bonsma,
Frederic Dorn:
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
CoRR abs/0804.2032: (2008) |
| 13 | | Paul S. Bonsma,
Felix Breuer:
Finding Fullerene Patches in Polynomial Time I: Counting Hexagonal Patches
CoRR abs/0808.3881: (2008) |
| 12 | | Paul S. Bonsma:
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three.
SIAM J. Discrete Math. 22(3): 920-937 (2008) |
| 2007 |
|---|
| 11 |  | Paul S. Bonsma:
Most balanced minimum cuts and partially ordered knapsack.
CTW 2007: 17-21 |
| 10 | | Paul S. Bonsma,
Luis Cereceda:
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances.
MFCS 2007: 738-749 |
| 9 | | Paul S. Bonsma,
Frederic Dorn:
An FPT Algorithm for Directed Spanning k-Leaf
CoRR abs/0711.4052: (2007) |
| 8 | | Paul S. Bonsma:
Linear time algorithms for finding sparsest cuts in various graph classes.
Electronic Notes in Discrete Mathematics 28: 265-272 (2007) |
| 7 | | Paul S. Bonsma,
Luis Cereceda,
Jan van den Heuvel,
Matthew Johnson:
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances.
Electronic Notes in Discrete Mathematics 29: 463-469 (2007) |
| 2006 |
|---|
| 6 | | Paul S. Bonsma,
Thomas Epping,
Winfried Hochstättler:
Complexity results on restricted instances of a paint shop problem for words.
Discrete Applied Mathematics 154(9): 1335-1343 (2006) |
| 2004 |
|---|
| 5 | | Paul S. Bonsma:
Sparsest cuts and concurrent flows in product graphs.
Discrete Applied Mathematics 136(2-3): 173-182 (2004) |
| 2003 |
|---|
| 4 | | Paul S. Bonsma,
Tobias Brüggemann,
Gerhard J. Woeginger:
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves.
MFCS 2003: 259-268 |
| 3 | | Paul S. Bonsma:
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.
WG 2003: 93-105 |
| 2 | | Paul S. Bonsma:
The Complexity of the Matching-cut Problem for Various Graph Classes.
Electronic Notes in Discrete Mathematics 13: 18-21 (2003) |
| 2002 |
|---|
| 1 | | Paul S. Bonsma,
Nicola Ueffing,
Lutz Volkmann:
Edge-cuts leaving components of order at least three.
Discrete Mathematics 256(1-2): 431-439 (2002) |
