12 citations · 57 across the 39 of their papers we have counts for
7 papers · 1 filter
Vertex-Coloring with Star-Defects
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1
Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components ind…
Beyond Level Planarity
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +3
In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we…
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +4
Given a planar graph and a partition of the neighbors of each vertex in four sets , , , and , the problem Windrose Planarity asks to decide whet…
L-Drawings of Directed Graphs
Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo +4
We introduce L-drawings, a novel paradigm for representing directed graphs aiming at combining the readability features of orthogonal drawings with the expressive power of matrix r…
Intersection-Link Representations of Graphs
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +3
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex is represented by a geometric…
A Universal Point Set for 2-Outerplanar Graphs
Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann +1
A point set is universal for a class if every graph of has a planar straight-line embedding on . It is well-known that the integer…
Optimal Morphs of Convex Drawings
Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati +3
We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each…