The project is organized into two main workparts.

• WP1: Algorithmic methodologies with theoretical guarantees for constrained graph visualization and exploration.
  Leader: Giordano Da Lozzo (Roma Tre University)
  We plan to exploit parameterized and exact algorithms, possibly coupled with complexity lower bounds, to efficiently compute provably-good solutions for hard problems dealing with constrained graph layouts. We will also pioneeringly design enumeration algorithms to explore solutions stemming from layout problems with relaxed constraints. WP1 is organized in the following three tasks.

  • T1.1  Leader: Fariba Ranjbar (LUISS) - Efficient algorithms for detecting structural constraints.

  • T1.2 Leader: Emilio Di Giacomo (UNIPG) - Exact and parameterized algorithms for constrained graph layout problems.

  • T1.3 Leader: Fabrizio Grosso (RM3) - Enumeration algorithms for graph layouts.

• WP2: Validation of algorithmic solutions for constrained graph visualization and exploration.
  Leader:  Alessio Martino (LUISS)
  While our algorithms can be beneficial for multiple applications, we will validate them on two relevant scenarios, i.e., socio-semantic and transportation networks. Exploring the former brings together the study of two intertwined data generation processes: a social community and a content-creation process. Visualizing the latter is crucial to make complex infrastructures easily accessible to a broad set of users. WP2 is organized in the following two tasks.

  • T2.1 Leader: Irene Finocchi (LUISS) - Visualization and exploration of socio-semantic networks.

  • T2.2 Leader: Lapo Cioni (UNIFI)  - Visualization and exploration of transportation networks.