Search

Patrizio Angelini

Simple k-planar graphs are simple (k + 1)-quasiplanar
Morphing Contact Representations of Graphs
Clustered Planarity with Pipes
3-coloring arrangements of line segments with 4 slopes is hard
Algorithms and Bounds for L-Drawings of Directed Graphs
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
How to Morph Planar Graph Drawings
On the Relationship Between k-Planar and k-Quasi-Planar Graphs
Intersection-Link Representations of Graphs
Strip Planarity Testing for Embedded Planar Graphs
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
Clustered Planarity with Pipes
L-Drawings of Directed Graphs
Simultaneous Orthogonal Planarity
SEFE = C-Planarity?
Optimal Morphs of Convex Drawings
Intersection-Link Representations of Graphs
On the Relationship Between Map Graphs and Clique Planar Graphs
Advancements on SEFE and Partitioned Book Embedding problems
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
Relaxing the constraints of clustered planarity
The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity)
On Some NP-complete SEFE Problems
Morphing Planar Graph Drawings Optimally
Anchored Drawings of Planar Graphs
The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity)
Drawing Non-Planar Graphs with Crossing-Free Subgraphs
Strip Planarity Testing