| 2026 | IPCO | Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding. | Zachary Friggstad, Tobias Mmke |
| 2026 | IWOCA | Hardness of SetCover Reoptimization. | Klaus Jansen, Tobias Mmke, Bjrn Schumacher |
| 2025 | MFCS | Approximating Prize-Collecting Variants of TSP. | Morteza Alimi, Tobias Mmke, Michael Ruderer |
| 2025 | SODA | Approximating Traveling Salesman Problems Using a Bridge Lemma. | Martin Bhm, Zachary Friggstad, Tobias Mmke, Joachim Spoerhase |
| 2025 | STACS | Improved Approximation Algorithms for (1, 2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model. | Sharareh Alipour, Ermiya Farokhnejad, Tobias Mmke |
| 2023 | IWOCA | Online Knapsack with Removal and Recourse. | Hans-Joachim Bckenhauer, Ralf Klasing, Tobias Mmke, Peter Rossmanith, Moritz Stocker, David Wehner |
| 2023 | WAOA | Approximating Maximum Edge 2-Coloring by Normalizing Graphs. | Tobias Mmke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze |
| 2022 | INOC | Coworking Scheduling with Network Flows. | Mariia Anapolska, Christina Bsing, Tabea Krabs, Tobias Mmke |
| 2022 | IPCO | A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. | Vincent Cohen-Addad, Tobias Mmke, Victor Verdugo |
| 2022 | SODA | A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. | Waldo Glvez, Arindam Khan, Mathieu Mari, Tobias Mmke, Madhusudhan Reddy Pittu, Andreas Wiese |
| 2022 | SODA | Unsplittable Flow on a Path: The Game!. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2022 | STOC | A PTAS for unsplittable flow on a path. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2021 | ESA | Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2020 | ICALP | Breaking the Barrier of 2 for the Storage Allocation Problem. | Tobias Mmke, Andreas Wiese |
| 2018 | ESA | A QPTAS for Gapless MEC. | Shilpa Garg, Tobias Mmke |
| 2018 | STOC | A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese, Hang Zhou |
| 2018 | STACS | Approximating Airports and Railways. | Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mmke |
| 2017 | SODA | Maximum Scatter TSP in Doubling Metrics. | Lszl Kozma, Tobias Mmke |
| 2017 | SODA | To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese, Hang Zhou |
| 2016 | IPCO | Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. | Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mmke, Victor Verdugo, Andreas Wiese |
| 2016 | STACS | Airports and Railways: Facility Location Meets Network Design. | Anna Adamaszek, Antonios Antoniadis, Tobias Mmke |
| 2016 | SOFSEM | The Complexity of Paging Against a Probabilistic Adversary. | Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Krlovic, Rastislav Krlovic, Tobias Mmke |
| 2015 | ICALP | A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem. | Tobias Mmke, Andreas Wiese |
| 2015 | SODA | New Approximation Schemes for Unsplittable Flow on a Path. | Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mmke, Andreas Wiese |
| 2014 | STACS | Randomized Online Algorithms with High Probability Guarantees. | Dennis Komm, Rastislav Krlovic, Richard Krlovic, Tobias Mmke |
| 2012 | CSR | On the Advice Complexity of the Set Cover Problem. | Dennis Komm, Richard Krlovic, Tobias Mmke |
| 2011 | FOCS | Approximating Graphic TSP by Matchings. | Tobias Mmke, Ola Svensson |
| 2011 | SOFSEM | Structural Properties of Hard Metric TSP Inputs - (Extended Abstract). | Tobias Mmke |
| 2010 | CIAC | The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mmke, Andreas Sprock, Bjrn Steffen |
| 2010 | CIAC | Improved Approximations for TSP with Simple Precedence Constraints. | Hans-Joachim Bckenhauer, Ralf Klasing, Tobias Mmke, Monika Steinov |
| 2009 | CPM | Reoptimization of the Shortest Common Superstring Problem. | Davide Bil, Hans-Joachim Bckenhauer, Dennis Komm, Richard Krlovic, Tobias Mmke, Sebastian Seibert, Anna Zych |
| 2009 | ISAAC | On the Advice Complexity of Online Problems. | Hans-Joachim Bckenhauer, Dennis Komm, Rastislav Krlovic, Richard Krlovic, Tobias Mmke |
| 2008 | DLT | On the Size Complexity of Rotating and Sweeping Automata. | Christos A. Kapoutsis, Richard Krlovic, Tobias Mmke |
| 2008 | SOFSEM | On the Hardness of Reoptimization. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Tobias Mmke, Peter Widmayer |
| 2007 | FUN | Efficient Algorithms for the Spoonerism Problem. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Richard Krlovic, Tobias Mmke, Kathleen Steinhfel |