Tentative Schedule:
Monday (Oct 5)
13h45-14h00: Opening and Welcome
-
14h00-15h00: Invited talk: Nguyễn Kim Thắng
-
15h00-15h20: Tatiana Starikovskaya - Fiat-Naor function inversion and small-space data structures for string processing
-
15h20-15h40: Laurent Feuilloley - Complexity landscape for local certification
15h40-16h20: Coffee break
-
16h20-16h40: Isabella Ziccardi - No Distributed Quantum Advantage for 3-Coloring Rooted Trees and 2-Coloring Even Cycles
-
16h40-17h00: Giannos Stamoulis - Low monodimensionality fragments of MSO
-
17h00-17h20:
Tuesday (Oct 6)
-
09h00-10h00: Invited talk : Lélia Blin
-
10h00-10h20: Joshua Sobel - Distributed Sampling and Counting Algorithms
-
10h20-10h40: Robin Vacus - Population protocols on general graphs
10h40-11h15: Coffee break
-
11h15-11h35: Shree Ganesh Srinivasan Jayakumar - Border tensor decompositions
-
11h35-11h55: Denis Antipov - Complexity of Random Search Heuristics
-
11h55-12h15: Kimon Boehmer - Submodular Max-Min Allocation and the Configuration LP
12h15-14h00: Lunch (on your own)
-
14h00-15h00: Invited talk: Arnaud Labourel
-
15h00-15h20: Shamisa Nematollahi - Stochastic Multi-Robot Monitoring on Graphs
-
15h20-15h40: Yaroslav Verbitsky - Topological Characterisation of Clique Agreement
15h40-16h20: Coffee break
-
16h20-16h40: Priyanshu Pant - Exponential Lower Bounds for the Pfaffian Number of Graphs
-
16h40-17h00: Nicolas Schivre - Output-linear time enumeration of potential maximal cliques
-
17h00-17h20: Aditi Dudeja - Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
Wednesday (Oct 7)
-
09h00-10h00: Invited talk: Lianna Hambardzumyan
-
10h00-10h20: Bruno Grenet - Time- and space-efficient polynomial computations
-
10h20-10h40: Lucas Perotin - Strategic Facility Location in Euclidean Spaces
10h40-11h15: Coffee break
-
11h15-11h35: Gaétan Berthe - Parameterized Feedback Vertex Set and related problems in geometric intersection graphs
-
11h35-11h55: Malory Marin - Small Independent Sets versus Small Separator in Geometric Intersection Graphs
-
11h55-12h15:
12h15-12h30: Final discussions and closing