Matthias Mnich

Universität Hamburg — Germany

Computer Science · Physical Sciences

17h-index1.1kcitations141works0.42yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(91), Complexity and Algorithms in Graphs(73), Optimization and Search Problems(37), Optimization and Packing Problems(14), Graph Labeling and Dimension Problems(14)

Publications141 total

A survey on graph problems parameterized above and below guaranteed values
Computer Science Review·2025· 1 citedOpen Access
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
ACM Transactions on Computation Theory·2025Open Access
Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
arXiv (Cornell University)·2025Open Access
Serial batching to minimize the weighted number of tardy jobs
Journal of Scheduling·2024· 1 citedOpen Access
MS-DPPs: Multi-Source Determinantal Point Processes for Contextual Diversity Refinement of Composite Attributes in Text to Image Retrieval
2024Open Access
New Support Size Bounds and Proximity Bounds for Integer Linear Programming
Lecture notes in computer science·2024
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
arXiv (Cornell University)·2024Open Access
A $(\frac32+\frac1{\mathrm{e}})$-Approximation Algorithm for Ordered TSP
arXiv (Cornell University)·2024· 1 citedOpen Access
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter
ACM Transactions on Algorithms·2023· 1 citedOpen Access
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding
2023· 5 cited
Checkpoint Placement for Systematic Fault-Injection Campaigns
2023· 3 cited
No Polynomial Kernels for Knapsack
arXiv (Cornell University)·2023Open Access
A $(3/2 + \varepsilon)$-Approximation for Multiple TSP with a Variable Number of Depots
arXiv (Cornell University)·2023Open Access
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines
arXiv (Cornell University)·2023Open Access
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
arXiv (Cornell University)·2023Open Access
Checkpoint Placement for Systematic Fault-Injection Campaigns
arXiv (Cornell University)·2023Open Access
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2023· 2 citedOpen Access
Approximations for many-visits multiple traveling salesman problems
Omega·2022· 11 citedOpen Access
A 3/2-Approximation for the Metric Many-Visits Path TSP
SIAM Journal on Discrete Mathematics·2022· 3 citedOpen Access
Hitting Weighted Even Cycles in Planar Graphs
SIAM Journal on Discrete Mathematics·2022
page 1 of 8Next →

Frequent Co-authors

Saket Saurabh(7), Daniel Lokshtanov(6), Gregory Gutin(5), Dušan Knop(5), Martin Koutecký(5), Erik Jan van Leeuwen(5), Anders Yeo(4), Danny Hermelin(4), Leo van Iersel(3), Michael Etscheid(3), Geevarghese Philip(3), Andreas Wiese(2), Robert Crowston(2), Mark Jones(2), Serge Gaspers(2), Ildikó Schlotter(2), Ross J. Kang(2), Tobias Müller(2), Henning Fernau(2), Fedor V. Fomin(2)