Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams

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

Abstract

Full Citation:

Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg. Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. Algorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), 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.