Simultaneous PQ-ordering with applications to constrained embedding problems

DOI10.1137/1.9781611973105.74MaRDI QIDQ5741782zbMATH OpenOpenAlexFDO

Authors Thomas Bläsius, Ignaz Rutter

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.74

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Simultaneous PQ-ordering with applications to constrained embedding problems
• An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

Cited in

(11)

• Advancements on SEFE and partitioned book embedding problems
• Extending partial representations of subclasses of chordal graphs
• Disconnectivity and relative positions in simultaneous embeddings
• The importance of being proper
• Minimal obstructions for partial representations of interval graphs
• Simultaneous visibility representations of plane st-graphs using L-shapes
• Simultaneous PQ-ordering with applications to constrained embedding problems
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Drawing Simultaneously Embedded Graphs with Few Bends
• Synchronized planarity with applications to constrained planarity problems
• A new perspective on clustered planarity as a combinatorial embedding problem

This page was built for publication: Simultaneous PQ-ordering with applications to constrained embedding problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741782)