Quantum graph drawing (best student paper)
From MaRDI portal
Publication:6575378
DOI10.1007/978-981-97-0566-5_4MaRDI QIDQ6575378
Giuseppe Di Battista, Giordano Da Lozzo, Susanna Caroppo
Publication date: 19 July 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A faster fixed parameter algorithm for two-layer crossing minimization
- Two-page book embeddings of 4-planar graphs
- 2-layer right angle crossing drawings
- On the parameterized complexity of layered graph drawing
- Embedding planar graphs in four pages
- The book thickness of a graph
- Drawing graphs in two layers
- 1-page and 2-page drawings with bounded number of crossings per edge
- Two-layer drawings of bipartite graphs
- The consecutive ones submatrix problem for sparse matrices
- Exact Algorithms for the Quadratic Linear Ordering Problem
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
- Crossing Number is NP-Complete
- Simple and Efficient Bilayer Cross Counting
- Edge-Deletion Problems
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- Book embeddings and crossing numbers
This page was built for publication: Quantum graph drawing (best student paper)
