July 30

Goals

The main goal of the workshop is to create a platform for the exchange of tools, ideas, and questions between researchers working on different aspects of real networks. Especially the concepts from the quite young area of sparse graphs and from network science are not widely known in the distributed community.
We hope that the workshop will foster new cross-field collaborations that will lead to strong new results. In particular we hope that the workshop will encourage more practical works such as implementation, evaluation, and the usage of structural graph theory in larger systems. On the other hand we expect that researchers working on practical problems (both on physical and social networks) can show possible new directions for theoretical researches that are relevant for practical applications

Speakers

Tutorial

Thomas Bläsius
Theoretical Algorithm Analysis meets Practical Data

Stefan Schmid
Disconnected cooperation in resilient networks
and the algorithmic challenges of local fast re-routing

Patrice Ossona de Mendez
Local properties of sparse graphs

Short talk

Michael Dinitz
Datacenter Topologies: Expanders and Beyond

Janne Korhonen
Structural parameters and distributed graph algorithms

Andrzej Czygrinow
Matchings and their generalizations in certain classes of sparse graphs

Soheil Behnezhad
Locality and the Stochastic Matching Problem

Pedro Montealegre
Compact local certification of graph classes

Program

Friday, July 30, 13:00-21:00 CEST.

The speakers include time for questions and a short break.

Start Length Speaker
13:00 1:30 Thomas Bläsius
14:30 1:30 Stefan Schmid
16:00 0:30 Michael Dinitz
16:30 0:30 Break
17:00 1:30 Patrice Ossona de Mendez
18:30 0:30 Janne Korhonen
19:00 0:30 Andrzej Czygrinow
19:30 0:30 Break
20:00 0:30 Soheil Behnezhad
20:30 0:30 Pedro Montealegre

Other information

Organizing Commitee

Saeed Amiri

Laurent Feuilloley

Sebastian Siebertz

Alexandre Vigny

Any questions?

Send us an email!

Thank to flyingfisch and their pen.