Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams

Klemz, Boris, Mchedlidze, Tamara, Martin Nöllenburg
January 2014
Cite DOI
Type
Conference Paper
Martin Nöllenburg
Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.