Parameterized complexity of simultaneous planarity

DOI10.1007/978-3-031-49275-4_6MaRDI QIDQ6618252zbMATH OpenFDO

Authors Simon D. Fink, Ignaz Rutter

Publication date 14 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49275-4_6

zbMATH Keywords

parameterized complexitySEFEsimultaneous planarity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 7740898 (Why is no real title available?)
• Advancements on SEFE and partitioned book embedding problems
• Atomic embeddability, clustered planarity, and thickenability
• Disconnectivity and relative positions in simultaneous embeddings
• Improved upper bounds for vertex cover
• Intersection Graphs in Simultaneous Embedding with Fixed Edges
• On the complexity of the storyplan problem
• On-line maintenance of triconnected components with SPQR-trees
• Parameterized algorithms for book embedding problems
• Simultaneous Embedding
• Simultaneous Embedding of Planar Graphs with Few Bends
• Simultaneous Graph Embeddings with Fixed Edges
• Synchronized planarity with applications to constrained planarity problems
• Total Ordering Problem
• Toward a theory of planarity: Hanani-Tutte and planarity variants

Cited in

(1)

• On the complexity of simultaneous geometric embedding for edge-disjoint graphs

This page was built for publication: Parameterized complexity of simultaneous planarity

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