Patrizio Angelini

activity

20122026

k

-Planar Graphs are Simple

(k + 1)

-Quasiplanar

12 citations · 57 across the 39 of their papers we have counts for

collaborators

Showing 2019Show all

4 papers · 1 filter

cs.CG2019★ 12 cited

Simple $k$ -Planar Graphs are Simple $(k + 1)$ -Quasiplanar

Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8

A simple topological graph is $k$ -quasiplanar ( $k \geq 2$ ) if it contains no $k$ pairwise crossing edges, and $k$ -planar if no edge is crossed more than $k$ times. In this paper, we…

cs.DS2019

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity

Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1

Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on…

cs.DS2019

The QuaSEFE Problem

Patrizio Angelini, Henry Förster, Michael Hoffmann +4

We initiate the study of Simultaneous Graph Embedding with Fixed Edges in the beyond planarity framework. In the QuaSEFE problem, we allow edge crossings, as long as each graph ind…

cs.CG2019

Morphing Contact Representations of Graphs

Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +2

We consider the problem of morphing between contact representations of a plane graph. In an $F$ -contact representation of a plane graph $G$ , vertices are realized by inter…

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity

The QuaSEFE Problem

Morphing Contact Representations of Graphs

Simple $k$ -Planar Graphs are Simple $(k + 1)$ -Quasiplanar