12 citations · 57 across the 39 of their papers we have counts for
5 papers · 1 filter
Advancements on SEFE and Partitioned Book Embedding Problems
Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth
In this work we investigate the complexity of some problems related to the {\em Simultaneous Embedding with Fixed Edges} (SEFE) of planar graphs and the PARTITIONED -PAGE BO…
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
Patrizio Angelini, William Evans, Fabrizio Frati +1
We show that every -vertex planar graph admits a simultaneous embedding with no mapping and with fixed edges with any -vertex planar graph. In order to achieve this resul…
Morphing Planar Graphs Drawings Efficiently
Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani +1
A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all time…
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo +5
We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Γ of G in the plane such that the…
Testing Mutual Duality of Planar Graphs
Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
We introduce and study the problem \mpd, which asks for two planar graphs and whether can be embedded such that its dual is isomorphic to . Our algorithmic m…