Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
From MaRDI portal
Publication:6610085
DOI10.1142/S0129054123410022zbMATH Open1547.05204MaRDI QIDQ6610085
Yixuan Li, Yunlong Liu, Jingui Huang
Publication date: 24 September 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved upper bounds for vertex cover
- The book thickness of a graph
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
- Exact crossing number parameterized by vertex cover
- Mixed linear layouts: complexity, heuristics, and experiments
- Parameterized algorithms for fixed-order book drawing with bounded number of crossings per edge
- Graph Layout Problems Parameterized by Vertex Cover
- 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
- Experimental Evaluation of Book Drawing Algorithms
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Parameterized Algorithms for Queue Layouts
- Upward Book Embeddings of st-Graphs
- Parameterized Algorithms for Book Embedding Problems
- Parameterized Algorithms
- On the upward book thickness problem: combinatorial and complexity results
Related Items (1)
This page was built for publication: Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610085)
