The following pages link to Paul Bonsma (Q392172):
Displaying 45 items.
- The complexity of rerouting shortest paths (Q392173) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- Sparsest cuts and concurrent flows in product graphs. (Q1427176) (← links)
- Edge-cuts leaving components of order at least three (Q1849951) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- Counting hexagonal patches and independent sets in circle graphs (Q2429365) (← links)
- Complexity results on restricted instances of a paint shop problem for words (Q2492209) (← links)
- Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (Q2849306) (← links)
- The Fine Details of Fast Dynamic Programming over Tree Decompositions (Q2867071) (← links)
- (Q2904791) (← links)
- The Complexity of Rerouting Shortest Paths (Q2912722) (← links)
- Independent Set Reconfiguration in Cographs (Q2945182) (← links)
- The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration (Q2946012) (← links)
- (Q2957511) (← links)
- The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) (← links)
- Extremal graphs having no matching cuts (Q3113291) (← links)
- Reconfiguring Independent Sets in Claw-Free Graphs (Q3188884) (← links)
- Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree (Q3189028) (← links)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q3225144) (← links)
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three (Q3393426) (← links)
- Linear time algorithms for finding sparsest cuts in various graph classes (Q3439593) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)
- Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances (Q3525616) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- Counting Hexagonal Patches and Independent Sets in Circle Graphs (Q3557053) (← links)
- (Q3576676) (← links)
- Finding Fullerene Patches in Polynomial Time (Q3652261) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- Using contracted solution graphs for solving reconfiguration problems. (Q4608579) (← links)
- Feedback Vertex Set in Mixed Graphs (Q5199236) (← links)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431312) (← links)
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557) (← links)
- A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths (Q5494938) (← links)
- A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths (Q5494961) (← links)
- (Q5708527) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902513) (← links)
