STACS 2013 » Scientific Program

Scientific Program

Wednesday, February 27

14.15 – 17.30 Tutorial

Thursday, February 28

9.00 – 10.00 Invited Talk
10.20–11.35 Session 1A: Parameterized Complexity – Chair: Peter Rossmanith
10.20–11.35 Session 1B: Complexity and Logic – Chair: Heribert Vollmer
11.50–12.40 Session 2A: Kernels – Chair: Marc Zeitoun
11.50–12.40 Session 2B: Complexity and the Reals – Chair: Pascal Koiran
14.30–15.45 Session 3A: Constraint Satisfaction – Chair: Jacobo Torán
14.30–15.45 Session 3B: Cryptography, Biology, Learning – Chair: Till Tantau
16.00–17.15 Session 4A: Graph Algorithms and Theory – Chair: Martin Dietzfelbinger
16.00–17.15 Session 4B: Words – Chair: Marie-Pierre Béal

Friday, March 1

9.00–10.15 Session 5A: Computational Geometry – Chair: Christian Knauer
9.00–10.15 Session 5B: Two-Variable Logics – Chair: Anca Muscholl
10.30–11.20 Session 6A: Parameterized Algorithms – Chair: Jiří Sgall
10.30–11.20 Session 6B: Complexity – Chair: Thomas Schwentick
11.40–12.40 Invited Talk
14.30–15.45 Session 7A: Matching – Chair: Dirk Nowotka
14.30–15.45 Session 7B: Quantum Computing – Chair: Klaus Meer
16.00–17.15 Session 8A: Algorithms for Concrete Problems – Chair: Ernst W. Mayr
16.00–17.15 Session 8B: (Un-)decidability – Chair: Natacha Portier

Saturday, March 2

9.00–10.15 Session 9A: Algorithms and Algorithm Analysis – Chair: Sophie Tison
9.00–10.15 Session 9B: Automata and Languages – Chair: Wolfgang Thomas
10.30–11.20 Session 10A: Algorithms and Information Theory – Chair: Frédérique Bassino
10.30–11.20 Session 10B: Lower Bounds – Chair: Kousha Etessami
11.40–12.40 Invited Talk