Structural parameterizations of simultaneous planarity
From MaRDI portal
Cites work
- A constructive proof of Vizing's theorem
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Advancements on SEFE and partitioned book embedding problems
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Constrained planarity in practice -- engineering the synchronized planarity algorithm
- Crossing-optimal extension of simple drawings
- Digraph coloring and distance to acyclicity
- Disconnectivity and relative positions in simultaneous embeddings
- Edge-editing to a dense and a sparse graph class
- Empirical evaluation of aesthetics-based graph layout
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Extending orthogonal planar graph drawings is fixed-parameter tractable
- Extending partial 1-planar drawings
- Extending partial orthogonal drawings
- Extending partial representations of circle graphs
- Extending partial representations of circle graphs in near-linear time
- Extending partial representations of circular-arc graphs
- Extending partial representations of function graphs and permutation graphs
- Extending partial representations of interval graphs
- Extending partial representations of proper and unit interval graphs
- Fine-grained meta-theorems for vertex integrity
- Graph minors. III. Planar tree-width
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- scientific article; zbMATH DE number 3195968 (Why is no real title available?)
- scientific article; zbMATH DE number 7691271 (Why is no real title available?)
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- Minimal obstructions for partial representations of interval graphs
- On an estimate of the chromatic class of a \(p\)-graph
- On the Relationship Between Clique-Width and Treewidth
- Parameterized algorithms
- Parameterized aspects of triangle enumeration
- Parameterized complexity of simultaneous planarity
- Partial and simultaneous transitive orientations via modular decompositions
- Simultaneous Embedding
- Simultaneous Embedding of Planar Graphs with Few Bends
- Simultaneous embedding: edge orderings, relative positions, cutvertices
- Simultaneous embedding: edge orderings, relative positions, cutvertices
- Simultaneous Graph Embeddings with Fixed Edges
- Simultaneous interval graphs
- Simultaneous orthogonal planarity
- Simultaneous representation of interval graphs in the sunflower case
- Simultaneous representation of proper and unit interval graphs
- Simultaneous representation of proper and unit interval graphs
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
- Synchronized Planarity with Applications to Constrained Planarity Problems
- Testing Planarity of Partially Embedded Graphs
- Testing simultaneous planarity when the common graph is 2-connected
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- The parameterized complexity of extending stack layouts
- The simultaneous representation problem for chordal, comparability and permutation graphs
- Toward a theory of planarity: Hanani-Tutte and planarity variants
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
This page was built for publication: Structural parameterizations of simultaneous planarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364365)
