The following pages link to Laying Out Graphs Using Queues (Q4015976):
Displaying 50 items.
- Outer 1-planar graphs (Q289919) (← links)
- Graph layouts via layered separators (Q473100) (← links)
- On the queue-number of graphs with bounded tree-width (Q521397) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Queue layouts of iterated line directed graphs (Q885285) (← links)
- Characterization of unlabeled level planar trees (Q924090) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- A new upper bound on the queuenumber of hypercubes (Q965977) (← links)
- A note on ``An improved upper bound on the queue number of the hypercube'' (Q975418) (← links)
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
- Planar lattices are lexicographically shellable (Q1198483) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- The queue-number of posets of bounded width or height (Q1725753) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- Processor-efficient sparse matrix-vector multiplication (Q1767967) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number (Q2150579) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- On the queue-number of partial orders (Q2151446) (← links)
- Linear layouts of complete graphs (Q2151449) (← links)
- On the queue number of planar graphs (Q2151450) (← links)
- The mixed page number of graphs (Q2167907) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Line and plane cover numbers revisited (Q2206873) (← links)
- Mixed linear layouts: complexity, heuristics, and experiments (Q2206878) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- The biplanar tree graph (Q2210302) (← links)
- An improved upper bound on the queue number of the hypercube (Q2379994) (← links)
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- Lazy queue layouts of posets (Q2701382) (← links)
- On the queue-number of the hypercube (Q2857380) (← links)
- Topological Graph Layouts into a Triangular Prism (Q2958107) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- Plane Drawings of Queue and Deque Graphs (Q3073660) (← links)
- Characterizations of Deque and Queue Graphs (Q3104763) (← links)
- (Q3138282) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Comparing Queues and Stacks As Machines for Laying Out Graphs (Q4018851) (← links)
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I (Q4268720) (← links)
- An approach to emulating separable graphs (Q4277376) (← links)
- Mixed Linear Layouts of Planar Graphs (Q4625112) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- Data Structures and their Planar Graph Layouts (Q4637665) (← links)
- The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
