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).
Assistant Professor (RTDa)
My research interests are in Algorithm Engineering and Complexity, focused in particular on the theoretical and algorithmic challenges arising from the visualization of graphs.