| 2026 | IPCO | Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction. | Jannik Matuschke |
| 2025 | ESA | 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 |
| 2024 | IPCO | Decomposing Probability Marginals Beyond Affine Requirements. | Jannik Matuschke |
| 2023 | IPCO | Decomposition of Probability Marginals for Security Games in Abstract Networks. | Jannik Matuschke |
| 2022 | AAAI | Multi-Leader Congestion Games with an Adversary. | Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel |
| 2022 | IPCO | A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds. | Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos |
| 2022 | SODA | The popular assignment problem: when cardinality is more important than popularity. | Telikepalli Kavitha, Tams Kirly, Jannik Matuschke, Ildik Schlotter, Ulrike Schmidt-Kraepelin |
| 2020 | IPCO | Popular Branchings and Their Dual Certificates. | Telikepalli Kavitha, Tams Kirly, Jannik Matuschke, Ildik Schlotter, Ulrike Schmidt-Kraepelin |
| 2019 | ICALP | Maintaining Perfect Matchings at Low Cost. | Jannik Matuschke, Ulrike Schmidt-Kraepelin, Jos Verschae |
| 2017 | ICALP | Rerouting Flows When Links Fail. | Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo |
| 2017 | WG | New and Simple Algorithms for Stable Flow Problems. | gnes Cseh, Jannik Matuschke |
| 2015 | ISAAC | Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. | Ashwin Arulselvan, gnes Cseh, Martin Gro, David F. Manlove, Jannik Matuschke |
| 2015 | SODA | Robust randomized matchings. | Jannik Matuschke, Martin Skutella, Jos A. Soto |
| 2014 | IPCO | Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. | Jos R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, Jos Verschae |
| 2013 | ESA | Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. | Jannik Matuschke, Andreas Bley, Benjamin Mller |
| 2012 | ATMOS | Multi-Dimensional Commodity Covering for Tariff Selection in Transportation. | Felix G. Knig, Jannik Matuschke, Alexander T. Richter |
| 2012 | ISAAC | Degree-Constrained Orientations of Embedded Graphs. | Yann Disser, Jannik Matuschke |
| 2012 | ISAAC | Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems. | Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis |
| 2010 | WG | Lattices and Maximum Flow Algorithms in Planar Graphs. | Jannik Matuschke, Britta Peis |