Networks are present in our lives in numerous different environments: to name just a few, networks can model social relationships, they can model the Internet and links between web pages, they might model the spread of a virus infection between people, and they might represent computer processors/sensors that have to exchange information.

This project aims to obtain new insights into the behaviour of networks, which are studied from a geometric and computational perspective. Thereto, the project brings together researchers from different areas such as Computational Geometry, Discrete Mathematics, Graph Drawing, and Probability. Among of the topics of research are enumerative problems on geometric networks, crossing numbers, random networks, imprecise models of data, restricted orientation geometry. Combinatorial approaches are combined with algorithms. Algorithmic applications of networks are also studied in the context of unmanned aerial vehicles (UAVs) and in the context of musical information retrieval (MIR).

–

See also:

##### Giordano Da Lozzo

###### Assistant Professor (RTDb)

My research interests are in Algorithm Engineering and Complexity, focused in particular on the theoretical and algorithmic challenges arising from the visualization of graphs.

## Publications

### Upward Planar Morphs

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

*book embedding*, consists of a linear ordering of its vertices along the spine of the book and …

### Extending Upward Planar Graph Drawings

*Upward Planarity Extension*problem, which takes in input an upward planar …

### Computing k-Modal Embeddings of Planar Digraphs

*$k$-modal*, if every vertex of $G$ is …

### Graph Stories in Small Area

### Reaching 3-Connectivity via Edge-edge Additions

*edge-edge addition on $\langle …*

### Extending Upward Planar Graph Drawings

*Upward Planarity Extension*problem, which takes in input an upward planar …

### How to Morph a Tree on a Small Grid

### Morphing Contact Representations of Graphs

### Upward Book Embeddings of st-Graphs

*k-page upward book embeddings*($k$UBEs) of $st$-graphs, that is, book embeddings of single-source single-sink directed acyclic …

### C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width

*clustered graph*, i.e, a graph whose vertex set is recursively partitioned into clusters, the C-Planarity Testing problem asks …