From the 1 of 5 linked papers with an AI index.
5 papers
Extending Biconnected Straight-Line Planar Drawings
Giordano Andreola, Susanna Caroppo, Giordano Da Lozzo +5
The paper investigates the difficulty of extending a straight-line planar drawing of a biconnected subgraph to the whole graph, showing NP‑hardness in the variable‑embedding case a…
On Large Induced Outerplanar Subgraphs in -Outerplanar Graphs
Marco D'Elia, Fabrizio Frati
Borradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every -vertex -outerplane graph has a set of at least vertices that induces an outerpla…
On Planar Straight-Line Dominance Drawings
Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista +3
We study the following question, which has been considered since the 90's: Does every -planar graph admit a planar straight-line dominance drawing? We show concrete evidence fo…
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
Giuseppe Di Battista, Fabrizio Frati
The algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the mos…
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 …