Quantum graph drawing (best student paper)
From MaRDI portal
Publication:6575378
DOI10.1007/978-981-97-0566-5_4MaRDI QIDQ6575378FDOQ6575378
Authors: Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista 
Publication date: 19 July 2024
Cites Work
- Title not available (Why is that?)
- A faster fixed parameter algorithm for two-layer crossing minimization
- Crossing Number is NP-Complete
- On the parameterized complexity of layered graph drawing
- The book thickness of a graph
- Title not available (Why is that?)
- Simple and Efficient Bilayer Cross Counting
- 2-layer right angle crossing drawings
- Embedding planar graphs in four pages
- Two-page book embeddings of 4-planar graphs
- Quantum computing. A gentle introduction
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Exact algorithms for the quadratic linear ordering problem
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- Drawing graphs in two layers
- Edge-Deletion Problems
- The consecutive ones submatrix problem for sparse matrices
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Two-layer drawings of bipartite graphs
- 1-page and 2-page drawings with bounded number of crossings per edge
- Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
- Book embeddings and crossing numbers
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- Title not available (Why is that?)
This page was built for publication: Quantum graph drawing (best student paper)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575378)
