The following pages link to Stack and Queue Layouts of Posets (Q4377447):
Displaying 26 items.
- Graph layouts via layered separators (Q473100) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- A new upper bound on the queuenumber of hypercubes (Q965977) (← links)
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- The queue-number of posets of bounded width or height (Q1725753) (← links)
- Processor-efficient sparse matrix-vector multiplication (Q1767967) (← links)
- On the queue-number of partial orders (Q2151446) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Lazy queue layouts of posets (Q2701382) (← links)
- (Q3138282) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I (Q4268720) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- Lazy Queue Layouts of Posets (Q5014104) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs (Q5387755) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- A Sublinear Bound on the Page Number of Upward Planar Graphs (Q6057803) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- Stack and queue number of 2-trees (Q6085708) (← links)
- Queue layouts of two-dimensional posets (Q6117079) (← links)
- Troupes, cumulants, and stack-sorting (Q6161642) (← links)
- On families of planar DAGs with constant stack number (Q6560144) (← links)
