16 citations · 52 across the 11 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.DM2008★ 1 cited
Counting Hexagonal Patches and Independent Sets in Circle Graphs
Paul Bonsma, Felix Breuer
A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices have degree 3, and boundary vertices have degree 2 or 3. We consider the following counting pr…
cs.DS2008★ 3 cited
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
Paul Bonsma, Frederic Dorn
An out-tree of a directed graph is a rooted tree subgraph with all arcs directed outwards from the root. An out-branching is a spanning out-tree. By and we…