Parameterized Algorithms for Queue Layouts
From MaRDI portal
Publication:5050001
DOI10.7155/jgaa.00597zbMath1498.05257OpenAlexW3074600355MaRDI QIDQ5050001
Sujoy Bhore, Martin Nöllenburg, Fabrizio Montecchiani, Robert Ganian
Publication date: 14 November 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00597
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Sparsity. Graphs, structures, and algorithms
- Graph layouts via layered separators
- On the queue-number of graphs with bounded tree-width
- Improved upper bounds for vertex cover
- On the parameterized complexity of layered graph drawing
- Embedding planar graphs in four pages
- Track layouts, layered path decompositions, and leveled planarity
- The complexity landscape of decompositional parameters for ILP
- Orthogonal planarity testing of bounded treewidth graphs
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
- Exact crossing number parameterized by vertex cover
- Mixed linear layouts: complexity, heuristics, and experiments
- Computing straight-line 3D grid drawings of graphs in linear volume
- Layered separators in minor-closed graph classes with applications
- The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Parameterized Complexity of 1-Planarity
- Mixed Linear Layouts of Planar Graphs
- Parameterized Algorithms for Queue Layouts
- Lazy Queue Layouts of Posets
- On Mixed Linear Layouts of Series-Parallel Graphs
- Parameterized Algorithms for Book Embedding Problems
- A Faster Parameterized Algorithm for Treedepth
- Planar Graphs of Bounded Degree Have Bounded Queue Number
- Layout of Graphs with Bounded Tree-Width
- On the Queue Number of Planar Graphs
- Parameterized Algorithms
- Sorting Using Networks of Queues and Stacks
- On the upward book thickness problem: combinatorial and complexity results
This page was built for publication: Parameterized Algorithms for Queue Layouts
