Linear layouts of bipartite planar graphs
From MaRDI portal
Publication:6179431
DOI10.1007/978-3-031-38906-1_29arXiv2305.16087OpenAlexW4385317383MaRDI QIDQ6179431
No author found.
Publication date: 16 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.16087
Cites Work
- Unnamed Item
- Unnamed Item
- On the queue-number of graphs with bounded tree-width
- Embedding planar graphs in four pages
- The book thickness of a graph
- Track layouts, layered path decompositions, and leveled planarity
- On mixed linear layouts of series-parallel graphs
- Stack-number is not bounded by queue-number
- An improved planar graph product structure theorem
- Planar graphs that need four pages
- Mixed linear layouts: complexity, heuristics, and experiments
- The book thickness of 1-planar graphs is constant
- A fast algorithm for the product structure of planar graphs
- An improved upper bound on the queue number of planar graphs
- Stack and Queue Layouts via Layered Separators
- Characterizations of Deque and Queue Graphs
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Bounds For Orthogonal 3-D Graph Drawing
- Mixed Linear Layouts of Planar Graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- The Local Queue Number of Graphs with Bounded Treewidth
- Lazy Queue Layouts of Posets
- Parameterized Algorithms for Queue Layouts
- Improved Bounds for Track Numbers of Planar Graphs
- Four pages are indeed necessary for planar graphs
- Planar Graphs Have Bounded Queue-Number
- Graph Drawing
- Planar Graphs of Bounded Degree Have Bounded Queue Number
- Layout of Graphs with Bounded Tree-Width
- On the Queue Number of Planar Graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Queue layouts of planar 3-trees
This page was built for publication: Linear layouts of bipartite planar graphs
