scientific article; zbMATH DE number 1377359
From MaRDI portal
Publication:4702944
Recommendations
- Level Planar Embedding in Linear Time
- Radial Level Planarity Testing and Embedding in Linear Time
- Graph Drawing
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Testing Full Outer-2-planarity in Linear Time
- A linear-time algorithm for testing outer-1-planarity
- A linear-time algorithm for testing outer-1-planarity
- Practical Level Planarity Testing and Layout with Embedding Constraints
- Cyclic Level Planarity Testing and Embedding
- A linear-time algorithm for testing full outer-2-planarity
Cited in
(18)- Crossing-constrained hierarchical drawings
- Testing Full Outer-2-planarity in Linear Time
- A satisfiability-based approach for embedding generalized tanglegrams on level graphs
- A direct linear-time planarity test for unflippable modules
- Level Planar Embedding in Linear Time
- Fully-dynamic planarity testing in polylogarithmic time
- Multilevel planarity
- Weakly leveled planarity with bounded span
- Constrained level planarity is FPT with respect to the vertex cover number
- Constrained and ordered level planarity parameterized by the number of levels
- Level planarity is more difficult than we thought (poster abstract)
- From planar via outerplanar to outerpath -- engineering NP-hardness constructions (poster abstract)
- Partial and constrained level planarity
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
- Constrained planarity in practice -- engineering the synchronized planarity algorithm
- Segment intersection representations, level planarity and constrained ordering problems
- Linear layouts revisited: stacks, queues, and exact algorithms
- Improving the running time of embedded upward planarity testing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702944)
