## Giordano Da Lozzo

### Roma Tre University

Giordano Da Lozzo is an assistant professor (RTDa) at Roma Tre University, working in the research group on Graph Algorithms and Network Visualization. Prior to this position, he was a postdoctoral researcher (assegnista di ricerca) at the same institution for four years, mentored by Giuseppe Di Battista, and an assistant project scientist in the Theory Group of the Center for Algorithms and Theory of Computation at University of California, Irvine for one year, jointly mentored by Michael T. Goodrich and David A. Eppstein. He obtained his PhD degree in Computer Science and Automation Engineering in 2015 from Roma Tre University, jointly advised by Giuseppe Di Battista and Maurizio Patrignani, where he also graduated cum laude in Computer Engineering presenting a thesis that received the AICA-Confindustria award as best thesis in Information Communication Technology. He was a Leonardo da Vinci fellow at the RIPE Network Coordination Center in Amsterdam and a visiting scholar at the Charles University in Prague. He was also a research visitor at the Universität Tübingen, the Technische Universiteit Eindhoven, and the Karlsruhe Institute of Technology.

His research interests are in algorithm engineering and complexity, focused in particular on the practical and theoretical challenges arising from the design of efficient algorithms for the analysis and visualization of networks. His primary area of research lies in graph drawing, a research field at the intersection of the areas of computational geometry, combinatorial optimization, discrete mathematics, and graph theory. He is involved in several research projects exploring fundamental questions about the visualization of large and evolving networks, visualizations for cybersecurity, layouts of simultaneous and clustered networks, as well as contact and hybrid representations of real-world graphs.

He has published 24 articles in prestigious journals in the field of algorithms, such as ACM Transactions on Algorithms, Algorithmica, Discrete and Computational Geometry, SIAM Journal on Computing, and Theoretical Computer Science. He has published 40 conference papers in selective international venues, such as the Symposium on Data Structures and Algorithms (SODA), the Symposium on Computational Geometry (SoCG), the International Colloquium on Automata, Languages and Programming (ICALP), and the European Symposium on Algorithms (ESA). Moreover, he is the coauthor of a book chapter entitled Beyond Clustered Graphs. Finally, he has served as a program committee member in internal conferences and as a reviewer for several journals and research funding projects.

### Interests

• Graph Drawing
• Graph Theory
• Discrete & Computational Geometry
• Algorithms and Data Structures

### 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

PhD Courses

Bachelor and Master Courses

2021/2022:

2020/2021:

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

Master Courses

Bachelor Courses

# PCs & Awards

Program committees:

• EuroCG 2022: 38th European Workshop on Computational Geometry
• 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 …