activity
20122026
most citedSimple -Planar Graphs are Simple -Quasiplanar

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

collaborators
Showing cs.DMShow all

5 papers · 1 filter

cs.DM2020

On Mixed Linear Layouts of Series-Parallel Graphs

Patrizio Angelini, Michael A. Bekos, Philipp Kindermann +1

A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same…

cs.DM2020

Extending Partial Orthogonal Drawings

Patrizio Angelini, Ignaz Rutter, Sandhya T P

We study the planar orthogonal drawing style within the framework of partial representation extension. Let be a partial orthogonal drawing, i.e., G is a graph, $H\subs…

cs.DM2020

-Layer -Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth

Patrizio Angelini, Giordano Da Lozzo, Henry Förster +1

The -layer drawing model is a well-established paradigm to visualize bipartite graphs. Several beyond-planar graph classes have been studied under this model. Surprisingly, howe…

cs.DM2017

Beyond-Planarity: Density Results for Bipartite Graphs

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

Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with…

cs.DM2012

Relaxing the Constraints of Clustered Planarity

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

In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered…