2026

• A 9/4-approximation for directed feedback vertex sets in quasi-transitive igraphs
  Ghorbani, Ebrahim; Mnich, Matthias
  53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)
  Open Access | Publisher DOI
• Optimization of modal reflection parameters of PCB connector and common-mode choke using Gaussian process regression and segmentation
  Kvizhinadze, Mikheil; Talibzade, Nazim; Yang, Cheng; Mnich, Matthias; Schuster, Christian
  International Symposium on Electromagnetic Compatibility, EMC Europe 2026
  Open Access

2025

• A survey on graph problems parameterized above and below guaranteed values
  Gutin, Gregory Z.; Mnich, Matthias
  Computer Science Review 58: 100795 (2025)
  Open Access | Publisher DOI
• A quasi-polynomial time algorithm for multi-arrival on tree-like multigraphs
  Ghorbani, Ebrahim; Hoff, Jonah Leander; Mnich, Matthias
  42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025
  Open Access | Publisher DOI
• Approximate minimum tree cover in all symmetric monotone norms simultaneously
  Kaul, Matthias; Luo, Kelin; Mnich, Matthias; Röglin, Heiko
  42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025
  Open Access | Publisher DOI
• Space-efficient parameterized algorithms on graphs of low shrubdepth
  Bergougnoux, Benjamin; Chekan, Vera; Ganian, Robert; Kanté, Mamadou Moustapha; Mnich, Matthias; Oum, Sang-il; Pilipczuk, Michał; Leeuwen, Erik Jan van
  ACM Transactions on Computation Theory 17 (3): 1-42 (2025)
  Open Access | Publisher DOI

2024

• Serial batching to minimize the weighted number of tardy jobs
  Hermelin, Danny; Mnich, Matthias; Omlor, Simon
  Journal of Scheduling 27 (6): 545-556 (2024)
  Open Access | Publisher DOI
• Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
  Kaul, Matthias; Mnich, Matthias; Molter, Hendrik
  19th International Symposium on Parameterized and Exact Computation, IPEC 2024
  Open Access | Publisher DOI
• A (3/2 + 1/e)-Approximation algorithm for ordered TSP
  Armbruster, Susanne; Mnich, Matthias; Nägele, Martin
  27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2024
  Open Access | Publisher DOI
• Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities
  Codazzi, Laura; Csáji, Gergely; Mnich, Matthias
  33rd International Joint Conference on Artificial Intelligence, IJCAI 2024
  Open Access | Publisher DOI
• No polynomial kernels for knapsack
  Heeger, Klaus; Hermelin, Danny; Mnich, Matthias; Shabtay, Dvir
  51st EATCS International Colloquium on Automata, Languages and Programming, ICALP 2024
  Open Access | Publisher DOI
• New support bounds and proximity bounds for integer linear programming
  Berndt, Sebastian; Mnich, Matthias; Stamm, Tobias
  49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024
  Publisher DOI
• Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
  Chalermsook, Parinya; Kaul, Matthias; Mnich, Matthias; Spoerhase, Joachim; Uniyal, Sumedha; Vaz, Daniel
  ACM Transactions in Algorithms 20 (1): 6 (2024)
  Publisher DOI

2023

• Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding
  Kulik, Ariel; Mnich, Matthias; Shachnai, Hadas
  64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023
  Publisher DOI
• Checkpoint placement for systematic fault-injection campaigns
  Dietrich, Christian; Thomas, Tim-Marek; Mnich, Matthias
  42nd IEEE International Conference on Computer-Aided Design, ICCAD 2023
  Open Access | Publisher DOI
• A (3/2 + ε)-Approximation for multiple TSP with a variable number of depots
  Deppert, Max; Kaul, Matthias; Mnich, Matthias
  31st Annual European Symposium on Algorithms, ESA 2023
  Open Access | Publisher DOI
• High multiplicity N-fold IP via configuration LP
  Knop, Dušan; Koutecký, Martin; Levin, Asaf; Mnich, Matthias; Onn, Shmuel
  Mathematical Programming 200 (1): 199-227 (2023)
  Open Access | Publisher DOI
• Approximations for many-visits multiple traveling salesman problems
  Bérczi, Kristóf; Mnich, Matthias; Vincze, Roland
  Omega 116: 102816 (2023)
  Open Access | Publisher DOI
• Recent advances in practical data reduction
  Abu-Khzam, Faisal N.; Lamm, Sebastian; Mnich, Matthias; Noe, Alexander; Schulz, Christian; Strash, Darren
  Lecture notes in computer science 13201: 97-133 (2022)
  Open Access | Publisher DOI
• New support size bounds for integer programming, applied to makespan minimization on uniformly related machines
  Berndt, Sebastian; Brinkop, Hauke; Jansen, Klaus; Mnich, Matthias; Stamm, Tobias
  34th International Symposium on Algorithms and Computation, ISAAC 2023
  Open Access | Publisher DOI
• Space-efficient parameterized algorithms on graphs of low shrubdepth
  Bergougnoux, Benjamin; Chekan, Vera; Ganian, Robert; Kanté, Mamadou Moustapha; Mnich, Matthias; Oum, Sang-il; Pilipczuk, Michał; Leeuwen, Erik Jan van
  31st Annual European Symposium on Algorithms, ESA 2023
  Open Access | Publisher DOI

2022

• Parameterized algorithms for generalizations of directed feedback vertex set  
  Göke, Alexander; Marx, Dániel; Mnich, Matthias
  Discrete Optimization 46: 100740 (2022)
  Open Access | Publisher DOI
• A 3/2-approximation for the metric many-visits path TSP
  Bérczi, Kristóf; Mnich, Matthias; Vincze, Roland
  SIAM Journal on Discrete Mathematics 36 (4): 3030 (2022)
  Open Access | Publisher DOI
• Hitting weighted even cycles in planar graphs
  Göke, Alexander; Koenemann, Jochen; Mnich, Matthias; Sun, Hao
  SIAM Journal on Discrete Mathematics 36 (4): 2830-2862 (2022)
  Open Access | Publisher DOI

2021

• Parameterized complexity of configuration integer programs
  Knop, Dušan; Koutecký, Martin; Levin, Asaf; Mnich, Matthias; Onn, Shmuel
  Operations Research Letters 49 (6): 908-913 (2021)
  Open Access | Publisher DOI
• Hitting weighted even cycles in planar graphs
  Göke, Alexander; Koenemann, Jochen; Mnich, Matthias; Sun, Hao
  24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021
  Open Access | Publisher DOI
• Reachability switching games
  Fearnley, John; Gairing, Martin; Mnich, Matthias; Savani, Rahul
  Logical Methods in Computer Science 17 (2): 1-29 (2021)
  Open Access | Publisher DOI

2020

• Combinatorial n-fold integer programming and applications
  Knop, Dušan; Koutecký, Martin; Mnich, Matthias
  Mathematical Programming 184 (1/2): 1-34 (2020)
  Open Access | Publisher DOI
• On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes
  Abiad, Aida; Gribling, Sander; Lahaye, Domenico; Mnich, Matthias; Regts, Guus; Vena, Luis; Verweij, Gerard; Zwaneveld, Peter
  Discrete Optimization 37: 100565 (2020)
  Publisher DOI
• Voting and bribing in single-exponential time
  Knop, Dušan; Koutecký, Martin; Mnich, Matthias
  ACM Transactions on Economics and Computation 8 (3): 12 (2020)
  Open Access | Publisher DOI
• Stable matchings with covering constraints: a complete computational trichotomy
  Mnich, Matthias; Schlotter, Ildikó
  Algorithmica 82: 1136–1188 (2020)
  Open Access | Publisher DOI
• Engineering kernelization for maximum cut
  Ferizovic, Damir; Hespe, Demian; Lamm, Sebastian; Mnich, Matthias; Schulz, Christian; Strash, Darren
  22nd Symposium on Algorithm Engineering and Experiments, ALENEX 2020
  Publisher DOI
• Dynamic parameterized problems and algorithms
  Alman, Josh; Mnich, Matthias; Vassilevska Williams, Virginia
  ACM Transactions on Algorithms 16 (4): 45 (2020)
  Publisher DOI
• Hitting long directed cycles is fixed-parameter tractable
  Göke, Alexander; Marx, Dániel; Mnich, Matthias
  47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
  Open Access | Publisher DOI
• Odd multiway cut in directed acyclic graphs
  Chandrasekaran, Karthekeyan; Mnich, Matthias; Mozaffari, Sahand
  SIAM Journal on Discrete Mathematics 34 (2): 1385-1408 (2020)
  Publisher DOI
• Solving packing problems with few small items using rainbow matchings
  Bannach, Max; Berndt, Sebastian; Maack, Marten; Mnich, Matthias; Lassota, Alexandra; Rau, Malin; Skambath, Malte
  45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020
  Open Access | Publisher DOI
• Time- and space-optimal algorithm for the many-visits TSP
  Berger, André; Kozma, László; Mnich, Matthias; Vincze, Roland
  ACM Transactions on Algorithms 16 (3): 35 (2020)
  Publisher DOI

2019

• Resolving infeasibility of linear systems: a parameterized approach
  Göke, Alexander; Mendoza Cadena, Lydia Mirabel; Mnich, Matthias
  14th International Symposium on Parameterized and Exact Computation, IPEC 2019
  Open Access | Publisher DOI
• Multitype integer monoid optimization and applications
  Knop, Dušan; Koutecký, Martin; Levin, Asaf; Mnich, Matthias; Onn, Shmuel
  arXiv: 1909.07326 (2019)
  Open Access
• A time- and space-optimal algorithm for the many-visits TSP
  Berger, André; Kozma, László; Mnich, Matthias; Vincze, Roland
  30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
  Open Access | Publisher DOI
• Domination when the stars are out
  Hermelin, Danny; Mnich, Matthias; Leeuwen, Erik Jan van; Woeginger, Gerhard
  ACM Transactions on Algorithms 15 (2): 25 (2019)
  Publisher DOI
• Parameterized Algorithms for generalizations of directed feedback vertex set
  Göke, Alexander; Marx, Dániel; Mnich, Matthias
  11th International Conference on Algorithms and Complexity, CIAC 2019
  Publisher DOI

2018

• Parameterized complexity of machine scheduling: 15 open problems
  Mnich, Matthias; van Bevern, René
  Computers & operations research 100: 254-261 (2018)
  Publisher DOI
• New deterministic algorithms for solving parity games
  Mnich, Matthias; Röglin, Heiko; Rösner, Clemens
  Discrete Optimization 30: 73-95 (2018)
  Publisher DOI
• Linear-time recognition of map graphs with outerplanar witness
  Mnich, Matthias; Rutter, Ignaz; Schmidt, Jens M.
  Discrete Optimization 28: 63-77 (2018)
  Publisher DOI
• A unifying framework for manipulation problems
  Knop, Dušan; Koutecký, Martin; Mnich, Matthias
  17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018
  
• Improved integrality gap upper bounds for TSP with distances one and two
  Mnich, Matthias; Mömke, Tobias
  European Journal of Operational Research 266 (2): 436-457 (2018)
  Publisher DOI
• New algorithms for maximum disjoint paths based on tree-likeness
  Fleszar, Krzysztof; Mnich, Matthias; Spoerhase, Joachim
  Mathematical Programming 171: 433-461 (2018)
  Publisher DOI
• New approximation algorithms for (1,2)-TSP
  Adamaszek, Anna; Mnich, Matthias; Paluch, Katarzyna
  45th International Colloquium on Automata, Languages, and Programming, ICALP 2018
  Publisher DOI

2017

• Improved bounds for minimal feedback vertex sets in tournaments
  Mnich, Matthias; Teutrine, Eva Lotta
  Journal of Graph Theory 88 (3): 482-506 (2018)
  Open Access | Publisher DOI
• Linear kernels and linear-time algorithms for finding large cuts
  Etscheid, Michael; Mnich, Matthias
  Algorithmica 80 (9): 2574-2615 (2018)
  Open Access | Publisher DOI
• Big data algorithms beyond machine learning
  Mnich, Matthias
  Künstliche Intelligenz 32 (1): 9-17 (2018)
  Open Access | Publisher DOI
• Combinatorial n-fold integer programming and applications
  Knop, Dušan; Koutecký, Martin; Mnich, Matthias
  25th European Symposium on Algorithms, ESA 2017
  Open Access | Publisher DOI
• Dynamic parameterized problems and algorithms
  Alman, Josh; Mnich, Matthias; Vassilevska Williams, Virginia
  44th International Colloquium on Automata, Languages, and Programming, ICALP 2017
  Publisher DOI
• Polynomial kernels for deletion to classes of acyclic digraphs
  Mnich, Matthias; Leeuwen, Erik Jan van
  Discrete Optimization 25: 48-76 (2017)
  Publisher DOI
• Voting and bribing in single-exponential time
  Knop, Dušan; Koutecký, Martin; Mnich, Matthias
  34th Symposium on Theoretical Aspects of Computer Science, STACS 2017
  Publisher DOI
• Large independent sets in triangle-free planar graphs
  Dvořák, Zdeněk; Mnich, Matthias
  SIAM Journal on Discrete Mathematics (2017)
  Publisher DOI
• Polynomial kernels for weighted problems
  Etscheid, Michael; Kratsch, Stefan; Mnich, Matthias; Röglin, Heiko
  Journal of Computer and System Sciences 84: 1-10 (2017)
  Publisher DOI
• Stable marriage with covering constraints – a complete computational trichotomy
  Mnich, Matthias; Schlotter, Ildikó
  10th International Symposium on Algorithmic Game Theory, SAGT 2017
  Publisher DOI

2016

• Linear kernels and linear-time algorithms for finding large cuts
  Etscheid, Michael; Mnich, Matthias
  27th International Symposium on Algorithms and Computation, ISAAC 2016
  Open Access | Publisher DOI
• Parameterized complexity dichotomy for Steiner Multicut
  Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; Leeuwen, Erik Jan van
  Journal of Computer and System Sciences 82 (6): 1020-1043 (2016)
  Publisher DOI
• New algorithms for maximum disjoint paths based on tree-likeness
  Fleszar, Krzysztof; Mnich, Matthias; Spoerhase, Joachim
  24th European Symposium on Algorithms, ESA 2016
  Publisher DOI
• Improved bounds for minimal feedback vertex sets in tournaments
  Mnich, Matthias; Teutrine, Eva-Lotta
  11th International Symposium on Parameterized and Exact Computation, IPEC 2016
  Publisher DOI
• Linear-time recognition of map graphs with outerplanar witness
  Mnich, Matthias; Rutter, Ignaz; Schmidt, Jens M.
  15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016
  Publisher DOI
• On routing disjoint paths in bounded treewidth graphs
  Ene, Alina; Mnich, Matthias; Pilipczuk, Marcin; Risteski, Andrej
  15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016
  Publisher DOI
• 2th Theoretical Informatics, LATIN 2016
  Mnich, Matthias; Röglin, Heiko; Rösner, Clemens
  2th Theoretical Informatics, LATIN 2016
  Publisher DOI
• Lower bounds for locally highly connected graphs
  Adamaszek, Anna; Adamaszek, Michal; Mnich, Matthias; Schmidt, Jens M.
  Graphs and Combinatorics 32 : 1641-1650 (2016)
  Publisher DOI
• A 7/3-approximation for feedback vertex sets in tournaments
  Mnich, Matthias; Vassilevska Williams, Virginia; Végh, Lászlo A.
  24th Annual European Symposium on Algorithms, ESA 2016
  Publisher DOI
• Polynomial kernels for deletion to classes of acyclic digraphs
  Mnich, Matthias; Leeuwen, Erik Jan van
  33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016
  Open Access | Publisher DOI

2015

• Polynomial kernels for weighted problems
  Etscheid, Michael; Kratsch, Stefan; Mnich, Matthias; Röglin, Heiko
  40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015
  Publisher DOI
• Max-Cut parameterized above the Edwards-Erdős bound
  Crowston, Robert; Jones, Mark; Mnich, Matthias
  Algorithmica 72 (3): 734-757 (2015)
  Publisher DOI
• Parameterized complexity dichotomy for Steiner multicut
  Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; Leeuwen, Erik Jan van
  32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015
  Publisher DOI

2014

• Scheduling and fixed-parameter tractability
  Mnich, Matthias; Wiese, Andreas
  Mathematical Programming 154 (1-2): 533-562 (2015)
  Publisher DOI
• Parameterized complexity of induced graph matching on claw-free graphs
  Hermelin, Danny; Mnich, Matthias; Leeuwen, Erik Jan van
  Algorithmica 70: 513-560 (2014)
  Publisher DOI
• Interval scheduling and colorful independent sets
  van Bevern, René; Mnich, Matthias; Niedermeier, Rolf; Weller, Mathias
  Journal of Scheduling 18: 449-469 (2014)
  Publisher DOI
• Large independent sets in triangle-free planar graphs
  Dvořák, Zdeněk; Mnich, Matthias
  22nd Annual European Symposium on Algorithms, ESA 2014
  Publisher DOI
• Scheduling and fixed-parameter tractability
  Mnich, Matthias; Wiese, Andreas
  International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014
  Publisher DOI
• Social choice meets graph drawing : how to get subexponential time algorithms for ranking and drawing problems
  Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket
  Tsinghua Science and Technology 19 (4): 374-386 (2014)
  Publisher DOI
• Treewidth computation and kernelization in the parallel external memory model
  Jacob, Riko; Lieber, Tobias; Mnich, Matthias
  IFIP International Conference on Theoretical Computer Science, TCS 2014
  Publisher DOI

2013

• Kernel and fast algorithm for dense triplet inconsistency
  Guillemot, Sylvain; Mnich, Matthias
  Theoretical Computer Science 494: 134-143 (2013)
  Publisher DOI

2012

• Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound
  Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
  32nd Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012
  Publisher DOI
• Interval scheduling and colorful independent sets
  van Bevern, René; Mnich, Matthias; Niedermeier, Rolf; Weller, Mathias
  23rd International Symposium on Algorithms and Computation, ISAAC 2012
  Publisher DOI
• Parameterized complexity of induced H-matching on claw-free graphs
  Hermelin, Danny; Mnich, Matthias; Leeuwen, Erik Jan van
  20th European Symposium on Algorithms, ESA 2012
  Publisher DOI
• Feedback vertex sets in tournaments
  Gaspers, Serge; Mnich, Matthias
  Journal of Graph Theory 72 (1): 89-89 (2012)
  Publisher DOI
• Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
  Gutin, Gregory Z.; Iersel, Leo van; Mnich, Matthias; Yeo, Anders
  Journal of Computer and System Sciences 78 (1): 151-163 (2012)
  Publisher DOI
• Bisections above tight lower bounds
  Mnich, Matthias; Zenklusen, Rico
  International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2012
  Publisher DOI
• Induced matchings in subcubic planar graphs
  Kang, Ross J.; Mnich, Matthias; Müller, Tobias
  SIAM Journal on Discrete Mathematics 26 (3): 1383-1411 (2012)
  Publisher DOI
• Max-Cut parameterized above the Edwards-Erdős bound
  Crowston, Robert; Jones, Mark; Mnich, Matthias
  39th International Colloquium on Automata, Languages and Programming, ICALP 2012
  Publisher DOI

2011

• Domination when the stars are out
  Hermelin, Danny; Mnich, Matthias; Leeuwen, Erik Jan van; Woeginger, Gerhard
  38th International Colloquium on Automata, Languages, and Programming, ICALP 2011
  Publisher DOI
• Ranking and drawing in subexponential time
  Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket
  21st International Workshop on Combinatorial Algorithms, IWOCA 2010
  Publisher DOI
• Planar k-path in subexponential time and polynomial space
  Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket
  37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011
  Publisher DOI
• Allemaal op een rijtje
  Mnich, Matthias
  Nieuw Archief voor Wiskunde 12 (1): 25-28 (2011)
  
• Book review "Exact Exponential Algorithms" Springer Verlag, Berlin (2010)
  Mnich, Matthias
  Operations Research Letters 39 (3): 229-230 (2011)
  Publisher DOI

2010

• Induced matchings in subcubic planar graphs
  Kang, Ross J.; Mnich, Matthias; Müller, Tobias
  18th Annual European Symposium on Algorithms, ESA 2010
  Publisher DOI
• All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables
  Gutin, Gregory Z.; Iersel, Leo van; Mnich, Matthias; Yeo, Anders
  18th Annual European Symposium on Algorithms, ESA 2010
  Publisher DOI
• Kernel and fast algorithm for dense triplet inconsistency
  Guillemot, Sylvain; Mnich, Matthias
  7th International Conference on Theory and Applications of Models of Computation, TAMC 2010
  Publisher DOI
• Betweenness parameterized above tight lower bound
  Gutin, Gregory Z.; Kim, Eun Jung; Mnich, Matthias; Yeo, Anders
  Journal of Computer and System Sciences 76: 872-878 (2010)
  Publisher DOI
• Feedback vertex sets in tournaments
  Gaspers, Serge; Mnich, Matthias
  18th Annual European Symposium on Algorithms, ESA 2010
  Publisher DOI

2009

• Linear kernel for planar connected dominating set
  Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket
  6th International Conference on Theory and Applications of Models of Computation, TAMC 2009
  Publisher DOI
• The complexity ecology of parameters: An illustration using bounded max leaf number
  Fellows, Michael; Lokshtanov, Daniel; Misra, Neeldhara; Mnich, Matthias; Rosamond, Frances; Saurabh, Saket
  Theory of Computing Systems 45: 822-848 (2009)
  Publisher DOI
• Uniqueness, intractability and exact algorithms : reflections on level-k phylogenetic networks
  Iersel, Leo van; Kelk, Steven; Mnich, Matthias
  Journal of Bioinformatics and Computational Biology 7: 597-623 (2009)
  Publisher DOI