Matthias Mnich

Cited by

	All	Since 2015
Citations	897	633
h-index	18	14
i10-index	31	22

180

135

20082009201020112012201320142015201620172018201920203 15 29 45 51 59 52 60 65 78 112 142 170

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
G. GutinProfessor of Computer Science, Royal Holloway, University of LondonVerified email at rhul.ac.uk
Erik Jan van LeeuwenUtrecht University, The NetherlandsVerified email at uu.nl
Leo van IerselAssociate professor, TU DelftVerified email at tudelft.nl
Dusan KnopTechnische Universität BerlinVerified email at kam.mff.cuni.cz
Martin KouteckýCharles UniversityVerified email at iuuk.mff.cuni.cz
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
Roland VinczePhD candidate, Hamburg University of TechnologyVerified email at maastrichtuniversity.nl
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in

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	60	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	57	2009
Interval scheduling and colorful independent sets R Van Bevern, M Mnich, R Niedermeier, M Weller Journal of Scheduling 18 (5), 449-469, 2015	42	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	41	2012
Feedback vertex sets in tournaments S Gaspers, M Mnich European Symposium on Algorithms, 267-277, 2010	41	2010
Combinatorial n-fold integer programming and applications D Knop, M Koutecký, M Mnich Mathematical Programming, 1-34, 2019	38	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	38	2008
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	36	2020
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	33*	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	30*	2019
Parameterized complexity of machine scheduling: 15 open problems M Mnich, R van Bevern Computers & Operations Research 100, 254-261, 2018	30	2018
Linear kernel for planar connected dominating set D Lokshtanov, M Mnich, S Saurabh International Conference on Theory and Applications of Models of Computation …, 2009	27	2009
Polynomial kernels for weighted problems M Etscheid, S Kratsch, M Mnich, H Röglin Journal of Computer and System Sciences 84, 1-10, 2017	26	2017
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	21	2012
Linear kernels and linear-time algorithms for finding large cuts M Etscheid, M Mnich Algorithmica 80 (9), 2574-2615, 2018	19	2018
Kernel and fast algorithm for dense triplet inconsistency S Guillemot, M Mnich Theoretical Computer Science 494, 134-143, 2013	19	2013
All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables G Gutin, L Van Iersel, M Mnich, A Yeo European Symposium on Algorithms, 326-337, 2010	18*	2010
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	18	2010

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