1 citations · 2 across the 4 of their papers we have counts for
6 papers
Extending Biconnected Straight-Line Planar Drawings
Giordano Andreola, Susanna Caroppo, Giordano Da Lozzo +5
The Partial Drawing Extensibility problem, for short PDE, takes as input a triple , where is a planar graph, is a subgraph of , and is a st…
Quantum Time-Space Tradeoffs for Exponential Dynamic Programming
Susanna Caroppo, Jevgēnijs Vihrovs, Dārta Zajakina +1
We investigate the quantum algorithms for dynamic programming by Ambainis et al. (SODA'19). While giving provable complexity speedups and applicable to a variety of NP-hard problem…
A Walk on the Wild Side: a Shape-First Methodology for Orthogonal Drawings
Giordano Andreola, Susanna Caroppo, Giuseppe Di Battista +3
Several algorithms for the construction of orthogonal drawings of graphs, including those based on the Topology-Shape-Metrics (TSM) paradigm, tend to prioritize the minimization of…
Quantum Algorithms for One-Sided Crossing Minimization
Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
We present singly-exponential quantum algorithms for the One-Sided Crossing Minimization (OSCM) problem. Given an -vertex bipartite graph , a -…
Upward Pointset Embeddings of Planar st-Graphs
Carlos Alegria, Susanna Caroppo, Giordano Da Lozzo +5
We study upward pointset embeddings (UPSEs) of planar -graphs. Let be a planar -graph and let be a pointset with . An UPSE of …
Quantum Graph Drawing
Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
In this paper, we initiate the study of quantum algorithms in the Graph Drawing research area. We focus on two foundational drawing standards: 2-level drawings and book layouts. Co…