50 Jahre Uni Lübeck

GI-Fachgruppentreffen ALGO/KP/LogInf 2017 – Programm


Programm

Thursday

Slot Author Title
14:00-14:15 Till Tantau Welcome Adress
14:15-14:40 Lena Otterbach Simple and Efficient Leader Election
14:40-15:05 Peter Kling Tight Bounds for Coalescing Branching Random Walks on Regular Graphs
15:05-15:30 Dominik Kaaser A Simple and Tight Analysis of a Distributed Load Balancing Process
15:50-16:15 Malin Rau Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
16:15-16:40 Lars Rohwedder A Quasi-Polynomial Approximation for the Restricted Assignment Problem
17:00-18:00 Thomas Schneider Conservative Extensions in Expressive Ontology Languages
19:30- Dinner at San Marco

Friday

Slot Author Title
09:00-09:25 Marcelo Garlet Millani Funnels: Algorithmic Complexity of Problems on Special Directed Acyclic Graphs
09:25-09:50 Pascal Kunz Algorithmic Aspects of Point Visibility Graphs
09:50-10:15 Till Fluschnik Kernelization Lower Bounds for Finding Constant Size Subgraphs
10:30-10:55 Florin Manea Local Patterns
10:55-11:20 Karoliina Lehtinen Measuring the complexity of parity games with detective games
11:20-11:45 Arne Meier Team Semantics for the Specification and Verification of Hyperproperties
11:45-12:15 Fachgruppen Algo/KP
12:15-14:00 Lunch at Zeus
14:00-15:00 Till Mossakowksi Heterogene logische Theorien und DOL
15:20-15:45 Martin Lück Canonical Models and the Complexity of Modal Team Logic
15:45-16:10 Anselm Haak Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth
16:30-16:55 Henning Fernau Self-monitoring approximation algorithms
16:55-17:20 Markus Schmid On the Complexity of the Smallest Grammar Problem over Fixed Alphabets
17:20-17:45 Katrin Casel Resolving Conflicts for Lower-Bounded Clustering
17:45-18:15 Fachgruppen LogInf
20:00- Get Together at Kartoffelkeller

Saturday

Slot Author Title
09:15-10:15 Stefan Göller How verification and automata theory can benefit from complexity theory
10:45-11:10 Martin Lange Hybrid Branching-Time Temporal Logics
11:10-11:35 Manfred Schmidt-Schauß Nominal Unification and Extensions
11:35-12:00 Nils Vortmeier A Strategy for Dynamic Programs: Start over and Muddle through