28 citations · 62 across the 18 of their papers we have counts for
3 papers · 1 filter
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
Parinya Chalermsook, Matthias Kaul, Matthias Mnich +3
The fundamental sparsest cut problem takes as input a graph together with the edge costs and demands, and seeks a cut that minimizes the ratio between the costs and demands acr…
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
Oksana Firman, Joachim Spoerhase
We propose a new representation of -partite, -uniform hypergraphs, that is, a hypergraph with a partition of vertices into parts such that each hyperedge contains exactly…
Consistent Simplification of Polyline Tree Bundles
Yannick Bosch, Peter Schäfer, Joachim Spoerhase +2
The Polyline Bundle Simplification (PBS) problem is a generalization of the classical polyline simplification problem. Given a set of polylines, which may share line segments and p…