Home Group Jannik Matuschke Journal Articles with Martin Skutella and José A. Soto in Robust Randomized Matchings Mathematics of Operations Research 43:675-692, 2018. (conference version: SODA 2015) with Ashwin Arulselvan, Ágnes Cseh, Martin Groß, and David Manlove in Many-to-one matchings with lower quotas: Algorithms and complexity Algorithmica 80:185–208, 2018. (conference version: ISAAC 2015) with Christina Büsing, Kai-Simon Goetzmann, and Sebastian Stiller in Reference Points and Approximation Algorithms in Multicriteria Discrete Optimization European Journal of Operational Research 260:829-840, 2017. with José Correa, Tobias Harks, and Vincent J.C. Kreuzen in Fare Evasion in Transit Networks Operations Research 65:165–183, 2017. with S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, and Martin Skutella in Protection of flows under targeted attacks Operations Research Letters 45:53–59, 2017. with Tobias Harks, Felix G. König, Alexander Richter, and Jens Schulz in An Integrated Approach to Tactical Transportation Planning in Logistics Networks Transportation Science 50:439–460, 2016. Finalist of the EURO Excellence in Practice Award 2016 and winner of the 2017 INFORMS/TSL Outstanding Paper Award in Freight Transportation and Logistics. with Yann Disser in Degree-constrained orientations of embedded graphs Journal of Combinatorial Optimization 31:758–773, 2016. (conference version: ISAAC 2012) with José Correa, Alberto Marchetti-Spaccamela, Leen Stougie, Ola Svensson, Víctor Verdugo, and José Verschae in Strong LP formulations for scheduling splittable jobs on unrelated machines Mathematical Programming 154:305–328, 2015. (conference version: IPCO 2014) with Jan-Philipp W. Kappmeier and Britta Peis in Abstract flows over time: A first step towards solving dynamic packing problems Theoretical Computer Science 544:74–83, 2014. (conference version: ISAAC 2012) with Ágnes Cseh and Martin Skutella in Stable Flows over Time Algorithms 6:532–545, 2013. (conference version: MATCH-UP 2012) with Tobias Harks and Felix G. König in Approximation Algorithms for Capacitated Location Routing Transportation Science 47:3–22, 2013. Articles in Refereed Conference Proceedings (excluding those listed above) with Martin Groß, Anupam Gupta, Amit Kumar, Daniel R. Schmidt, Melanie Schmidt, and José Verschae in A Local-Search Algorithm for Steiner Forest 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), volume 94 of Leibniz International Proceedings in Informatics, pp. 31:1–31:17, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2018. with Ágnes Cseh in New and simple algorithms for stable flow problems Graph-Theoretic Concepts in Computer Science (WG 2017), volume 10520 of Lecture Notes in Computer Science, pp. 207–219 Springer, 2017. with Bastián Bahamondes, José Correa, and Gianpaolo Oriolo in Adaptivity in Network Interdiction Decision and Game Theory for Security (GameSec 2017), volume 10575 of Lecture Notes in Computer Science, pp. 40–52, Springer, 2017. with S. Thomas McCormick and Gianpaolo Oriolo in Rerouting flows when links fail 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80 of Leibniz International Proceedings in Informatics, pp. 89:1–89:13, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017. with Andreas Bley and Benjamin Müller in Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections Algorithms – ESA 2013, volume 8125 of Lecture Notes in Computer Science, pp. 707–718, Springer, 2013. with Felix G. König and Alexander Richter in Multi-dimensional commodity covering for tariff selection in transportation 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2012), volume 25 of OpenAccess Series in Informatics, pp. 58–70, Dagstuhl Publishing, 2012. with Britta Peis in Lattices and maximum flow algorithms in planar graphs Graph-Theoretic Concepts in Computer Science (WG 2010), volume 6410 of Lecture Notes in Computer Science, pp. 324–335, Springer, 2010. Working papers with Yann Disser. The Complexity of Computing a Robust Flow Scheduling an Electric Vehicle Valet Service with Ali Khodabakhsh, Orestis Papadigenopoulos, Jimmy Horn, Evdokia Nikolova, and Emmanouil Pountourakis.