Matthias Mnich

Cited by

	All	Since 2018
Citations	1374	903
h-index	22	17
i10-index	43	31

180

135

20092010201120122013201420152016201720182019202020212022202310 22 41 51 61 60 58 63 81 106 139 155 141 178 178

Public access

View all

32 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
Roland VinczePostdoctoral Researcher, Augsburg UniversityVerified email at uni-a.de
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteVerified email at cmi.ac.in
René van BevernHuawei Technologies Co., Ltd.Verified email at huawei.com
Leo van IerselAssociate professor, TU DelftVerified email at tudelft.nl
Kristóf BércziMatroid Optimization Research Group, Department of Operations Research, Eötvös Loránd UniversityVerified email at ttk.elte.hu
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
Mark JonesTU DelftVerified email at tudelft.nl
Virginia Vassilevska WilliamsMITVerified email at mit.edu
Zdenek DvorakComputer Science Institute, Charles University, PragueVerified email at ucw.cz

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	89	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	73	2009
Interval scheduling and colorful independent sets R Van Bevern, M Mnich, R Niedermeier, M Weller Journal of Scheduling 18, 449-469, 2015	71	2015
Parameterized complexity of machine scheduling: 15 open problems M Mnich, R Van Bevern Computers & Operations Research 100, 254-261, 2018	69	2018
Combinatorial n-fold integer programming and applications D Knop, M Koutecký, M Mnich Mathematical Programming 184 (1-2), 1-34, 2020	65	2020
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	57	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	57	2011
A linear kernel for planar connected dominating set D Lokshtanov, M Mnich, S Saurabh Theoretical Computer Science 412 (23), 2536-2543, 2011	55	2011
Domination when the stars are out D Hermelin, M Mnich, EJV Leeuwen, G Woeginger ACM Transactions on Algorithms (TALG) 15 (2), 1-90, 2019	43*	2019
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
Polynomial kernels for weighted problems M Etscheid, S Kratsch, M Mnich, H Röglin Journal of Computer and System Sciences 84, 1-10, 2017	41	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	32*	2010
Max-cut parameterized above the Edwards-Erdős bound R Crowston, M Jones, M Mnich Algorithmica 72 (3), 734-757, 2015	29	2015
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	29	2012
Dynamic parameterized problems and algorithms J Alman, M Mnich, VV Williams ACM Transactions on Algorithms (TALG) 16 (4), 1-46, 2020	27	2020
Linear kernels and linear-time algorithms for finding large cuts M Etscheid, M Mnich Algorithmica 80, 2574-2615, 2018	27	2018
Feedback vertex sets in tournaments S Gaspers, M Mnich Journal of Graph Theory 72 (1), 72-89, 2013	27	2013
Large independent sets in triangle-free planar graphs Z Dvorák, M Mnich SIAM Journal on Discrete Mathematics 31 (2), 1355-1373, 2017	26	2017
A 7/3-approximation for feedback vertex sets in tournaments M Mnich, VV Williams, LA Végh arXiv preprint arXiv:1511.01137, 2015	25	2015
Stable marriage with covering constraints–a complete computational trichotomy M Mnich, I Schlotter International Symposium on Algorithmic Game Theory, 320-332, 2017	24*	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