09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
›9:30 (50min)
9:30 - 10:20 (50min)
FPT Approximation Algorithms for Coverage and Satisfiability Problems
Saket Saurabh
https://caalm-2025.sciencesconf.org/data/program/Abstract_Saket.pdf›10:30 (30min)
10:30 - 11:00 (30min)
Coffee break
›11:00 (25min)
11:00 - 11:25 (25min)
High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
Marie Fortin
›11:30 (25min)
11:30 - 11:55 (25min)
Proof complexity of quantified Boolean formulas
Olaf Beyersdorff
›12:00 (1h30)
12:00 - 13:30 (1h30)
Lunch
›13:30 (25min)
13:30 - 13:55 (25min)
Faster two-dimensional pattern matching with k mismatches
Jonas Ellert
›14:00 (50min)
14:00 - 14:50 (50min)
Linear integer arithmetic and Gaussian elimination
Dmitry Chistikov
›15:00 (1h)
15:00 - 16:00 (1h)
Coffee break
