Atomic embeddability, clustered planarity, and thickenability

DOI10.1137/1.9781611975994.175OpenAlexW3001797861MaRDI QIDQ5146972FDOQ5146972

Authors: Radoslav Fulek, Csaba D. Tóth 

Publication date: 2 February 2021

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

Full work available at URL: https://arxiv.org/abs/1907.13086

Recommendations

• Advances on testing C-planarity of embedded flat clustered graphs
• Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
• A new perspective on clustered planarity as a combinatorial embedding problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (11)

• Using the metro-map metaphor for drawing hypergraphs
• Orthogonal planarity testing of bounded treewidth graphs
• Treetopes and their graphs
• Beyond Clustered Planar Graphs
• The role of twins in computing planar supports of hypergraphs
• Parameterized complexity of simultaneous planarity
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Atomic Embeddability, Clustered Planarity, and Thickenability
• A note on obstructions to clustered planarity
• Embedding graphs into embedded graphs
• On the upward book thickness problem: combinatorial and complexity results

This page was built for publication: Atomic embeddability, clustered planarity, and thickenability

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