activity
20112025
most citedProperties and Complexity of Fan-Planarity

38 citations · 50 across the 13 of their papers we have counts for

collaborators
Showing cs.CGShow all

6 papers · 1 filter

cs.CG2025

Tangling and Untangling Trees on Point-sets

Giuseppe Di Battista, Giuseppe Liotta, Maurizio Patrignani +2

We study a question that lies at the intersection of classical research subjects in Topological Graph Theory and Graph Drawing: Computing a drawing of a graph with a prescribed num…

cs.CG2025

Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces

Patrizio Angelini, Carla Binucci, Giuseppe Di Battista +5

Unit edge-length drawings, rectilinear drawings (where each edge is either a horizontal or a vertical segment), and rectangular face drawings are among the most studied subjects in…

cs.CG2024

Weakly Leveled Planarity with Bounded Span

Michael Bekos, Giordano Da Lozzo, Fabrizio Frati +5

This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizonta…

cs.CG2017

Planar Drawings of Fixed-Mobile Bigraphs

Michael Bekos, Felice De Luca, Walter Didimo +4

A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, tog…

cs.CG2014★ 38 cited

Properties and Complexity of Fan-Planarity

Carla Binucci, Emilio Di Giacomo, Walter Didimo +3

In a \emph{fan-planar drawing} of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt, who pro…

cs.CG2013

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…