Matthias Mnich

Cited by

	All	Since 2018
Citations	1247	784
h-index	21	15
i10-index	40	27

200

100

150

20092010201120122013201420152016201720182019202020212022202310 22 40 52 55 53 57 66 81 104 138 150 144 191 54

Public access

View all

30 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Dusan KnopCzech Technical University in PragueVerified email at fit.cvut.cz
Martin KouteckýCharles UniversityVerified email at iuuk.mff.cuni.cz
Erik Jan van LeeuwenUtrecht University, The NetherlandsVerified email at uu.nl
G. GutinProfessor of Computer Science, Royal Holloway, University of LondonVerified email at rhul.ac.uk
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Roland VinczePostdoctoral Researcher, Augsburg UniversityVerified email at uni-a.de
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteVerified email at cmi.ac.in
René van BevernHuawei Technologies Co., Ltd.Verified email at huawei.com
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Leo van IerselAssociate professor, TU DelftVerified email at tudelft.nl
Andreas WieseAdjoint ProfessorVerified email at dii.uchile.cl
Anders YeoUniversity of Southern DenmarkVerified email at imada.sdu.dk
Robert CrowstonRoyal Holloway, University of LondonVerified email at cs.rhul.ac.uk
Virginia Vassilevska WilliamsMITVerified email at mit.edu
Kristóf BércziMTA-ELTE Matroid Optimization Research Group, Dept. of Operations Research, Eötvös Loránd Univ.Verified email at ttk.elte.hu
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Heiko RöglinProfessor of Computer Science, University of BonnVerified email at cs.uni-bonn.de

Matthias Mnich

TU Hamburg

Verified email at tuhh.de - Homepage

Operations Research Algorithms Parameterized Complexity Graph Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Scheduling and fixed-parameter tractability M Mnich, A Wiese Mathematical Programming 154 (1-2), 533-562, 2015	84	2015
The complexity ecology of parameters: An illustration using bounded max leaf number M Fellows, D Lokshtanov, N Misra, M Mnich, F Rosamond, S Saurabh Theory of Computing Systems 45 (4), 822-848, 2009	72	2009
Interval scheduling and colorful independent sets R Van Bevern, M Mnich, R Niedermeier, M Weller Journal of Scheduling 18, 449-469, 2015	66	2015
Parameterized complexity of machine scheduling: 15 open problems M Mnich, R Van Bevern Computers & Operations Research 100, 254-261, 2018	64	2018
Combinatorial n-fold integer programming and applications D Knop, M Koutecký, M Mnich Mathematical Programming 184 (1-2), 1-34, 2020	60	2020
A linear kernel for planar connected dominating set D Lokshtanov, M Mnich, S Saurabh Theoretical Computer Science 412 (23), 2536-2543, 2011	54	2011
Voting and bribing in single-exponential time D Knop, M Koutecký, M Mnich ACM Transactions on Economics and Computation (TEAC) 8 (3), 1-28, 2020	51	2020
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables G Gutin, L van Iersel, M Mnich, A Yeo Journal of Computer and System Sciences, 2011	51	2011
Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks L Iersel, SM Kelk, M Mnich arXiv. org e-Print archive, 1-18, 2008	42	2008
Domination when the stars are out D Hermelin, M Mnich, EJV Leeuwen, G Woeginger ACM Transactions on Algorithms (TALG) 15 (2), 1-90, 2019	38*	2019
Polynomial kernels for weighted problems M Etscheid, S Kratsch, M Mnich, H Röglin Journal of Computer and System Sciences 84, 1-10, 2017	36	2017
Betweenness parameterized above tight lower bound G Gutin, EJ Kim, M Mnich, A Yeo Journal of Computer and System Sciences 76 (8), 872-878, 2010	30*	2010
Max-cut parameterized above the Edwards-Erdős bound R Crowston, M Jones, M Mnich International Colloquium on Automata, Languages, and Programming, 242-253, 2012	28	2012
Feedback vertex sets in tournaments S Gaspers, M Mnich Journal of Graph Theory 72 (1), 72-89, 2013	27	2013
Linear kernels and linear-time algorithms for finding large cuts M Etscheid, M Mnich Algorithmica 80, 2574-2615, 2018	26	2018
Max-cut parameterized above the Edwards-Erdős bound R Crowston, M Jones, M Mnich Algorithmica 72 (3), 734-757, 2015	26	2015
Dynamic parameterized problems and algorithms J Alman, M Mnich, VV Williams ACM Transactions on Algorithms (TALG) 16 (4), 1-46, 2020	24	2020
Ranking and Drawing in Subexponential Time. H Fernau, FV Fomin, D Lokshtanov, M Mnich, G Philip, S Saurabh IWOCA 10, 337-348, 2010	24	2010
A 7/3-approximation for feedback vertex sets in tournaments M Mnich, VV Williams, LA Végh arXiv preprint arXiv:1511.01137, 2015	23	2015
Stable marriage with covering constraints–a complete computational trichotomy M Mnich, I Schlotter Algorithmic Game Theory: 10th International Symposium, SAGT 2017, L’Aquila …, 2017	22*	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors