Journal Articles

• Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds
  with Dimitris Fotakis and Orestis Papadigenopoulos
  in Operations Research, available online.

• A Constant-factor Approximation for Generalized Malleable Scheduling under M♮-Concave Processing Speeds
  with Dimitris Fotakis and Orestis Papadigenopoulos
  in Mathematical Programming, available online.
  (conference version: IPCO 2022) 

• The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs

with Nicola Morandi, Roel Leus, and Hande Yaman

in Transportation Science 57:1340–1358, 2023.

• Malleable scheduling beyond identical machines
  with Dimitris Fotakis and Orestis Papadigenopoulos
  in Journal of Scheduling 26:425–442, 2023.
  (conference version: APPROX 2019)

• Bifactor Approximation for Location Routing with Vehicle and Facility Capacities

with Oscar F. Carrasco Heine and Antonia Demleitner

in European Journal of Operational Research 304:429–442, 2023.

• Popular Branchings and Their Dual Certificates
  with Telikepalli Kavitha, Tamás Király, Ildikó Schlotter, and Ulrike Schmidt-Kraepelin
  in Mathematical Programming  192:567–595, 2022.
  (conference version: IPCO 2020)

• Exact and Approximation Algorithms for the Expanding Search Problem
  with Ben Hermans and Roel Leus
  in INFORMS Journal on Computing 34:281–296, 2022.

• Pure Nash Equilibria in Resource Graph Games
  with Tobias Harks and Max Klimm
  in Journal of Artificial Intelligence Research 72:185–213, 2021.

• Single-machine scheduling with an external resource
  with Dirk Briskorn and Morteza Davari
  in European Journal of Operational Research 293:457-468, 2021.

• Rerouting flows when links fail
  with S. Thomas McCormick and Gianpaolo Oriolo
  in SIAM Journal on Discrete Mathematics 34:2082–2107, 2020.
  (conference version: ICALP 2017)

• The Complexity of Computing a Robust Flow
  with Yann Disser
  in Operations Research Letters 48:18–23, 2020.

• New and simple algorithms for stable flow problems
  with Ágnes Cseh
  in Algorithmica 81:2557–2591, 2019.
  (conference version: WG 2017)

• On Index Policies for Stochastic Minsum Scheduling
  with Franziska Eberle, Felix Fischer, and Nicole Megow
  in Operations Research Letters 47:213–218, 2019.

• Robust Randomized Matchings
  with Martin Skutella and José A. Soto
  in Mathematics of Operations Research 43:675-692, 2018.
  (conference version: SODA 2015)

• Many-to-one matchings with lower quotas: Algorithms and complexity
  with Ashwin Arulselvan, Ágnes Cseh, Martin Groß, and David Manlove
  in Algorithmica 80:185–208, 2018.
  (conference version: ISAAC 2015)

• Reference Points and Approximation Algorithms in Multicriteria Discrete Optimization
  with Christina Büsing, Kai-Simon Goetzmann, and Sebastian Stiller
  in European Journal of Operational Research 260:829-840, 2017.

• Fare Evasion in Transit Networks
  with José Correa, Tobias Harks, and Vincent J.C. Kreuzen
  in Operations Research 65:165–183, 2017.

• Protection of flows under targeted attacks
  with S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, and Martin Skutella
  in Operations Research Letters 45:53–59, 2017.

• An Integrated Approach to Tactical Transportation Planning in Logistics Networks
  with Tobias Harks, Felix G. König, Alexander Richter, and Jens Schulz
  in Transportation Science 50:439–460, 2016.
  Finalist of the EURO Excellence in Practice Award 2016.
  Winner of the 2017 INFORMS/TSL Outstanding Paper Award in Freight Transportation and Logistics.

• Degree-constrained orientations of embedded graphs
  with Yann Disser
  in Journal of Combinatorial Optimization 31:758–773, 2016.
  (conference version: ISAAC 2012)

• Strong LP formulations for scheduling splittable jobs on unrelated machines
  with José Correa, Alberto Marchetti-Spaccamela, Leen Stougie, Ola Svensson, Víctor Verdugo, and José Verschae
  in Mathematical Programming 154:305–328, 2015.
  (conference version: IPCO 2014)

• Abstract flows over time: A first step towards solving dynamic packing problems
  with Jan-Philipp W. Kappmeier and Britta Peis
  in Theoretical Computer Science 544:74–83, 2014.
  (conference version: ISAAC 2012)

• Stable Flows over Time
  with Ágnes Cseh and Martin Skutella
  in Algorithms 6:532–545, 2013.
  (conference version: MATCH-UP 2012)

• Approximation Algorithms for Capacitated Location Routing
  with Tobias Harks and Felix G. König
  in Transportation Science 47:3–22, 2013.

Articles in Refereed Conference Proceedings 

• Decomposing Probability Marginals Beyond Affine Requirements
  in Integer Programming and Combinatorial Optimization (IPCO 2024),
  volume 14679 of Lecture Notes in Computer Science, pp. 309–322, Springer, 2024.

• Decomposition of Probability Marginals for Security Games in Abstract Networks
  in Integer Programming and Combinatorial Optimization (IPCO 2023),
  volume 13904 of Lecture Notes in Computer Science, pp. 306–318, Springer, 2023.

• Multi-Leader Congestion Games with an Adversary
  with Tobias Harks, Mona Henle, Max Klimm, Anja Schedel
  in Proceedings of 36th AAAI Conference on Artificial Intelligence (AAAI 2022),
  pp. 5068–5075, AAAI Press, 2022.

• The popular assignment problem: when cardinality is more important than popularity
  with Tellikepalli Kavitha, Tamás Király, Ildikó Schlotter, and Ulrike Schmidt-Kraepelin
  in Proceedings of the Annual 2022 ACM-SIAM Symposium on Discrete Algorithms (SODA 2022),
  pp. 103–123, SIAM, 2022.

• Maintaining Perfect Matchings at Low Cost
  with Ulrike Schmidt-Kraepelin and José Verschae
  in 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019),
  volume 132 of Leibniz International Proceedings in Informatics, pp. 82:1–82:14, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2019.

• A Local-Search Algorithm for Steiner Forest
  with Martin Groß, Anupam Gupta, Amit Kumar, Daniel R. Schmidt, Melanie Schmidt, and José Verschae
  in 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.

• Adaptivity in Network Interdiction
  with Bastián Bahamondes, José Correa, and Gianpaolo Oriolo
  in Decision and Game Theory for Security (GameSec 2017),
  volume 10575 of Lecture Notes in Computer Science, pp. 40–52, Springer, 2017.

• Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
  with Andreas Bley and Benjamin Müller
  in Algorithms – ESA 2013,
  volume 8125 of Lecture Notes in Computer Science, pp. 707–718, Springer, 2013.

• Multi-dimensional commodity covering for tariff selection in transportation
  with Felix G. König and Alexander Richter
  in 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.

• Lattices and maximum flow algorithms in planar graphs
  with Britta Peis
  in Graph-Theoretic Concepts in Computer Science (WG 2010),
  volume 6410 of Lecture Notes in Computer Science, pp. 324–335, Springer, 2010.

Unpublished Notes

• An Ω(∆1/2) Gap example on the (W)SEPT Policy
  with Wang Chi Cheung, Felix Fischer, and Nicole Megow.

• Electric Vehicle Valet
  with Ali Khodabakhsh, Jimmy Horn, Evdokia Nikolova, and Emmanouil Pountourakis.

PhD Thesis

• Network flows and network design in theory and practice
  TU Berlin, 2013. Winner of the Klaus Tschira Preis für verständliche Wissenschaft 2014
  (accompanying article: Mathematischer Modellbau in Bild der Wissenschaft plus, October 2014).

Diploma Thesis

• Lattices and maximum flow algorithms in planar graphs
  TU Berlin 2009. Awarded best degree at Dies Mathematicus of TU Berlin in 2009.