Simultaneous Orthogonal Planarity
DOI10.1007/978-3-319-50106-2_41zbMath1478.68211arXiv1608.08427OpenAlexW2517461422MaRDI QIDQ2961544
Peter Eades, Ignaz Rutter, Steven Chaplick, Fabian Lipp, Giuseppe Di Battista, Sabine Cornelsen, Patrizio Angelini, Jan Kratochvíl, Philipp Kindermann, Giordano Da Lozzo
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/1608.08427
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- A new perspective on clustered planarity as a combinatorial embedding problem
- A better heuristic for orthogonal graph drawings
- Simultaneous embedding: edge orderings, relative positions, cutvertices
- On-line maintenance of triconnected components with SPQR-trees
- Advancements on SEFE and partitioned book embedding problems
- Disconnectivity and relative positions in simultaneous embeddings
- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Beyond Level Planarity
- Simultaneous Orthogonal Planarity
- Simultaneous Interval Graphs
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On-Line Planarity Testing
- Geometric RAC Simultaneous Drawings of Graphs
- Testing Simultaneous Planarity when the Common Graph is 2-Connected
- The complexity of satisfiability problems
- Simultaneous Geometric Graph Embeddings
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs