Paul S. Bonsma
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j17 |      | Paul Bonsma, Felix Breuer: Counting Hexagonal Patches and Independent Sets in Circle Graphs. Algorithmica 63(3): 645-671 (2012) |
| j16 | | Paul Bonsma, Florian Zickfeld: Improved bounds for spanning trees with many leaves. Discrete Mathematics 312(6): 1178-1194 (2012) |
| j15 | | Paul Bonsma: Max-leaves spanning tree is APX-hard for cubic graphs. J. Discrete Algorithms 12: 14-23 (2012) |
| j14 | | Paul Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin: The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14: 136-149 (2012) |
| j13 | | Paul Bonsma, Arthur M. Farley, Andrzej Proskurowski: Extremal graphs having no matching cuts. Journal of Graph Theory 69(2): 206-222 (2012) |
| c15 | | |
| c14 | | |
| c13 | | Paul Bonsma: Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces. STACS 2012: 531-542 |
| i10 | | |
| 2011 | ||
| j12 | | Paul Bonsma, Florian Zickfeld: A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. SIAM J. Discrete Math. 25(4): 1652-1666 (2011) |
| j11 | | Paul Bonsma, Frederic Dorn: Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. ACM Transactions on Algorithms 7(4): 44 (2011) |
| c12 | | Paul Bonsma, Jens Schulz, Andreas Wiese: A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths. FOCS 2011: 47-56 |
| c11 | | |
| i9 | | Paul Bonsma, Jens Schulz, Andreas Wiese: A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths. CoRR abs/1102.3643 (2011) |
| i8 | | Paul Bonsma: Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces. CoRR abs/1109.4554 (2011) |
| 2010 | ||
| j10 | | |
| c10 | | Paul Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin: The Complexity Status of Problems Related to Sparsest Cuts. IWOCA 2010: 125-135 |
| c9 | | Paul S. Bonsma, Felix Breuer: Counting Hexagonal Patches and Independent Sets in Circle Graphs. LATIN 2010: 603-614 |
| i7 | | |
| i6 | | |
| 2009 | ||
| j9 | | Paul S. Bonsma: The complexity of the matching-cut problem for planar graphs and other graph classes. Journal of Graph Theory 62(2): 109-126 (2009) |
| j8 | | Paul S. Bonsma, Luis Cereceda: Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theor. Comput. Sci. 410(50): 5215-5226 (2009) |
| c8 | | |
| i5 | | Paul S. Bonsma, Felix Breuer: Finding Fullerene Patches in Polynomial Time. CoRR abs/0907.2627 (2009) |
| i4 | | |
| 2008 | ||
| j7 | | Paul S. Bonsma: Spanning Trees with Many Leaves in Graphs With Minimum Degree Three. SIAM J. Discrete Math. 22(3): 920-937 (2008) |
| c7 | | Paul S. Bonsma, Frederic Dorn: Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. ESA 2008: 222-233 |
| c6 | | Paul S. Bonsma, Florian Zickfeld: Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms. LATIN 2008: 531-543 |
| c5 | | Paul S. Bonsma, Florian Zickfeld: A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. WG 2008: 66-77 |
| i3 | | Paul S. Bonsma, Frederic Dorn: Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems. CoRR abs/0804.2032 (2008) |
| i2 | | Paul S. Bonsma, Felix Breuer: Finding Fullerene Patches in Polynomial Time I: Counting Hexagonal Patches. CoRR abs/0808.3881 (2008) |
| 2007 | ||
| j6 | | Paul S. Bonsma: Linear time algorithms for finding sparsest cuts in various graph classes. Electronic Notes in Discrete Mathematics 28: 265-272 (2007) |
| j5 | | 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) |
| c4 |  | |
| c3 | | Paul S. Bonsma, Luis Cereceda: Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. MFCS 2007: 738-749 |
| i1 | | Paul S. Bonsma, Frederic Dorn: An FPT Algorithm for Directed Spanning k-Leaf. CoRR abs/0711.4052 (2007) |
| 2006 | ||
| j4 | | 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 | ||
| j3 | | Paul S. Bonsma: Sparsest cuts and concurrent flows in product graphs. Discrete Applied Mathematics 136(2-3): 173-182 (2004) |
| 2003 | ||
| j2 | | Paul S. Bonsma: The Complexity of the Matching-cut Problem for Various Graph Classes. Electronic Notes in Discrete Mathematics 13: 18-21 (2003) |
| c2 | | Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger: A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. MFCS 2003: 259-268 |
| c1 | | Paul S. Bonsma: The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. WG 2003: 93-105 |
| 2002 | ||
| j1 | | Paul S. Bonsma, Nicola Ueffing, Lutz Volkmann: Edge-cuts leaving components of order at least three. Discrete Mathematics 256(1-2): 431-439 (2002) |
Colors in the list of coauthors
Last update Sun May 26 05:57:05 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page