Graphs and Combinatorial Optimization: from Theory to Applications

lt;p>Andreas Brieden is professor for "Statistics and Risk Management" in the
department of Economics and Management at Universität der Bundeswehr
München, which position he has held since 2005. He studied AppliedMathematics at University of Trier 1989-94; Dipl.-Math. Oec. 1994;
doctorate 1998 with award at Technical University Munich; Dr. habil.
2003; venia legendi "Mathematics". Andreas Brieden published more than30 articles in the context of Discrete and Combinatorial Optimization;
in 2013, he was awarded together with Peter Gritzmann and Steffen
Borgwardt the European Excellence in Practice Award of the Associationof the European Operational Research Societies within IFORS.
Stefan Pickl is professor for "Operations Research" in the department of
computer science at Universität der Bundeswehr München, which position
he has held since 2005. He studied mathematics, electrical engineering,and philosophy at TU Darmstadt and EPFL Lausanne 1987-93; Dipl.-Ing.
1993; doctorate 1998 with award; assistant professor at Cologne
University; Dr. habil. 2005; venia legendi "Mathematics". Stefan Picklpublished more than 80 articles and several books in the context of
"Modelling, Simulation and Data-Driven Optimization of Dynamical Systems
and Networks". Since 2010, Prof. Pickl is the chair of the AdvisoryBoard of the German OR Society. In 2001, he organized the first
Cologne-Twente Workshop on Graphs and Combinatorial Optimization CTW.

Markus Siegle is professor for "Design of Computer and Communication
Systems" in the department of computer science at Universität derBundeswehr München, which position he has held since 2003. He studied
computer science and electrical engineering at Stuttgart University
1984-89; Dipl.-Inf. 1989; master's degree 1990 (as Fulbright scholar) atNorth Carolina State University; researcher at Erlangen University where
he obtained the doctoral (1995) and habilitation degree (2002). Markus
Siegle published more than 40 articles in the area of modelling,analysis, and verification of probabilistic and non-deterministic
concurrent systems, with special focus on performance and dependability.
He has been involved in numerous scientific events, e.g. as PC co-chairof the OR 2010 Munich conference and PC co-chair of the QEST 2013
conference.

On syntactical graphs-of-words.- k-slow Burning: Complexity and Upper Bounds.- Exact approaches for the Connected Vertex Cover problem.- Handling Sub-symmetry in Integer Programming using Activation Handlers.- Online Facility Location: comparing ad-hoc and MIP-based algorithms.- A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem.- On the Optimality Gap of Full Airport Slot Assignments: Capacity-limited Packing with Pareto Optimality Constraints.- The algorithmic complexity of the Paired Matching problem.- Edge Contraction and Forbidden Induced Subgraphs.- Rigidity of frameworks on spheres.- Discrepancies of subtrees.-Data-driven feasibility for the Resource Constraint Shortest Path Problem.-Monte-Carlo Integration on a Union of Polytopes.-   Managing Time Expanded Networks: The Strong Lift Problem.