Lattices and Maximum Flow Algorithms in Planar Graphs. - Jannik Matuschke (CTW, 2010)

Lattices and Maximum Flow Algorithms in Planar Graphs. - Jannik Matuschke; Britta Peis (WG, 2010)

Multi-Dimensional Commodity Covering for Tariff Selection in Transportation. - Felix G. König; Jannik Matuschke; Alexander T. Richter (ATMOS, 2012)

Flows over Time with Negative Transit Times and Arc Release Dates. - Sandro Bosio; Jan-Philipp W. Kappmeier; Jannik Matuschke; Britta Peis; Martin Skutella (CTW, 2012)

Abstract Flows over Time. - Jan-Philipp W. Kappmeier; Jannik Matuschke; Britta Peis (CTW, 2012)

The Power of Compromise - Christina Büsing; Kai-Simon Goetzmann; Jannik Matuschke; Sebastian Stiller (CoRR, 2012)

Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. - Jannik Matuschke; Andreas Bley; Benjamin Müller 002 (ESA, 2013)

Stable Flows over Time. - Ágnes Cseh; Jannik Matuschke; Martin Skutella (Algorithms, 2013)

Approximation Algorithms for Capacitated Location Routing. - Tobias Harks; Felix G. König; Jannik Matuschke (Transp. Sci., 2013)

The Student/Project Allocation problem with group projects. - Ashwin Arulselvan; Ágnes Cseh; Jannik Matuschke (CoRR, 2014)

Abstract flows over time: A first step towards solving dynamic packing problems. - Jan-Philipp W. Kappmeier; Jannik Matuschke; Britta Peis (Theor. Comput. Sci., 2014)

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. - Ashwin Arulselvan; Ágnes Cseh; Martin Groß 001; David F. Manlove; Jannik Matuschke (ISAAC, 2015)

Strong LP formulations for scheduling splittable jobs on unrelated machines. - José Correa 001; Alberto Marchetti-Spaccamela; Jannik Matuschke; Leen Stougie; Ola Svensson; Víctor Verdugo; José Verschae (Math. Program., 2015)

Degree-constrained orientations of embedded graphs. - Yann Disser; Jannik Matuschke (J. Comb. Optim., 2016)

An Integrated Approach to Tactical Transportation Planning in Logistics Networks. - Tobias Harks; Felix G. König; Jannik Matuschke; Alexander T. Richter; Jens Schulz (Transp. Sci., 2016)

Adaptivity in Network Interdiction. - Bastián Bahamondes; José Correa 001; Jannik Matuschke; Gianpaolo Oriolo (GameSec, 2017)

Reference points and approximation algorithms in multicriteria discrete optimization. - Christina Büsing; Kai-Simon Goetzmann; Jannik Matuschke; Sebastian Stiller (Eur. J. Oper. Res., 2017)

Fare Evasion in Transit Networks. - José Correa 001; Tobias Harks; Vincent J. C. Kreuzen; Jannik Matuschke (Oper. Res., 2017)

Protection of flows under targeted attacks. - Jannik Matuschke; S. Thomas McCormick; Gianpaolo Oriolo; Britta Peis; Martin Skutella (Oper. Res. Lett., 2017)

A Local-Search Algorithm for Steiner Forest. - Martin Groß 001; Anupam Gupta 001; Amit Kumar 001; Jannik Matuschke; Daniel R. Schmidt 001; Melanie Schmidt 001; José Verschae (ITCS, 2018)

Matchings with Lower Quotas: Algorithms and Complexity. - Ashwin Arulselvan; Ágnes Cseh; Martin Groß 001; David F. Manlove; Jannik Matuschke (Algorithmica, 2018)

Electric Vehicle Valet. - Ali Khodabakhsh 002; Orestis Papadigenopoulos; Jannik Matuschke; Jimmy Horn; Evdokia Nikolova; Emmanouil Pountourakis (CoRR, 2018)

Robust Randomized Matchings. - Jannik Matuschke; Martin Skutella; José A. Soto (Math. Oper. Res., 2018)

Maintaining Perfect Matchings at Low Cost. - Jannik Matuschke; Ulrike Schmidt-Kraepelin; José Verschae (ICALP, 2019)

New and Simple Algorithms for Stable Flow Problems. - Ágnes Cseh; Jannik Matuschke (Algorithmica, 2019)

On index policies for stochastic minsum scheduling. - Franziska Eberle; Felix A. Fischer; Jannik Matuschke; Nicole Megow (Oper. Res. Lett., 2019)

The complexity of computing a robust flow. - Yann Disser; Jannik Matuschke (Oper. Res. Lett., 2020)

Rerouting Flows when Links Fail. - Jannik Matuschke; S. Thomas McCormick; Gianpaolo Oriolo (SIAM J. Discret. Math., 2020)

Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (CoRR, 2021)

A Constant-Factor Approximation for Generalized Malleable Scheduling under M♮-Concave Processing Speeds. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (CoRR, 2021)

Single-machine scheduling with an external resource. - Dirk Briskorn; Morteza Davari; Jannik Matuschke (Eur. J. Oper. Res., 2021)

Pure Nash Equilibria in Resource Graph Games. - Tobias Harks; Max Klimm; Jannik Matuschke (J. Artif. Intell. Res., 2021)

The popular assignment problem: when cardinality is more important than popularity. - Telikepalli Kavitha; Tamás Király; Jannik Matuschke; Ildikó Schlotter; Ulrike Schmidt-Kraepelin (SODA, 2022)

Exact and Approximation Algorithms for the Expanding Search Problem. - Ben Hermans; Roel Leus; Jannik Matuschke (INFORMS J. Comput., 2022)

Popular branchings and their dual certificates. - Telikepalli Kavitha; Tamás Király; Jannik Matuschke; Ildikó Schlotter; Ulrike Schmidt-Kraepelin (Math. Program., 2022)

Decomposition of Probability Marginals for Security Games in Abstract Networks. - Jannik Matuschke (IPCO, 2023)

Bifactor approximation for location routing with vehicle and facility capacities. - Felipe Carrasco Heine; Antonia Demleitner; Jannik Matuschke (Eur. J. Oper. Res., 2023)

The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs. - Nicola Morandi; Roel Leus; Jannik Matuschke; Hande Yaman (Transp. Sci., 2023)

Malleable scheduling beyond identical machines. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (J. Sched., 2023)

Decomposing Probability Marginals Beyond Affine Requirements. - Jannik Matuschke (IPCO, 2024)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty. - Fei Wu; Erik Demeulemeester; Jannik Matuschke (CoRR, 2024)

A constant-factor approximation for generalized malleable scheduling under $M ^{ atural }$-concave processing speeds. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (Math. Program., 2024)

Assigning and Scheduling Generalized Malleable Jobs Under Subadditive or Submodular Processing Speeds. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (Oper. Res., 2025)

Multi-Leader Congestion Games with an Adversary. - Tobias Harks; Mona Henle; Max Klimm; Jannik Matuschke; Anja Schedel (J. Artif. Intell. Res., 2025)

Decomposition of probability marginals for security games in max-flow/min-cut systems. - Jannik Matuschke (Math. Program., 2025)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem. - Umang Bhaskar; Katharina Eickhoff; Lennart Kauther; Jannik Matuschke; Britta Peis; Laura Vargas Koch (CoRR, 2025)

Simultaneous Network Design with Restricted Link Usage. - Naonori Kakimura; Péter Madarasi; Jannik Matuschke; Kitti Varga (CoRR, 2025)