Monday, June 2, 2025
| Time | Event | (+) |
| 09:00 - 09:30 | Welcome - Welcoming participants, coffee | |
| 09:30 - 10:20 | Fair Division Beyond Monotone Valuations - Siddharth Barman |
|
| 10:30 - 11:00 | Coffee break | |
| 11:00 - 11:25 | Analyzing black-box optimization algorithms - why and how? - Carola Doerr |
|
| 11:30 - 11:55 | A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter - Georg Zetzsche |
|
| 12:00 - 13:30 | Lunch | |
| 13:30 - 14:20 | The Success Story of Polyregular Functions: Why We Need Pebbles - Sandra Kiefer |
|
| 14:30 - 15:00 | Coffee break | |
| 15:00 - 15:25 | Local Correction algorithms for low-degree polynomials - Amik Raj Behera |
|
| 15:30 - 15:55 | Synthesizing Asynchronous Automata from Fair Specifications - B. Srivathsan |
|
| 16:00 - 17:00 | Coffee break |
Tuesday, June 3, 2025
| Time | Event | (+) |
| 09:30 - 10:20 | The other side of derandomization - Sylvain Perifel |
|
| 10:30 - 11:00 | Coffee break | |
| 11:00 - 11:25 | Generalizing Roberts' characterization of unit interval graphs - Stéphane Vialette |
|
| 11:30 - 11:55 | Edit Distance of Finite State Transducers - C. Aiswarya |
|
| 12:00 - 13:30 | Lunch | |
| 13:30 - 14:20 | Proof complexity meets finite model theory - Joanna Fijalkow |
|
| 14:30 - 15:00 | Coffee break | |
| 15:00 - 15:25 | Structural results for Arithmetic formulas - Sébastien Tavenas |
|
| 15:30 - 15:55 | The Formula Synthesis Problem - Focus on Propositional Dynamic Logic - Sophie Pinchinat |
|
| 16:00 - 17:00 | Coffee break | |
| 19:00 - 22:00 | Conference Dinner |
Wednesday, June 4, 2025
| Time | Event | (+) |
| 09:30 - 10:20 | Estimating the Electoral Consequences of Legislative Redistricting in France - Claire Mathieu |
|
| 10:30 - 11:00 | Coffee break | |
| 11:00 - 11:25 | Trading Determinism for NonCommutativity in Singularity Testing - Partha Mukhopadhyay |
|
| 11:30 - 11:55 | Resolving Nondeterminism with Randomness - K.S. Thejaswini |
|
| 12:00 - 13:30 | Lunch |
Thursday, June 5, 2025
| Time | Event | (+) |
| 09:30 - 10:20 | Permissive Equilibria in Multiplayer Reachability Games - Benjamin Monmege |
|
| 10:30 - 11:00 | Coffee break | |
| 11:00 - 11:25 | The Multiplicative Weights Update Technique - Nabil Mustafa |
|
| 11:30 - 11:55 | On the Probabilistic and Statistical Verification of Infinite Markov Chains - Patricia Bouyer-Decitre |
|
| 12:00 - 13:30 | Lunch | |
| 13:30 - 14:20 | On Dependent Outputs in Reactive Synthesis - Supratik Chakraborty |
|
| 14:30 - 15:00 | Coffee break | |
| 15:00 - 15:25 | Stabilizer Limits and Orbit Closures in Geometric Complexity Theory - K.V. Subrahmanyam |
|
| 15:30 - 15:55 | Decidable fragments of First Order Modal Logic - Anantha Padmanabha |
|
| 16:00 - 17:00 | Coffee break |
Friday, June 6, 2025
| Time | Event | (+) |
| 09:30 - 10:20 | FPT Approximation Algorithms for Coverage and Satisfiability Problems - Saket Saurabh |
|
| 10:30 - 11:00 | Coffee break | |
| 11:00 - 11:25 | High-Level Message Sequence Charts: Satisfiability and Realizability Revisited - Marie Fortin |
|
| 11:30 - 11:55 | Proof complexity of quantified Boolean formulas - Olaf Beyersdorff |
|
| 12:00 - 13:30 | Lunch | |
| 13:30 - 13:55 | Faster two-dimensional pattern matching with k mismatches - Jonas Ellert |
|
| 14:00 - 14:50 | Linear integer arithmetic and Gaussian elimination - Dmitry Chistikov |
|
| 15:00 - 16:00 | Coffee break |
