## Giordano Da Lozzo

### Roma Tre University

Giordano Da Lozzo is a postdoctoral researcher in the Department of Engineering at the Roma Tre University, mentored by Giuseppe Di Battista. Until October 2017, he was an assistant project scientist at the CECS Department of The Donald Bren School of Information & Computer Sciences at University of California, Irvine, jointly mentored by Michael T. Goodrich and David A. Eppstein. Until September 2016, he was a postdoctoral fellow at the Department of Informatics and Automation (DIA) of the Roma Tre University, mentored by Giuseppe Di Battista.

His research interests are in the areas of graph theory, algorithms, and complexity theory, with a particular focus on problems in Graph Drawing, Computational Geometry, and Combinatorial Optimization. He received the “Laurea” Bachelor degree and the “Laurea Magistrale” Master degree in Computer Science and Engineering at the Roma Tre University, and defended his Ph.D. thesis at the Department of Informatics and Automation (DIA) of the same institution, jointly advised by Giuseppe Di Battista and Maurizio Patrignani, on June 2015.

### Interests

• Algorithm Design
• Graph Drawing
• Graph Theory
• Computational Geometry

### Education

• PhD in Computer Science and Automation Engineering, 2015

Roma Tre University

• MEng in Computer Science (110/110 cum laude), 2010

Roma Tre University

# Projects

Efficient Algorithms for HArnessing networked Data (funded by the Italian Ministry of University and Scientific Research)

#### CONNECT

Combinatorics of Networks and Computation (funded by EU Horizon 2020 Programme)

#### MODE

MOrphing graph Drawings Efficiently (funded by the Italian Ministry of University and Scientific Research)

#### STACS

The Space/Time Analysis for Cybersecurity program (funded by the U.S. Defense Advanced Research Projects Agency)

#### AMANDA

Algorithmics for MAssive and Networked DAta (funded by the Italian Ministry of University and Scientific Research)

Graph Drawings and Representations (funded by the ESF EUROCORES EuroGIGA Programme)

#### AlgoDEEP

Algorithmic challenges for Data-intensivE processing on Emerging computing Platforms (funded by the Italian Ministry of University and …

# Teaching

Here are some of the courses for which I was formally appointed as the main teacher:

PhD Courses

Master Courses

Here are some of the courses for which I was formally appointed as a teaching assistant:

Master Courses

Bachelor Courses

# PCs & Awards

Program committee memberships:

• WADS 2021: 16th International Symposium on Algorithms and Data Structures

• GD 2019: 27th International Symposium on Graph Drawing and Network Visualization

• GD 2017: 25th International Symposium on Graph Drawing and Network Visualization

Awards:

• Best Paper Award at the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019):

Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta: C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. IPEC 2019: 9:1-9:17 PDF

• Best Paper Award at the 42nd International Conference on Current Trends in Theory and Practice of Computer (SOFSEM 2016):

Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis: L-Drawings of Directed Graphs. SOFSEM 2016: 134-147 PDF

• Best Poster Award at the 23rd International Symposium on Graph Drawing & Network Visualization (GD 2015)

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter: On the Relationship Between Map Graphs and Clique Planar Graphs. Graph Drawing 2015: 548-550 PDF

• Best MCS Thesis Award by Confindustria Servizi Innovativi e Tecnologici–AICA (CSIT 2011)

Giordano Da Lozzo: Design and analysis of a paradigm for visualizing and exploring relational data in a mobile environment and its implementation on the Google Android platform. Roma Tre University. 2011.

# Recent Publications

SEE ALL PUBLICATIONS »

### Upward Planar Morphs

We prove that, given two topologically equivalent upward planar straight-line drawings of an $n$-vertex directed graph $G$, there …

### Beyond level planarity: Cyclic, torus, and simultaneous level planarity

In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to …

### Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages

An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and …

### Extending Upward Planar Graph Drawings

In this paper we study the computational complexity of the Upward Planarity Extension problem, which takes in input an upward planar …

### On Planar Greedy Drawings of 3-Connected Planar Graphs

A graph drawing is greedy if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean …