Matthias Mnich

Cited by

	All	Since 2016
Citations	952	622
h-index	19	14
i10-index	31	21

200

100

150

200820092010201120122013201420152016201720182019202020213 15 29 45 52 59 60 60 66 79 111 144 192 26

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
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
Dusan KnopTechnische Universität BerlinVerified email at kam.mff.cuni.cz
Martin KouteckýCharles UniversityVerified email at iuuk.mff.cuni.cz
Leo van IerselAssociate professor, TU DelftVerified email at tudelft.nl
René van BevernNovosibirsk State UniversityVerified email at nsu.ru
Anders YeoUniversity of Southern DenmarkVerified email at imada.sdu.dk
Geevarghese PhilipAssistant Professor, Chennai Mathematical InstituteVerified email at cmi.ac.in
Andreas WieseAdjoint ProfessorVerified email at dii.uchile.cl
Virginia Vassilevska WilliamsMITVerified email at mit.edu
Rolf NiedermeierProfessor of Theoretical Computer Science, TU BerlinVerified email at tu-berlin.de
Mathias WellerLIGM, Paris, FranceVerified email at u-pem.fr
Robert CrowstonRoyal Holloway, University of LondonVerified email at cs.rhul.ac.uk
Serge GaspersAssociate Professor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Heiko RöglinProfessor of Computer Science, University of BonnVerified email at cs.uni-bonn.de
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no

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), 533-562, 2015	63	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	61	2009
Interval scheduling and colorful independent sets R Van Bevern, M Mnich, R Niedermeier, M Weller Journal of Scheduling 18 (5), 449-469, 2015	47	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	42	2012
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	41	2008
Combinatorial n-fold integer programming and applications D Knop, M Koutecký, M Mnich Mathematical programming, 1-34, 2019	40	2019
Feedback vertex sets in tournaments S Gaspers, M Mnich European Symposium on Algorithms, 267-277, 2010	40	2010
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	37	2020
Parameterized complexity of machine scheduling: 15 open problems M Mnich, R van Bevern Computers & Operations Research 100, 254-261, 2018	36	2018
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	34*	2010
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	32	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	31*	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	28	2017
Linear kernel for planar connected dominating set D Lokshtanov, M Mnich, S Saurabh International Conference on Theory and Applications of Models of Computation …, 2009	28	2009
A linear kernel for a planar connected dominating set D Lokshtanov, M Mnich, S Saurabh Theoretical Computer Science 412 (23), 2536-2543, 2011	26	2011
Induced matchings in subcubic planar graphs RJ Kang, M Mnich, T Müller SIAM journal on discrete mathematics 26 (3), 1383-1411, 2012	22	2012
Linear kernels and linear-time algorithms for finding large cuts M Etscheid, M Mnich Algorithmica 80 (9), 2574-2615, 2018	20	2018
Ranking and drawing in subexponential time H Fernau, FV Fomin, D Lokshtanov, M Mnich, G Philip, S Saurabh International Workshop on Combinatorial Algorithms, 337-348, 2010	20	2010
A 7/3-approximation for feedback vertex sets in tournaments M Mnich, VV Williams, LA Végh arXiv preprint arXiv:1511.01137, 2015	19	2015
Kernel and fast algorithm for dense triplet inconsistency S Guillemot, M Mnich Theoretical Computer Science 494, 134-143, 2013	19	2013

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

Upload PDF

Follow this author

Cited by

Co-authors