Pages that link to "Item:Q4018851"
From MaRDI portal
The following pages link to Comparing Queues and Stacks As Machines for Laying Out Graphs (Q4018851):
Displaying 50 items.
- 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)
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties (Q886670) (← 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)
- The queue-number of posets of bounded width or height (Q1725753) (← links)
- Processor-efficient sparse matrix-vector multiplication (Q1767967) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- On off-diagonal ordered Ramsey numbers of nested matchings (Q2099468) (← links)
- On dispersability of some products of cycles (Q2116698) (← 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)
- Mixed linear layouts: complexity, heuristics, and experiments (Q2206878) (← links)
- The biplanar tree graph (Q2210302) (← links)
- Book embedding of complex network with community structure (Q2279645) (← 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)
- A fast algorithm for the product structure of planar graphs (Q2663717) (← links)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Lazy queue layouts of posets (Q2701382) (← links)
- (Q2857380) (← links)
- Topological Graph Layouts into a Triangular Prism (Q2958107) (← links)
- Characterizations of Deque and Queue Graphs (Q3104763) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
- Layouts of Expander Graphs (Q3466402) (← 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)
- 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)
- Upward Book Embeddings of st-Graphs (Q5088940) (← 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)
- On dispersable book embeddings (Q5915585) (← links)
- Queue layouts of planar 3-trees (Q5915942) (← links)
