9h00 - 10h00 | Grégory Miermont | The scaling limit of the minimum spanning tree of the complete graph |
Pause | ||
10h30 - 11h00 | Matthieu Rosenfeld | Avoiding repetitions in words |
11h00 - 11h45 | Olivier Laurent | Proving and computing with graphs |
11h45 - 12h15 | Ignacio García Marco | Large convex sets in Minkowski sums |
Lunch | ||
13h45 - 14h30 | Nicolas Trotignon | Perfect graphs |
14h30 - 15h15 | Paulo Gonçalves | Possible bases for signal processing on graphs |
Pause | ||
15h45 - 16h30 | Bora Uçar | Bipartite matchings and solving sparse linear systems |
16h30 - 17h15 | Damien Stehlé | Introduction to lattice based cryptography |