Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound - Gregory Z. Gutin; Eun Jung Kim 002; Matthias Mnich; Anders Yeo (CoRR, 2009)

Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks. - Leo van Iersel; Steven Kelk; Matthias Mnich (J. Bioinform. Comput. Biol., 2009)

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. - Michael R. Fellows; Daniel Lokshtanov; Neeldhara Misra; Matthias Mnich; Frances A. Rosamond; Saket Saurabh 001 (Theory Comput. Syst., 2009)

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 (ESA (1), 2010)

Ranking and Drawing in Subexponential Time. - Henning Fernau; Fedor V. Fomin; Daniel Lokshtanov; Matthias Mnich; Geevarghese Philip; Saket Saurabh 001 (IWOCA, 2010)

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels - Gregory Z. Gutin; Leo van Iersel; Matthias Mnich; Anders Yeo (CoRR, 2010)

Betweenness parameterized above tight lower bound. - Gregory Z. Gutin; Eun Jung Kim 002; Matthias Mnich; Anders Yeo (J. Comput. Syst. Sci., 2010)

Planar k-Path in Subexponential Time and Polynomial Space. - Daniel Lokshtanov; Matthias Mnich; Saket Saurabh 001 (WG, 2011)

Book review. - Matthias Mnich (Oper. Res. Lett., 2011)

A linear kernel for planar connected dominating set. - Daniel Lokshtanov; Matthias Mnich; Saket Saurabh 001 (Theor. Comput. Sci., 2011)

Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. - Danny Hermelin; Matthias Mnich; Erik Jan van Leeuwen (ESA, 2012)

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. - Matthias Mnich; Geevarghese Philip; Saket Saurabh 001; Ondrej Suchý 001 (FSTTCS, 2012)

Bisections above Tight Lower Bounds. - Matthias Mnich; Rico Zenklusen (WG, 2012)

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. - Gregory Z. Gutin; Leo van Iersel; Matthias Mnich; Anders Yeo (J. Comput. Syst. Sci., 2012)

Induced Matchings in Subcubic Planar Graphs. - Ross J. Kang; Matthias Mnich; Tobias Müller 001 (SIAM J. Discret. Math., 2012)

Improved integrality gap upper bounds for TSP with distances one and two. - Matthias Mnich; Tobias Mömke (CoRR, 2013)

Scheduling Meets Fixed-Parameter Tractability. - Matthias Mnich; Andreas Wiese (CoRR, 2013)

Feedback Vertex Sets in Tournaments. - Serge Gaspers; Matthias Mnich (J. Graph Theory, 2013)

Kernel and fast algorithm for dense triplet inconsistency. - Sylvain Guillemot; Matthias Mnich (Theor. Comput. Sci., 2013)

Treewidth Computation and Kernelization in the Parallel External Memory Model. - Riko Jacob; Tobias Lieber; Matthias Mnich (IFIP TCS, 2014)

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. - Danny Hermelin; Matthias Mnich; Erik Jan van Leeuwen (Algorithmica, 2014)

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. - Matthias Mnich; Geevarghese Philip; Saket Saurabh 001; Ondrej Suchý 001 (J. Comput. Syst. Sci., 2014)

When Does Schwartz Conjecture Hold? - Matthias Mnich; Yash Raj Shrestha; Yongjie Yang 001 (IJCAI, 2015)

Max-Cut Parameterized Above the Edwards-Erdős Bound. - Robert Crowston; Mark Jones 001; Matthias Mnich (Algorithmica, 2015)

Scheduling and fixed-parameter tractability. - Matthias Mnich; Andreas Wiese (Math. Program., 2015)

Interval scheduling and colorful independent sets. - René van Bevern; Matthias Mnich; Rolf Niedermeier; Mathias Weller (J. Sched., 2015)

A 7/3-Approximation for Feedback Vertex Sets in Tournaments. - Matthias Mnich; Virginia Vassilevska Williams; László A. Végh (ESA, 2016)

On Routing Disjoint Paths in Bounded Treewidth Graphs. - Alina Ene; Matthias Mnich; Marcin Pilipczuk; Andrej Risteski (SWAT, 2016)

Large Independent Sets in Subquartic Planar Graphs. - Matthias Mnich (WALCOM, 2016)

Lower Bounds for Locally Highly Connected Graphs. - Anna Adamaszek; Michal Adamaszek; Matthias Mnich; Jens M. Schmidt (Graphs Comb., 2016)

Parameterized complexity dichotomy for Steiner Multicut. - Karl Bringmann; Danny Hermelin; Matthias Mnich; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2016)

Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. - Matthias Mnich; Ildikó Schlotter (SAGT, 2017)

Polynomial kernels for deletion to classes of acyclic digraphs. - Matthias Mnich; Erik Jan van Leeuwen (Discret. Optim., 2017)

Polynomial kernels for weighted problems. - Michael Etscheid; Stefan Kratsch; Matthias Mnich; Heiko Röglin (J. Comput. Syst. Sci., 2017)

Large Independent Sets in Triangle-Free Planar Graphs. - Zdenek Dvorák 001; Matthias Mnich (SIAM J. Discret. Math., 2017)

A Unifying Framework for Manipulation Problems. - Dusan Knop; Martin Koutecký; Matthias Mnich (AAMAS, 2018)

New Approximation Algorithms for (1, 2)-TSP. - Anna Adamaszek; Matthias Mnich; Katarzyna Paluch 001 (ICALP, 2018)

Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. - Michael Etscheid; Matthias Mnich (Algorithmica, 2018)

Parameterized complexity of machine scheduling: 15 open problems. - Matthias Mnich; René van Bevern (Comput. Oper. Res., 2018)

Time- and space-optimal algorithms for the many-visits TSP. - André Berger; László Kozma 002; Matthias Mnich; Roland Vincze (CoRR, 2018)

New deterministic algorithms for solving parity games. - Matthias Mnich; Heiko Röglin; Clemens Rösner (Discret. Optim., 2018)

Linear-time recognition of map graphs with outerplanar witness. - Matthias Mnich; Ignaz Rutter; Jens M. Schmidt (Discret. Optim., 2018)

Improved integrality gap upper bounds for traveling salesperson problems with distances one and two. - Matthias Mnich; Tobias Mömke (Eur. J. Oper. Res., 2018)

Improved bounds for minimal feedback vertex sets in tournaments. - Matthias Mnich; Eva-Lotta Teutrine (J. Graph Theory, 2018)

Big data algorithms beyond machine learning. - Matthias Mnich (Künstliche Intell., 2018)

New algorithms for maximum disjoint paths based on tree-likeness. - Krzysztof Fleszar 001; Matthias Mnich; Joachim Spoerhase (Math. Program., 2018)

Resolving Infeasibility of Linear Systems: A Parameterized Approach. - Alexander Göke; Lydia Mirabel Mendoza Cadena; Matthias Mnich (IPEC, 2019)

Multitype Integer Monoid Optimization and Applications. - Dusan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn (CoRR, 2019)

Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. - Kristóf Bérczi; André Berger; Matthias Mnich; Roland Vincze (CoRR, 2019)

Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs. - Danny Hermelin; Matthias Mnich; Simon Omlor (CoRR, 2019)

Domination When the Stars Are Out. - Danny Hermelin; Matthias Mnich; Erik Jan van Leeuwen; Gerhard J. Woeginger (ACM Trans. Algorithms, 2019)

Engineering Kernelization for Maximum Cut. - Damir Ferizovic; Demian Hespe; Sebastian Lamm; Matthias Mnich; Christian Schulz 003; Darren Strash (ALENEX, 2020)

Hitting Long Directed Cycles Is Fixed-Parameter Tractable. - Alexander Göke; Dániel Marx; Matthias Mnich (ICALP, 2020)

Solving Packing Problems with Few Small Items Using Rainbow Matchings. - Max Bannach; Sebastian Berndt 001; Marten Maack; Matthias Mnich; Alexandra Lassota; Malin Rau; Malte Skambath (MFCS, 2020)

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. - Matthias Mnich; Ildikó Schlotter (Algorithmica, 2020)

Dense Steiner problems: Approximation algorithms and inapproximability. - Marek Karpinski; Mateusz Lewandowski; Syed Mohammad Meesum; Matthias Mnich (CoRR, 2020)

Recent Advances in Practical Data Reduction. - Faisal N. Abu-Khzam; Sebastian Lamm; Matthias Mnich; Alexander Noe; Christian Schulz 003; Darren Strash (CoRR, 2020)

On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. - Aida Abiad; Sander Gribling; Domenico Lahaye; Matthias Mnich; Guus Regts; Lluís Vena; Gerard Verweij; Peter J. Zwaneveld (Discret. Optim., 2020)

Combinatorial n-fold integer programming and applications. - Dusan Knop; Martin Koutecký; Matthias Mnich (Math. Program., 2020)

Odd Multiway Cut in Directed Acyclic Graphs. - Karthekeyan Chandrasekaran; Matthias Mnich; Sahand Mozaffari (SIAM J. Discret. Math., 2020)

Dynamic Parameterized Problems and Algorithms. - Josh Alman; Matthias Mnich; Virginia Vassilevska Williams (ACM Trans. Algorithms, 2020)

Time- and Space-optimal Algorithm for the Many-visits TSP. - André Berger; László Kozma 002; Matthias Mnich; Roland Vincze (ACM Trans. Algorithms, 2020)

Voting and Bribing in Single-Exponential Time. - Dusan Knop; Martin Koutecký; Matthias Mnich (ACM Trans. Economics and Comput., 2020)

Reachability Switching Games. - John Fearnley; Martin Gairing; Matthias Mnich; Rahul Savani (Log. Methods Comput. Sci., 2021)

Parameterized complexity of configuration integer programs. - Dusan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn (Oper. Res. Lett., 2021)

Recent Advances in Practical Data Reduction. - Faisal N. Abu-Khzam; Sebastian Lamm; Matthias Mnich; Alexander Noe; Christian Schulz 003; Darren Strash (Algorithms for Big Data, 2022)

Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems. - Kristóf Bérczi; Matthias Mnich; Roland Vincze (CoRR, 2022)

An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. - Ariel Kulik; Matthias Mnich; Hadas Shachnai (CoRR, 2022)

Resolving Infeasibility of Linear Systems: A Parameterized Approach. - Kristóf Bérczi; Alexander Göke; Lydia Mirabel Mendoza Cadena; Matthias Mnich (CoRR, 2022)

Parameterized algorithms for generalizations of Directed Feedback Vertex Set. - Alexander Göke; Dániel Marx; Matthias Mnich (Discret. Optim., 2022)

A 3/2-Approximation for the Metric Many-Visits Path TSP. - Kristóf Bérczi; Matthias Mnich; Roland Vincze (SIAM J. Discret. Math., 2022)

Hitting Weighted Even Cycles in Planar Graphs. - Alexander Göke; Jochen Könemann; Matthias Mnich; Hao Sun (SIAM J. Discret. Math., 2022)

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 (ESA, 2023)

A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. - Max A. Deppert; Matthias Kaul; Matthias Mnich (ESA, 2023)

Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. - Ariel Kulik; Matthias Mnich; Hadas Shachnai (FOCS, 2023)

Checkpoint Placement for Systematic Fault-Injection Campaigns. - Christian Dietrich 001; Tim-Marek Thomas; Matthias Mnich (ICCAD, 2023)

New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. - Sebastian Berndt 001; Hauke Brinkop; Klaus Jansen; Matthias Mnich; Tobias Stamm (ISAAC, 2023)

High-multiplicity N-fold IP via configuration LP. - Dusan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn (Math. Program., 2023)

A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP. - Susanne Armbruster; Matthias Mnich; Martin Nägele (APPROX/RANDOM, 2024)

No Polynomial Kernels for Knapsack. - Klaus Heeger; Danny Hermelin; Matthias Mnich; Dvir Shabtay (ICALP, 2024)

Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities. - Laura Codazzi; Gergely Csáji; Matthias Mnich (IJCAI, 2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. - Matthias Kaul; Matthias Mnich; Hendrik Molter (IPEC, 2024)

New Support Size Bounds and Proximity Bounds for Integer Linear Programming. - Sebastian Berndt 001; Matthias Mnich; Tobias Stamm (SOFSEM, 2024)

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. - Parinya Chalermsook; Matthias Kaul; Matthias Mnich; Joachim Spoerhase; Sumedha Uniyal; Daniel Vaz 001 (ACM Trans. Algorithms, 2024)

Serial batching to minimize the weighted number of tardy jobs. - Danny Hermelin; Matthias Mnich; Simon Omlor (J. Sched., 2024)

A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like Multigraphs. - Ebrahim Ghorbani; Jonah Leander Hoff; Matthias Mnich (STACS, 2025)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. - Matthias Kaul; Kelin Luo; Matthias Mnich; Heiko Röglin (STACS, 2025)

A survey on graph problems parameterized above and below guaranteed values. - Gregory Z. Gutin; Matthias Mnich (Comput. Sci. Rev., 2025)