Constrained and ordered level planarity parameterized by the number of levels
From MaRDI portal
Cites work
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Constrained and ordered level planarity parameterized by the number of levels
- Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
- Hanani-Tutte, monotone drawings, and level-planarity
- Hierarchies and planarity theory
- scientific article; zbMATH DE number 1377359 (Why is no real title available?)
- scientific article; zbMATH DE number 7765366 (Why is no real title available?)
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- On the computational complexity of upward and rectilinear planarity testing
- On the parameterized complexity of layered graph drawing
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- On the space and circuit complexity of parameterized problems: classes and completeness
- Ordered level planarity and its relationship to geodesic planarity, bi-monotonicity, and variations of level planarity
- Parameterized algorithms
- Parameterized problems complete for nondeterministic FPT time and logarithmic space
- Partial and Constrained Level Planarity
- Radial Level Planarity Testing and Embedding in Linear Time
- SOFSEM 2004: Theory and Practice of Computer Science
- The importance of being proper
- XNLP-completeness for parameterized problems on graphs with a linear structure
Cited in
(3)
This page was built for publication: Constrained and ordered level planarity parameterized by the number of levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895886)
