The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paul S. Bonsma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger
    A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:259-268 [Conf]
  2. Paul S. Bonsma
    The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:93-105 [Conf]
  3. Paul S. Bonsma
    Sparsest cuts and concurrent flows in product graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:173-182 [Journal]
  4. Paul S. Bonsma, Thomas Epping, Winfried Hochstättler
    Complexity results on restricted instances of a paint shop problem for words. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:9, pp:1335-1343 [Journal]
  5. Paul S. Bonsma, Nicola Ueffing, Lutz Volkmann
    Edge-cuts leaving components of order at least three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:431-439 [Journal]
  6. Paul S. Bonsma, Luis Cereceda
    Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:738-749 [Conf]

  7. Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. [Citation Graph (, )][DBLP]


  8. Finding Fullerene Patches in Polynomial Time. [Citation Graph (, )][DBLP]


  9. Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms. [Citation Graph (, )][DBLP]


  10. Counting Hexagonal Patches and Independent Sets in Circle Graphs. [Citation Graph (, )][DBLP]


  11. A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. [Citation Graph (, )][DBLP]


  12. Most balanced minimum cuts and partially ordered knapsack. [Citation Graph (, )][DBLP]


  13. An FPT Algorithm for Directed Spanning k-Leaf [Citation Graph (, )][DBLP]


  14. Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems [Citation Graph (, )][DBLP]


  15. Finding Fullerene Patches in Polynomial Time I: Counting Hexagonal Patches [Citation Graph (, )][DBLP]


  16. Finding Fullerene Patches in Polynomial Time [Citation Graph (, )][DBLP]


  17. Max-Leaves Spanning Tree is APX-hard for Cubic Graphs [Citation Graph (, )][DBLP]


  18. Most balanced minimum cuts. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002