Matthias Mnich

1.1k total citations
50 papers, 301 citations indexed

About

Matthias Mnich is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, Matthias Mnich has authored 50 papers receiving a total of 301 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computational Theory and Mathematics, 15 papers in Computer Networks and Communications and 9 papers in Industrial and Manufacturing Engineering. Recurrent topics in Matthias Mnich's work include Advanced Graph Theory Research (33 papers), Complexity and Algorithms in Graphs (23 papers) and Optimization and Search Problems (13 papers). Matthias Mnich is often cited by papers focused on Advanced Graph Theory Research (33 papers), Complexity and Algorithms in Graphs (23 papers) and Optimization and Search Problems (13 papers). Matthias Mnich collaborates with scholars based in Germany, Netherlands and United Kingdom. Matthias Mnich's co-authors include Andreas Wiese, René van Bevern, Saket Saurabh, Daniel Lokshtanov, Erik Jan van Leeuwen, Leo van Iersel, Steven Kelk, Serge Gaspers, Michael Etscheid and Danny Hermelin and has published in prestigious journals such as European Journal of Operational Research, Mathematical Programming and Computers & Operations Research.

In The Last Decade

Matthias Mnich

43 papers receiving 290 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Matthias Mnich Germany 9 190 110 87 34 29 50 301
Pim van ’t Hof Norway 12 280 1.5× 122 1.1× 19 0.2× 13 0.4× 17 0.6× 40 327
Bart M. P. Jansen Netherlands 10 216 1.1× 54 0.5× 18 0.2× 17 0.5× 28 1.0× 45 254
Igor Razgon Ireland 11 370 1.9× 141 1.3× 19 0.2× 48 1.4× 51 1.8× 24 424
Gwenaël Joret Belgium 10 182 1.0× 47 0.4× 14 0.2× 15 0.4× 37 1.3× 55 242
Paul Bonsma Germany 9 218 1.1× 164 1.5× 26 0.3× 13 0.4× 19 0.7× 27 279
Luérbio Faria Brazil 8 175 0.9× 61 0.6× 16 0.2× 8 0.2× 12 0.4× 56 212
Mathieu Liedloff France 11 217 1.1× 110 1.0× 32 0.4× 5 0.1× 20 0.7× 36 276
Sylvia Boyd Canada 11 155 0.8× 69 0.6× 113 1.3× 7 0.2× 23 0.8× 27 254
Catherine McCartin New Zealand 11 94 0.5× 96 0.9× 20 0.2× 27 0.8× 77 2.7× 22 238
Yushi Uno Japan 8 188 1.0× 70 0.6× 6 0.1× 12 0.4× 38 1.3× 39 246

Countries citing papers authored by Matthias Mnich

Since Specialization
Citations

This map shows the geographic impact of Matthias Mnich's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Matthias Mnich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matthias Mnich more than expected).

Fields of papers citing papers by Matthias Mnich

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Matthias Mnich. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Matthias Mnich. The network helps show where Matthias Mnich may publish in the future.

Co-authorship network of co-authors of Matthias Mnich

This figure shows the co-authorship network connecting the top 25 collaborators of Matthias Mnich. A scholar is included among the top collaborators of Matthias Mnich based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Matthias Mnich. Matthias Mnich is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hermelin, Danny, et al.. (2024). Serial batching to minimize the weighted number of tardy jobs. Journal of Scheduling. 27(6). 545–556. 1 indexed citations
2.
Ganian, Robert, Mamadou Moustapha Kanté, Matthias Mnich, et al.. (2023). Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
3.
Mnich, Matthias, et al.. (2022). Approximations for many-visits multiple traveling salesman problems. Omega. 116. 102816–102816. 6 indexed citations
4.
Marx, Dániel, et al.. (2022). Parameterized algorithms for generalizations of Directed Feedback Vertex Set. Discrete Optimization. 46. 100740–100740. 1 indexed citations
5.
Fearnley, John, Martin Gairing, Matthias Mnich, & Rahul Savani. (2021). Reachability Switching Games. Logical Methods in Computer Science. Volume 17, Issue 2.
6.
Gribling, Sander, Domenico Lahaye, Matthias Mnich, et al.. (2020). On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. Discrete Optimization. 37. 100565–100565. 1 indexed citations
7.
Mnich, Matthias & Ildikó Schlotter. (2020). Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Algorithmica. 82(5). 1136–1188. 6 indexed citations
8.
Mnich, Matthias & René van Bevern. (2018). Parameterized complexity of machine scheduling: 15 open problems. Computers & Operations Research. 100. 254–261. 33 indexed citations
9.
Fearnley, John, Martin Gairing, Matthias Mnich, & Rahul Savani. (2018). Reachability Switching Games. Research Publications (Maastricht University). 14. 1 indexed citations
10.
Mnich, Matthias, Ignaz Rutter, & Jens M. Schmidt. (2017). Linear-time recognition of map graphs with outerplanar witness. Discrete Optimization. 28. 63–77. 5 indexed citations
11.
Mnich, Matthias, et al.. (2016). Linear-Time Recognition of Map Graphs with Outerplanar Witness. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
12.
Ene, Alina, Matthias Mnich, Marcin Pilipczuk, & Andrej Risteski. (2016). On Routing Disjoint Paths in Bounded Treewidth Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 53. 15. 1 indexed citations
13.
Bringmann, Karl, Danny Hermelin, Matthias Mnich, & Erik Jan van Leeuwen. (2016). Parameterized complexity dichotomy for Steiner Multicut. Journal of Computer and System Sciences. 82(6). 1020–1043. 3 indexed citations
14.
Etscheid, Michael, Stefan Kratsch, Matthias Mnich, & Heiko Röglin. (2016). Polynomial kernels for weighted problems. Journal of Computer and System Sciences. 84. 1–10. 13 indexed citations
15.
Mnich, Matthias, Geevarghese Philip, Saket Saurabh, & Ondřej Suchý. (2014). Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík bound. Journal of Computer and System Sciences. 80(7). 1384–1403. 6 indexed citations
16.
Guillemot, Sylvain & Matthias Mnich. (2013). Kernel and fast algorithm for dense triplet inconsistency. Theoretical Computer Science. 494. 134–143. 2 indexed citations
17.
Gutin, Gregory, Leo van Iersel, Matthias Mnich, & Anders Yeo. (2011). Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. Journal of Computer and System Sciences. 78(1). 151–163. 8 indexed citations
18.
Gutin, Gregory, Eun Jung Kim, Matthias Mnich, & Anders Yeo. (2010). Betweenness parameterized above tight lower bound. Journal of Computer and System Sciences. 76(8). 872–878. 7 indexed citations
19.
Lokshtanov, Daniel, Matthias Mnich, & Saket Saurabh. (2010). A Linear Kernel for Planar Connected Dominating Set. Theoretical Computer Science. 412(23). 2536–2543. 13 indexed citations
20.
Gutin, Gregory, Eun‐Jung Kim, Matthias Mnich, & Anders Yeo. (2009). Ordinal embedding relaxations parametrized above tight lower bound. arXiv (Cornell University). 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Pim van ’t Hof Breakdown of academic impact, for papers by Bart M. P. Jansen Breakdown of academic impact, for papers by Igor Razgon Breakdown of academic impact, for papers by Gwenaël Joret Breakdown of academic impact, for papers by Paul Bonsma Breakdown of academic impact, for papers by Luérbio Faria Breakdown of academic impact, for papers by Mathieu Liedloff Breakdown of academic impact, for papers by Sylvia Boyd Breakdown of academic impact, for papers by Catherine McCartin Breakdown of academic impact, for papers by Yushi Uno
Rankless by CCL
2026