The peculiarities of extending queue layouts

DOI10.1007/978-3-032-11835-6_13MaRDI QIDQ7294429zbMATH OpenFDO

Authors Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-11835-6_13

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Crossing-optimal extension of simple drawings
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Extending orthogonal planar graph drawings is fixed-parameter tractable
• Extending partial 1-planar drawings
• scientific article; zbMATH DE number 4051024 (Why is no real title available?)
• scientific article; zbMATH DE number 2159644 (Why is no real title available?)
• scientific article; zbMATH DE number 7559402 (Why is no real title available?)
• Laying Out Graphs Using Queues
• On list coloring and list homomorphism of permutation and interval graphs
• On the queue-number of graphs with bounded tree-width
• On the upward book thickness problem: combinatorial and complexity results
• On the upward book thickness problem: combinatorial and complexity results
• Parameterized algorithms
• Parameterized algorithms for queue layouts
• Parameterized Algorithms for Queue Layouts
• Partially ordered sets.
• Planar graphs have bounded queue-number
• Planar graphs of bounded degree have bounded queue number
• Stack-number is not bounded by queue-number
• Testing Planarity of Partially Embedded Graphs
• The parameterized complexity of extending stack layouts

This page was built for publication: The peculiarities of extending queue layouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294429)