Andreas S. Schulz currently holds a chaired professorship at the Technische Universität München, where he has a joint appointment at the Center for Mathematics and the School of Management. Previously he was Head of the Operations Research and Statistics Group at the Sloan School of the Massachusetts Institute of Technology. His research interests span the theory and practice of mathematical optimization as well as computational economics and algorithmic game theory. Martin Skutella is full professor in the Department of Mathematics at TU Berlin and member of the Research Center \textsc{Matheon}, “Mathematics for Key Technologies,” in Berlin. His main research interests lie in the area of efficient algorithms and combinatorial optimization, in particular in network optimization and scheduling. From 2009 to 2012, he was Editor-in-Chief of the Notices of the German Mathematical Society (DMV). Sebastian Stiller is Professor for MathematicalOptimization at TU Braunschweig, Germany. His research interests include robust optimization, game theory, network flows, and scheduling, with applications mainly in traffic, transport, logistics, and real-time systems. Dorothea Wagner heads the Institute of Theoretical Informatics at the Karlsruhe Institute of Technology. Her research interests are in the field of graph algorithms and algorithm engineering with a focus on traffic optimization, social network analysis and network visualization. She is currently a member of the German Council of Science and Humanities (Wissenschaftsrat) and served previously, for seven years as Vice President of the German Research Foundation (DFG).
Seventeen former advisees of Rolf H. M�hring contributed to this collection with fourteen short essays, on the occasion of his retirement. The result is a beautiful collection of results in combinatorial optimization, graph algorithms, algorithmic game theory and computational geometry, each suitable as a basis for a lecture or two in an advanced undergraduate or a graduate course. ... Nice examples, high quality illustrations and suggestion for further reading at the end of each chapter make the book truly valuable. (Andr�s Recski, Mathematical Reviews, October, 2016) Seventeen former advisees of Rolf H. Mohring contributed to this collection with fourteen short essays, on the occasion of his retirement. The result is a beautiful collection of results in combinatorial optimization, graph algorithms, algorithmic game theory and computational geometry, each suitable as a basis for a lecture or two in an advanced undergraduate or a graduate course. ... Nice examples, high quality illustrations and suggestion for further reading at the end of each chapter make the book truly valuable. (Andras Recski, Mathematical Reviews, October, 2016)