activity
20122026
most citedNonrepetitive Colourings of Planar Graphs with Colours

18 citations · 50 across the 37 of their papers we have counts for

collaborators
Showing 2020Show all

6 papers · 1 filter

cs.DS2020

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +2

Given a bipartite graph , the -Level Quasi-Planarity problem asks for the existence of a drawing of in the plane such that the vertices in and in …

cs.DS2020

Schematic Representation of Large Biconnected Graphs

Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani +1

Suppose that a biconnected graph is given, consisting of a large component plus several other smaller components, each separated from the main component by a separation pair. We in…

math.CO2020

Universal Geometric Graphs

Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth

We introduce and study the problem of constructing geometric graphs that have few vertices and edges and that are universal for planar graphs or for some sub-class of planar graphs…

cs.DS2020

Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time

Fabrizio Frati

We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding that the drawing has to resp…

cs.CG2020

On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs

Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati

In this paper we study the area requirements of planar greedy drawings of triconnected planar graphs. Cao, Strelzoff, and Sun exhibited a family of subdivisions of triconn…

cs.DS2020

Drawing Graphs as Spanners

Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose +4

We study the problem of embedding graphs in the plane as good geometric spanners. That is, for a graph , the goal is to construct a straight-line drawing of in the plane…