CAALM 2025 (Complexity, Algorithms, Automata and Logic Meet)

9:30 - 10:20 (50min)

FPT Approximation Algorithms for Coverage and Satisfiability Problems

Saket Saurabh

10:30 - 11:00 (30min)

Coffee break

11:00 - 11:25 (25min)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited

Marie Fortin

11:30 - 11:55 (25min)

Proof complexity of quantified Boolean formulas

Olaf Beyersdorff

12:00 - 13:30 (1h30)

Lunch

13:30 - 13:55 (25min)

Faster two-dimensional pattern matching with k mismatches

Jonas Ellert

14:00 - 14:50 (50min)

Linear integer arithmetic and Gaussian elimination

Dmitry Chistikov

15:00 - 16:00 (1h)

Coffee break

Program