Parameterized complexity of simultaneous planarity

DOI10.1007/978-3-031-49275-4_6MaRDI QIDQ6618252

Simon D. Fink, Ignaz Rutter, [[Person:6075932|Author name not available (Why is that?)]]

Publication date: 14 October 2024

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved upper bounds for vertex cover
• 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
• Toward a theory of planarity: Hanani-Tutte and planarity variants
• Intersection Graphs in Simultaneous Embedding with Fixed Edges
• Simultaneous Graph Embeddings with Fixed Edges
• Total Ordering Problem
• Simultaneous Embedding
• Parameterized Algorithms for Book Embedding Problems
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Simultaneous Embedding of Planar Graphs with Few Bends
• On the complexity of the storyplan problem

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)