2022

• Exact and approximation algorithms for many-visits travelling salesperson problems
  Vincze, Roland
  Technische Universität Hamburg (2022)
  Open Access
• A survey on graph problems parameterized above and below guaranteed values
  Gutin, Gregory Z.; Mnich, Matthias
  arXiv: 2207.12278 (2022)
  Open Access
• Hitting weighted even cycles in planar graphs
  Göke, Alexander; Koenemann, Jochen; Mnich, Matthias; Sun, Hao
  SIAM Journal on Discrete Mathematics (in Press) : (2022)
  
• Gaussian graphical modeling for spectrometric data analysis
  Codazzi, Laura; Colombi, Alessandro; Gianella, Matteo; Argiento, Raffaele; Paci, Lucia; Pini, Alessia
  Computational Statistics and Data Analysis 174: 107416 (2022)
  Publisher DOI
• Optimizing fuel consumption on inland waterway networks : local search heuristic for lock scheduling
  Golak, Julian; Defryn, Christof; Grigoriev, Alexander
  Omega-International Journal of Management Science 109 : 102580 (2022)
  Open Access | Publisher DOI
• Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
  Fischer, David; Golak, Julian; Mnich, Matthias
  arXiv: 2203.03600 (2022)
  Open Access
• An asymptotic (4/3+epsilon)-approximation for the 2-dimensional vector bin packing problem
  Kulik, Ariel; Mnich, Matthias; Shachnai, Hadas
  arXiv:2205.12828 (2022)
  Open Access

2021

• On short fastest paths in temporal graphs
  Danda, Umesh Sandeep; Ramakrishna, G.; Schmidt, Jens M.; Srikanth, M.
  International Conference and Workshops on Algorithms and Computation (WALCOM 2021)
  Publisher DOI
• Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
  Chalermsook, Parinya; Kaul, Matthias; Mnich, Matthias; Spoerhase, Joachim; Uniyal, Sumedha; Vaz, Daniel
  arXiv:2111.06299 (2021)
  Open Access
• Circumference of essentially 4-connected planar triangulations
  Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M.
  Journal of Graph Algorithms and Applications 25 (1): 121-132 (2021)
  Open Access | Publisher DOI
• Efficient approximations for many-visits multiple traveling salesman problems
  Bérczi, Kristóf; Mnich, Matthias; Vincze, Roland
  arXiv: 2201.02054 (2021)
  Open Access
• Reachability switching games
  Fearnley, John; Gairing, Martin; Mnich, Matthias; Savani, Rahul
  Logical Methods in Computer Science 17 (2): 10:1-10:29 (2021-04-22)
  Open Access | Publisher DOI
• Cycle spectra of contraction-critically 4-connected planar graphs
  Lo, On-Hei Solomon; Schmidt, Jens M.
  Graphs and Combinatorics 37 (6): 2129-2137 (2021)
  Publisher DOI
• Hitting weighted even cycles in planar graphs
  Göke, Alexander; Koenemann, Jochen; Mnich, Matthias; Sun, Hao
  International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2021)
  Open Access | Publisher DOI
• 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

2020

• Hitting long directed cycles is fixed-parameter tractable
  Göke, Alexander; Marx, Dániel; Mnich, Matthias
  International Colloquium on Automata, Languages, and Programming (ICALP 2020)
  Open Access | 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
• Engineering kernelization for maximum cut
  Ferizovic, Damir; Hespe, Damian; Lamm, Sebastian; Mnich, Matthias; Schulz, Christian; Strash, Darren
  22nd Symposium on Algorithm Engineering and Experiments (ALENEX 2020)
  Publisher DOI
• Dense Steiner problems: approximation algorithms and inapproximability
  Karpinski, Marek; Lewandowski, Mateusz; Meesum, Syed Mohammad; Mnich, Matthias
  arXiv:2004.14102 (2020)
  
• Voting and bribing in single-exponential time
  Knop, Dušan; Koutecký, Martin; Mnich, Matthias
  ACM Transactions on Economics and Computation (2020)
  Publisher DOI
• Recent advances in practical data reduction
  Abu-Khzam, Faisal; Lamm, Sebastian; Mnich, Matthias; Noe, Alexander; Schulz, Christian; Strash, Darren
  arXiv:2012.12594 (2020)
  Open Access
• Time- and space-optimal algorithm for the many-visits TSP
  Berger, André; Kozma, László; Mnich, Matthias; Vincze, Roland
  ACM Transactions on Algorithms (2020)
  Publisher DOI
• Odd multiway cut in directed acyclic graphs
  Chandrasekaran, Karthekeyan; Mnich, Matthias; Mozaffari, Sahand
  SIAM Journal on Discrete Mathematics (2020)
  Publisher DOI
• Dynamic parameterized problems and algorithms
  Alman, Josh; Mnich, Matthias; Vassilevska Williams, Virginia
  ACM Transactions on Algorithms (2020)
  Publisher DOI
• Stable matchings with covering constraints: a complete computational trichotomy
  Mnich, Matthias; Schlotter, Ildikó
  Algorithmica (2020)
  Open Access | Publisher DOI
• Scheduling with non-renewable resources: Minimizing the sum of completion times
  Bérczi, Kristóf; Király, Tamás; Omlor, Simon
  6th International Symposium on Combinatorial Optimization (ISCO 2020)
  Publisher DOI
• A 3/2-approximation for the metric many-visits path TSP
  Bérczi, Kristóf; Mnich, Matthias; Vincze, Roland
  arXiv:2007.11389 (2020)
  Open Access
• 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 (2020)
  Publisher DOI