On Planar Supports for Hypergraphs
From MaRDI portal
Publication:5891343
DOI10.7155/jgaa.00237zbMath1276.05081OpenAlexW2139461597WikidataQ59782302 ScholiaQ59782302MaRDI QIDQ5891343
Kevin Verbeek, Bettina Speckmann, Kevin Buchin, Henk G. Meijer, Marc J. van Kreveld
Publication date: 28 November 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00237
Related Items
Solving problems on generalized convex graphs via mim-width ⋮ Twins in Subdivision Drawings of Hypergraphs ⋮ Block Crossings in Storyline Visualizations ⋮ Colored spanning graphs for set visualization ⋮ Representing graphs and hypergraphs by touching polygons in 3D ⋮ Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem ⋮ The Painter’s Problem: Covering a Grid with Colored Connected Polygons ⋮ Short plane supports for spatial hypergraphs ⋮ Blocks of Hypergraphs ⋮ The minimum feasible tileset problem ⋮ Solving problems on generalized convex graphs via mim-width ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Short Plane Supports for Spatial Hypergraphs
This page was built for publication: On Planar Supports for Hypergraphs
