activity
20122022
most citedImplementing a Partitioned 2-page Book Embedding Testing Algorithm

2 citations · 3 across the 11 of their papers we have counts for

collaborators

24 papers

cs.CG2022

Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022)

Patrizio Angelini, Reinhard von Hanxleden

This is the arXiv index for the electronic proceedings of GD 2022, which is held at the Tokyo Institute of Technology, Tokyo, Japan, on September 13 - 16, 2022. It contains the pee…

cs.CG2021

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons

Patrizio Angelini, Philipp Kindermann, Andre Löffler +2

We consider the problem of drawing an outerplanar graph with vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it ca…

cs.CG2021

On Morphing 1-Planar Drawings

Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani +1

Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of p…

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.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…