The FRAIGNIAUD workshop (Fundamental Research and Algorithmic Innovations in Graphs, Networks and the Internet, with Applications and Upcoming Directions) took place in Paris on the 28th and 29th of November, on the occasion of Pierre FRAIGNIAUD’s 60th birthday.
Monday | Tuesday | |
---|---|---|
10:00 | Pierluigi Crescenzi (Keynote): Fraigniaud mining | |
10:30 | Coffee, welcome! | |
11:00 | Fedor Fomin: Optimization of procrastination | Coffee break |
11:30 | Cyril Gavoille: A succinct story of compact stuff (slides) | Magnus Halldorsson: When can we color in few rounds? |
12:00 | Ioan Todinca: On graphs that can be covered by k shortest paths | Alkida Balliu: On bad news in distributed computing |
12:30 | Lunch | Lunch |
14:30 | Corentin Travers: Asynchronous Decision | Yuval Emek: Proof Labeling Schemes Strike Back |
15:00 | Carole Delporte: Asynchrones consensus with bounded memory | Zvi Lotker: What's wrong with community detection algorithms in social networks. (slides) |
15:30 | Laurent Feuilloley: A story of local certification (slides) | Coffee break |
16:00 | Coffee break | Ran Gelles: Does randomness create holes in your topology? |
16:30 | Boaz Patt-Shamir (Keynote, general CS audience): Introduction to distributed computing | Sergio Rajsbaum: Pierre’s topology |
17:00 | Farewells | |
17:30 | break | |
18:00 | Buffet |
In addition to the speakers and organizers:
We could provide food and drinks without registration fee, thanks to the generosity of the IRIF PI of the following ANR projects: QuDATA, TEMPOGRAL, FREDDA, DISTANCIA and ALGORIDAM.