Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams

Klemz, Boris, Mchedlidze, Tamara, Martin Nöllenburg
January 2014
bib DOI

Abstract

Full Citation:

Klemz, Boris, Mchedlidze, Tamara, Nöllenburg, Martin. Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. Algorithm Theory (SWAT'14) (Ravi, R. and Gørtz, I. L.), volume 8503 of LNCS, pages 253-264, 2014, Springer International Publishing.

Type
Conference Paper
Martin Nöllenburg
Martin Nöllenburg

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