Matthias Mnich

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 91

Top Venues

Publications

Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
No Polynomial Kernels for Knapsack. ICALP (2024)
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20 (1) (2024)
Susanne Armbruster, Matthias Mnich, Martin Nägele
A (3/2+1/e)-Approximation Algorithm for Ordered TSP. CoRR (2024)
Sebastian Berndt, Matthias Mnich, Tobias Stamm
New Support Size Bounds and Proximity Bounds for Integer Linear Programming. SOFSEM (2024)
Max Deppert, Matthias Kaul, Matthias Mnich
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. CoRR (2023)
Christian Dietrich, Tim-Marek Thomas, Matthias Mnich
Checkpoint Placement for Systematic Fault-Injection Campaigns. ICCAD (2023)
Max Deppert, Matthias Kaul, Matthias Mnich
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. ESA (2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR (2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA (2023)
Christian Dietrich, Tim-Marek Thomas, Matthias Mnich
Checkpoint Placement for Systematic Fault-Injection Campaigns. CoRR (2023)
Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. CoRR (2023)
Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. ISAAC (2023)
Ariel Kulik, Matthias Mnich, Hadas Shachnai
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS (2023)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
High-multiplicity N-fold IP via configuration LP. Math. Program. 200 (1) (2023)
Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
No Polynomial Kernels for Knapsack. CoRR (2023)
Ariel Kulik, Matthias Mnich, Hadas Shachnai
An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR (2022)
Gregory Z. Gutin, Matthias Mnich
A Survey on Graph Problems Parameterized Above and Below Guaranteed Values. CoRR (2022)
Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun
Hitting Weighted Even Cycles in Planar Graphs. SIAM J. Discret. Math. 36 (4) (2022)
Alexander Göke, Dániel Marx, Matthias Mnich
Parameterized algorithms for generalizations of Directed Feedback Vertex Set. Discret. Optim. 46 (2022)
David Fischer, Julian Golak, Matthias Mnich
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling. CoRR (2022)
Kristóf Bérczi, Matthias Mnich, Roland Vincze
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems. CoRR (2022)
Kristóf Bérczi, Alexander Göke, Lydia Mirabel Mendoza Cadena, Matthias Mnich
Resolving Infeasibility of Linear Systems: A Parameterized Approach. CoRR (2022)
Kristóf Bérczi, Matthias Mnich, Roland Vincze
A 3/2-Approximation for the Metric Many-Visits Path TSP. SIAM J. Discret. Math. 36 (4) (2022)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49 (6) (2021)
Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun
Hitting Weighted Even Cycles in Planar Graphs. APPROX-RANDOM (2021)
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR (2021)
Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun
Hitting Weighted Even Cycles in Planar Graphs. CoRR (2021)
John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
Reachability Switching Games. Log. Methods Comput. Sci. 17 (2) (2021)
Dusan Knop, Martin Koutecký, Matthias Mnich
Combinatorial n-fold integer programming and applications. Math. Program. 184 (1) (2020)
Marek Karpinski, Mateusz Lewandowski, Syed Mohammad Meesum, Matthias Mnich
Dense Steiner problems: Approximation algorithms and inapproximability. CoRR (2020)
Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari
Odd Multiway Cut in Directed Acyclic Graphs. SIAM J. Discret. Math. 34 (2) (2020)
Alexander Göke, Dániel Marx, Matthias Mnich
Hitting Long Directed Cycles is Fixed-Parameter Tractable. CoRR (2020)
Josh Alman, Matthias Mnich, Virginia Vassilevska Williams
Dynamic Parameterized Problems and Algorithms. ACM Trans. Algorithms 16 (4) (2020)
Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash
Engineering Kernelization for Maximum Cut. ALENEX (2020)
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
Solving Packing Problems with Few Small Items Using Rainbow Matchings. CoRR (2020)
Aida Abiad, Sander Gribling, Domenico Lahaye, Matthias Mnich, Guus Regts, Lluís Vena, Gerard Verweij, Peter J. Zwaneveld
On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. Discret. Optim. 37 (2020)
Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash
Recent Advances in Practical Data Reduction. CoRR (2020)
Dusan Knop, Martin Koutecký, Matthias Mnich
Voting and Bribing in Single-Exponential Time. ACM Trans. Economics and Comput. 8 (3) (2020)
André Berger, László Kozma, Matthias Mnich, Roland Vincze
Time- and Space-optimal Algorithm for the Many-visits TSP. ACM Trans. Algorithms 16 (3) (2020)
Alexander Göke, Dániel Marx, Matthias Mnich
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CoRR (2020)
Kristóf Bérczi, Matthias Mnich, Roland Vincze
A 3/2-Approximation for the Metric Many-visits Path TSP. CoRR (2020)
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
Solving Packing Problems with Few Small Items Using Rainbow Matchings. MFCS (2020)
Alexander Göke, Dániel Marx, Matthias Mnich
Hitting Long Directed Cycles Is Fixed-Parameter Tractable. ICALP (2020)
Matthias Mnich, Ildikó Schlotter
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Algorithmica 82 (5) (2020)
André Berger, László Kozma, Matthias Mnich, Roland Vincze
A time- and space-optimal algorithm for the many-visits TSP. SODA (2019)
Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash
Engineering Kernelization for Maximum Cut. CoRR (2019)
Alexander Göke, Dániel Marx, Matthias Mnich
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CIAC (2019)
Danny Hermelin, Matthias Mnich, Simon Omlor
Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs. CoRR (2019)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Multitype Integer Monoid Optimization and Applications. CoRR (2019)
Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. CoRR (2019)
Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
Domination When the Stars Are Out. ACM Trans. Algorithms 15 (2) (2019)
Alexander Göke, Lydia Mirabel Mendoza Cadena, Matthias Mnich
Resolving Infeasibility of Linear Systems: A Parameterized Approach. IPEC (2019)
Dusan Knop, Martin Koutecký, Matthias Mnich
Voting and Bribing in Single-Exponential Time. CoRR (2018)
Dusan Knop, Martin Koutecký, Matthias Mnich
A Unifying Framework for Manipulation Problems. CoRR (2018)
Dusan Knop, Martin Koutecký, Matthias Mnich
A Unifying Framework for Manipulation Problems. AAMAS (2018)
Matthias Mnich, Eva-Lotta Teutrine
Improved bounds for minimal feedback vertex sets in tournaments. J. Graph Theory 88 (3) (2018)
Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
Linear-time recognition of map graphs with outerplanar witness. Discret. Optim. 28 (2018)
John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
Reachability Switching Games. ICALP (2018)
Matthias Mnich
Big data algorithms beyond machine learning. Künstliche Intell. 32 (1) (2018)
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
New algorithms for maximum disjoint paths based on tree-likeness. Math. Program. 171 (1-2) (2018)
Michael Etscheid, Matthias Mnich
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. Algorithmica 80 (9) (2018)
Matthias Mnich, René van Bevern
Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100 (2018)
Matthias Mnich, Heiko Röglin, Clemens Rösner
New deterministic algorithms for solving parity games. Discret. Optim. 30 (2018)
André Berger, László Kozma, Matthias Mnich, Roland Vincze
Time- and space-optimal algorithms for the many-visits TSP. CoRR (2018)
Anna Adamaszek, Matthias Mnich, Katarzyna Paluch
New Approximation Algorithms for (1, 2)-TSP. ICALP (2018)
Matthias Mnich, Tobias Mömke
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two. Eur. J. Oper. Res. 266 (2) (2018)
Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari
Odd Multiway Cut in Directed Acyclic Graphs. CoRR (2017)
Matthias Mnich, Ildikó Schlotter
Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. SAGT (2017)
Matthias Mnich, Erik Jan van Leeuwen
Polynomial kernels for deletion to classes of acyclic digraphs. Discret. Optim. 25 (2017)
Zdenek Dvorák, Matthias Mnich
Large Independent Sets in Triangle-Free Planar Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Dusan Knop, Martin Koutecký, Matthias Mnich
Voting and Bribing in Single-Exponential Time. STACS (2017)
John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
Reachability Switching Games. CoRR (2017)
Dusan Knop, Martin Koutecký, Matthias Mnich
Combinatorial n-fold Integer Programming and Applications. CoRR (2017)
Dusan Knop, Martin Koutecký, Matthias Mnich
Combinatorial n-fold Integer Programming and Applications. ESA (2017)
Josh Alman, Matthias Mnich, Virginia Vassilevska Williams
Dynamic Parameterized Problems and Algorithms. CoRR (2017)
Josh Alman, Matthias Mnich, Virginia Vassilevska Williams
Dynamic Parameterized Problems and Algorithms. ICALP (2017)
Matthias Mnich, René van Bevern
Parameterized complexity of machine scheduling: 15 open problems. CoRR (2017)
Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
Polynomial kernels for weighted problems. J. Comput. Syst. Sci. 84 (2017)
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. ESA (2016)
Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt
Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. 32 (5) (2016)
Michael Etscheid, Matthias Mnich
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. ISAAC (2016)
Matthias Mnich, Virginia Vassilevska Williams, László A. Végh
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. ESA (2016)
Matthias Mnich, Eva-Lotta Teutrine
Improved Bounds for Minimal Feedback Vertex Sets in Tournaments. IPEC (2016)
Matthias Mnich, Heiko Röglin, Clemens Rösner
New Deterministic Algorithms for Solving Parity Games. LATIN (2016)
Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
Parameterized complexity dichotomy for Steiner Multicut. J. Comput. Syst. Sci. 82 (6) (2016)
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. CoRR (2016)
Matthias Mnich, Ildikó Schlotter
Stable Marriage with Covering Constraints: A Complete Computational Trichotomy. CoRR (2016)
Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
Linear-Time Recognition of Map Graphs with Outerplanar Witness. SWAT (2016)
Matthias Mnich, Erik Jan van Leeuwen
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. STACS (2016)
Matthias Mnich
Large Independent Sets in Subquartic Planar Graphs. WALCOM (2016)
Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski
On Routing Disjoint Paths in Bounded Treewidth Graphs. SWAT (2016)
Matthias Mnich, Yash Raj Shrestha, Yongjie Yang
When Does Schwartz Conjecture Hold? IJCAI (2015)
Matthias Mnich, Heiko Röglin, Clemens Rösner
New Deterministic Algorithms for Solving Parity Games. CoRR (2015)
Matthias Mnich, Andreas Wiese
Scheduling and fixed-parameter tractability. Math. Program. 154 (1-2) (2015)
Robert Crowston, Mark Jones, Matthias Mnich
Max-Cut Parameterized Above the Edwards-Erdős Bound. Algorithmica 72 (3) (2015)
Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski
On Routing Disjoint Paths in Bounded Treewidth Graphs. CoRR (2015)
Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
Polynomial Kernels for Weighted Problems. MFCS (2) (2015)
Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
Parameterized Complexity Dichotomy for Steiner Multicut. STACS (2015)
Matthias Mnich, Virginia Vassilevska Williams, László A. Végh
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. CoRR (2015)
Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
Polynomial Kernels for Weighted Problems. CoRR (2015)

Matthias Mnich.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthias Mnich