( en | de | ru )

 

Disambiguation of "Bonsma, Paul S."

Author of the publication

copydeleteadd this publication to your clipboard
A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.

, , and . Algorithmica, 77 (2): 374-388 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

S Ulrich

S Bachmann

S Hilt

S Steinlechner

S Hüttelmaier

 

Other publications of authors with the same name

Counting Hexagonal Patches and Independent Sets in Circle Graphs., and . Algorithmica, 63 (3): 645-671 (2012)A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves., , and . Algorithmica, 77 (2): 374-388 (2017)Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms., and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 531-543. Springer, (2008)Independent Set Reconfiguration in Cographs.. WG, volume 8747 of Lecture Notes in Computer Science, page 105-116. Springer, (2014)Reconfiguring Independent Sets in Claw-Free Graphs., , and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 86-97. Springer, (2014)Feedback Vertex Set in Mixed Graphs., and . WADS, volume 6844 of Lecture Notes in Computer Science, page 122-133. Springer, (2011)The Complexity Status of Problems Related to Sparsest Cuts., , , and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 125-135. Springer, (2010)The Fine Details of Fast Dynamic Programming over Tree Decompositions., , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 41-53. Springer, (2013)Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances., and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 738-749. Springer, (2007)Most balanced minimum cuts.. Discret. Appl. Math., 158 (4): 261-276 (2010)