The following pages link to Laying Out Graphs Using Queues (Q4015976):
Displaying 20 items.
- Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
- Lazy Queue Layouts of Posets (Q5014104) (← links)
- On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- On Layered Fan-Planar Graph Drawings (Q5089175) (← links)
- Improved Bounds for Track Numbers of Planar Graphs (Q5119382) (← links)
- Two Results on Layered Pathwidth and Linear Layouts (Q5144880) (← links)
- Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
- (3,2)-Track Layout of Bipartite Graph Subdivisions (Q5302747) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Multilevel Planarity (Q5856666) (← links)
- Queue layouts of planar 3-trees (Q5915942) (← links)
- Queue layouts of planar 3-trees (Q5918924) (← links)
- The pagenumber of \(k\)-trees is \(O(k)\) (Q5931789) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- Stack and queue number of 2-trees (Q6085708) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover (Q6610085) (← links)
- Graph product structure for \(h\)-framed graphs (Q6671588) (← links)