Atomic Embeddability, Clustered Planarity, and Thickenability

DOI10.1137/1.9781611975994.175OpenAlexW3001797861MaRDI QIDQ5146972

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Using the metro-map metaphor for drawing hypergraphs ⋮ Treetopes and their graphs ⋮ Embedding graphs into embedded graphs ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ Beyond Clustered Planar Graphs