16 citations · 52 across the 11 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DM2011
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
Paul Bonsma
The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of thi…
cs.DS2011
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
Paul Bonsma, Jens Schulz, Andreas Wiese
In the unsplittable flow problem on a path, we are given a capacitated path and tasks, each task having a demand, a profit, and start and end vertices. The goal is to compu…