10:00 — 10:20 Arrival

10:20 — 10:30 Short intro

10:30 — 11:00: Summary by leaders of WP1, T1.1, T1.2, T1.3 

11:00 — 11:20 Introducing fairness in network visualization - Fabrizio Montecchiani (UniPG)

11:20 — 11:40 Finding a Shortest Curve that Separates Few Objects from Many - Fabrizio Frati (Roma Tre)

11:40 — 12:10 BREAK

12:10 — 12:40 Summary by leaders of WP2, T2.1, T2.2

12:40 — 13:00 Engineering Algorithms for ℓ-Isolated Maximal Clique Enumeration  - Irene Finocchi (LUISS)

13:00 — 14:30 LUNCH

14:30—14:50 Algorithmic Aspects of Time-Constrained Graphs and Their Applications to Transportation Networks - Lapo Cioni (UniFi)

14:50—16:30 BUSINESS MEETING


09:30 — 09:35: Introduction

09:35—10:00: Summary by leaders of WP1, T1.1, T1.2, T1.3 

10:00—10:20: Flipping Plane Perfect Matchings is Hard - Daniel Perz (UniPG)

10:20—10:40: Upward Pointset Embeddings of Planar st-Graphs - Fabrizio Grosso (CeDiPa)

10:40—10:50: SHORT BREAK

10:50—11:10: Summary by leaders of WP2, T2.1, T2.2

11:10—11:30: Analyzing scientific collaborations through the lens of hypergraphs - Fariba Ranjbar (LUISS)

11:30—11:50: Exploring Time Constrained Graphs with applications to Transportation Networks - Jason Schoeters, Lapo Cioni, Andrea Marino (UniFI)

11:50—12:00: SHORT BREAK

12:00—13:00: BUSINESS MEETING


14:00-14:20 – The NextGRAAL project - Fabrizio Montecchiani (UniPG)

14:20-14:40 – Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs  - Fabrizio Grosso (Roma Tre)

14:40-15:00 – Fairness in Network Visualization - Tommaso Piselli (UniPG)

15:00-15:20 - BREAK

15:20-15:40 – Building socio-semantic networks from bibliometric data - Irene Finocchi (LUISS)

15:40-16:00 – Connectivity Problems on Temporal Graphs - Ana Silva (UniFI)

16:00-17:00 – BUSINESS MEETING