Recommendations
Cited in
(29)- Volume requirements of 3D upward drawings
- The queue-number of posets of bounded width or height
- Processor-efficient sparse matrix-vector multiplication
- Stack-number is not bounded by queue-number
- On the queue-number of partial orders
- Computing upward topological book embeddings of upward planar digraphs
- Lazy queue layouts of posets
- scientific article; zbMATH DE number 431507 (Why is no real title available?)
- On the page number of upward planar directed acyclic graphs
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Upward partitioned book embeddings
- Graph layouts via layered separators
- Lazy Queue Layouts of Posets
- Upward book embeddings of st-graphs
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- On the upward book thickness problem: combinatorial and complexity results
- On the upward book thickness problem: combinatorial and complexity results
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Stack and queue number of 2-trees
- Queue layouts of two-dimensional posets
- Troupes, cumulants, and stack-sorting
- On families of planar DAGs with constant stack number
- Characterisations and examples of graph classes with bounded expansion
- Directed acyclic outerplanar graphs have constant stack number
- Ordered sets, pagenumbers and planarity
- A new upper bound on the queuenumber of hypercubes
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
This page was built for publication: Stack and Queue Layouts of Posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377447)
