| 2026 | ICALP | A 9/4-Approximation for Directed Feedback Vertex Sets in Quasi-Transitive Digraphs. | Ebrahim Ghorbani, Matthias Mnich |
| 2025 | STACS | A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like Multigraphs. | Ebrahim Ghorbani, Jonah Leander Hoff, Matthias Mnich |
| 2025 | STACS | Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. | Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Rglin |
| 2024 | ICALP | No Polynomial Kernels for Knapsack. | Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay |
| 2024 | IJCAI | Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities. | Laura Codazzi, Gergely Csji, Matthias Mnich |
| 2024 | SOFSEM | New Support Size Bounds and Proximity Bounds for Integer Linear Programming. | Sebastian Berndt, Matthias Mnich, Tobias Stamm |
| 2023 | ESA | Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. | Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kant, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen |
| 2023 | ESA | A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. | Max A. Deppert, Matthias Kaul, Matthias Mnich |
| 2023 | FOCS | Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. | Ariel Kulik, Matthias Mnich, Hadas Shachnai |
| 2023 | ICCAD | Checkpoint Placement for Systematic Fault-Injection Campaigns. | Christian Dietrich, Tim-Marek Thomas, Matthias Mnich |
| 2023 | ISAAC | New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. | Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm |
| 2020 | ALENEX | Engineering Kernelization for Maximum Cut. | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
| 2020 | ICALP | Hitting Long Directed Cycles Is Fixed-Parameter Tractable. | Alexander Gke, Dniel Marx, Matthias Mnich |
| 2020 | MFCS | Solving Packing Problems with Few Small Items Using Rainbow Matchings. | Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath |
| 2019 | CIAC | Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. | Alexander Gke, Dniel Marx, Matthias Mnich |
| 2019 | SODA | A time- and space-optimal algorithm for the many-visits TSP. | Andr Berger, Lszl Kozma, Matthias Mnich, Roland Vincze |
| 2018 | ICALP | New Approximation Algorithms for (1, 2)-TSP. | Anna Adamaszek, Matthias Mnich, Katarzyna Paluch |
| 2018 | ICALP | Reachability Switching Games. | John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani |
| 2017 | ESA | Combinatorial n-fold Integer Programming and Applications. | Dusan Knop, Martin Kouteck, Matthias Mnich |
| 2017 | ICALP | Dynamic Parameterized Problems and Algorithms. | Josh Alman, Matthias Mnich, Virginia Vassilevska Williams |
| 2017 | STACS | Voting and Bribing in Single-Exponential Time. | Dusan Knop, Martin Kouteck, Matthias Mnich |
| 2017 | SAGT | Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. | Matthias Mnich, Ildik Schlotter |
| 2016 | ESA | New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. | Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase |
| 2016 | ESA | A 7/3-Approximation for Feedback Vertex Sets in Tournaments. | Matthias Mnich, Virginia Vassilevska Williams, Lszl A. Vgh |
| 2016 | ISAAC | Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. | Michael Etscheid, Matthias Mnich |
| 2016 | LATIN | New Deterministic Algorithms for Solving Parity Games. | Matthias Mnich, Heiko Rglin, Clemens Rsner |
| 2016 | STACS | Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. | Matthias Mnich, Erik Jan van Leeuwen |
| 2016 | WALCOM | Large Independent Sets in Subquartic Planar Graphs. | Matthias Mnich |
| 2015 | IJCAI | When Does Schwartz Conjecture Hold? | Matthias Mnich, Yash Raj Shrestha, Yongjie Yang |
| 2015 | MFCS | Polynomial Kernels for Weighted Problems. | Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Rglin |
| 2015 | STACS | Parameterized Complexity Dichotomy for Steiner Multicut. | Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen |
| 2014 | ESA | Large Independent Sets in Triangle-Free Planar Graphs. | Zdenek Dvork, Matthias Mnich |
| 2014 | IPCO | Scheduling and Fixed-Parameter Tractability. | Matthias Mnich, Andreas Wiese |
| 2012 | ESA | Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen |
| 2012 | ICALP | Max-Cut Parameterized above the Edwards-Erdős Bound. | Robert Crowston, Mark Jones, Matthias Mnich |
| 2012 | ISAAC | Interval Scheduling and Colorful Independent Sets. | Ren van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller |
| 2012 | WG | Bisections above Tight Lower Bounds. | Matthias Mnich, Rico Zenklusen |
| 2011 | ICALP | Domination When the Stars Are Out. | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger |
| 2011 | WG | Planar k-Path in Subexponential Time and Polynomial Space. | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
| 2010 | ESA | Feedback Vertex Sets in Tournaments. | Serge Gaspers, Matthias Mnich |
| 2010 | ESA | All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. | Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo |
| 2010 | ESA | Induced Matchings in Subcubic Planar Graphs. | Ross J. Kang, Matthias Mnich, Tobias Mller |
| 2010 | IWOCA | Ranking and Drawing in Subexponential Time. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
| 2010 | TAMC | Kernel and Fast Algorithm for Dense Triplet Inconsistency. | Sylvain Guillemot, Matthias Mnich |
| 2009 | TAMC | Linear Kernel for Planar Connected Dominating Set. | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |