Algorithmic Model Theory 2013, Programme

Monday, 25th

All talks take place in the lecture room MA 0041 in the math (MA) building. The address is "Straße des 17. Juni 136" (Link to Google Maps).

Time Name University Title
14:00-14:30 Alexander Kartzow Universität Leipzig Higher-Order One-Counter Automata
14:30-15:00 Kord Eickmeyer National Institute of Informatics, Tokyo Model Checking for Successor-Invariant FO on Minor-Closed Graph Classes
15:00-15:30 Nicole Schweikardt Goethe-Universität Frankfurt An optimal Gaifman normal form construction for structures of bounded degree
15:30-16:00 Coffee break
16:00-16:30 Jörg Flum Universität Freiburg On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity
16:30-17:00 Robert Ganian Goethe-Universität Frankfurt Polynomial Kernels for MSO-expressible Graph Problems
17:00-17:30 Coffee break
17:30-18:00 Thomas Zeume TU Dortmund On the quantifier-free dynamic complexity of Reachability
18:00-18:30 Matthias Niewerth TU Dortmund Reasoning about XML Constraints based on XML-to-relational mappings
20:00 Dinner at the restaurant "Filmbühne am Steinplatz"

Tuesday, 26th

9:00-9:30 Martin Otto Universität Darmstadt Finite groupoids, acyclicity & symmetries
9:30-10:00 Martin Huschenbett TU Ilmenau A Polychromatic Ramsey Theory for Ordinals
10:00-10:15 Christoph Berkholz RWTH Aachen On the existential 2-pebble game and arc consistency algorithms
10:15-10:45 Coffee break
10:45-11:15 Moritz Mueller Kurt Gödel Research Center, Vienna University Graph invariants in proof complexity
11:15-11:45 Oleg Verbitsky Humboldt-Universität Berlin Bounds for the quantifier rank in two-variable logic
11:45-12:15 Martin Schuster TU Dortmund On optimum left-to-right strategies for active context-free games
12:15-12:30 Lukasz Kaiser RWTH Aachen Program Synthesis and Descriptive Complexity