Twins in Subdivision Drawings of Hypergraphs
From MaRDI portal
Publication:2961505
DOI10.1007/978-3-319-50106-2_6zbMath1483.68262arXiv1511.09389OpenAlexW2964090378MaRDI QIDQ2961505
Manuel Sorge, Christian Komusiewicz, Rolf Niedermeier, René van Bevern, Iyad A. Kanj
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.09389
Nonnumerical algorithms (68W05) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
The minimum feasible tileset problem ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width
Cites Work
- Unnamed Item
- Path-based supports for hypergraphs
- The clustering matroid and the optimal clustering tree
- Blocks of Hypergraphs
- On the Desirability of Acyclic Database Schemes
- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
- How to draw a hypergraph
- Subdivision Drawings of Hypergraphs
- An Almost Linear-Time Algorithm for Graph Realization
- Hypergraph planarity and the complexity of drawing venn diagrams
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
- Orthogonal Hypergraph Drawing for Improved Visibility
- Parameterized Algorithms
- Diagrammatic Representation and Inference
- How to Draw a Graph
- On Planar Supports for Hypergraphs
This page was built for publication: Twins in Subdivision Drawings of Hypergraphs
