Rolf Niedermeier

Cited by

	All	Since 2016
Citations	10846	3659
h-index	53	31
i10-index	149	104

900

450

225

675

200020012002200320042005200620072008200920102011201220132014201520162017201820192020202164 76 128 216 264 274 361 379 495 625 677 715 658 733 607 685 672 678 709 673 893 13

Co-authors

Falk HüffnerPostdoc, TU BerlinVerified email at tu-berlin.de
Christian KomusiewiczPhilipps-Universität MarburgVerified email at informatik.uni-marburg.de
Robert BredereckHumboldt-Universität zu BerlinVerified email at hu-berlin.de
André NichterleinTU BerlinVerified email at tu-berlin.de
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
René van BevernNovosibirsk State UniversityVerified email at nsu.ru
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Manuel SorgeTU ViennaVerified email at ac.tuwien.ac.at
Mathias WellerLIGM, Paris, FranceVerified email at u-pem.fr
Jiehua ChenTU ViennaVerified email at tuwien.ac.at
Piotr FaliszewskiAGH University of Science and TechnologyVerified email at agh.edu.pl
Till FluschnikTechnische Universität BerlinVerified email at tu-berlin.de
Nimrod TalmonBen-Gurion UniversityVerified email at bgu.ac.il
Hans L. BodlaenderProfessor Computer Science, Utrecht University and Technical University EindhovenVerified email at uu.nl
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Sepp HartungVerified email at tu-berlin.de
George B. MertziosAssociate Professor, Durham UniversityVerified email at durham.ac.uk
Philipp ZschocheTechnische Universität BerlinVerified email at zschoche.org
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Ondra SuchýAssistant Professor of Theoretical Computer Science, Czech Technical UniversityVerified email at fit.cvut.cz

Rolf Niedermeier

Professor of Theoretical Computer Science, TU Berlin

Verified email at tu-berlin.de

Algorithms Computational Complexity Parameterized Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Invitation to fixed-parameter algorithms R Niedermeier	1898	2006
Fixed parameter algorithms for dominating set and related problems on planar graphs J Alber, HL Bodlaender, H Fernau, T Kloks, R Niedermeier Algorithmica 33 (4), 461-493, 2002	400*	2002
Invitation to data reduction and problem kernelization J Guo, R Niedermeier ACM SIGACT News 38 (1), 31-45, 2007	350	2007
Polynomial-time data reduction for dominating set J Alber, MR Fellows, R Niedermeier Journal of the ACM (JACM) 51 (3), 363-384, 2004	274*	2004
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization J Guo, J Gramm, F Hüffner, R Niedermeier, S Wernicke Journal of Computer and System Sciences 72 (8), 1386-1396, 2006	228*	2006
Fixed-parameter algorithms for closest string and related problems J Gramm, R Niedermeier, P Rossmanith Algorithmica 37 (1), 25-42, 2003	209*	2003
An efficient fixed-parameter algorithm for 3-hitting set R Niedermeier, P Rossmanith Journal of Discrete Algorithms 1 (1), 89-102, 2003	182	2003
Graph-modeled data clustering: Exact algorithms for clique generation J Gramm, J Guo, F Hüffner, R Niedermeier Theory of Computing Systems 38 (4), 373-392, 2005	180*	2005
Upper bounds for vertex cover further improved R Niedermeier, P Rossmanith Annual Symposium on Theoretical Aspects of Computer Science, 561-570, 1999	169	1999
A general method to speed up fixed-parameter-tractable algorithms R Niedermeier, P Rossmanith Information Processing Letters 73 (3-4), 125-129, 2000	166	2000
Parameterized complexity of vertex cover variants J Guo, R Niedermeier, S Wernicke Theory of Computing Systems 41 (3), 501-520, 2007	162*	2007
Data reduction and exact algorithms for clique cover J Gramm, J Guo, F Hüffner, R Niedermeier Journal of Experimental Algorithmics (JEA) 13, 2.2-2.15, 2009	152*	2009
Parameterized complexity: exponential speed-up for planar graph problems J Alber, H Fernau, R Niedermeier Journal of Algorithms 52 (1), 26-56, 2004	146	2004
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT J Gramm, EA Hirsch, R Niedermeier, P Rossmanith Discrete Applied Mathematics 130 (2), 139-155, 2003	140*	2003
Fixed-parameter algorithms for Kemeny rankings N Betzler, MR Fellows, J Guo, R Niedermeier, FA Rosamond Theoretical Computer Science 410 (45), 4554-4570, 2009	135*	2009
New upper bounds for maximum satisfiability R Niedermeier, P Rossmanith Journal of Algorithms 36 (1), 63-88, 2000	130*	2000
Automated generation of search tree algorithms for hard graph modification problems J Gramm, J Guo, F Hüffner, R Niedermeier Algorithmica 39 (4), 321-347, 2004	128	2004
Towards optimal locality in mesh-indexings R Niedermeier, K Reinhardt, P Sanders Discrete Applied Mathematics 117 (1-3), 211-237, 2002	128*	2002
Reflections on multivariate algorithmics and problem parameterization R Niedermeier	123	2010
Fixed-parameter algorithms for cluster vertex deletion F Hüffner, C Komusiewicz, H Moser, R Niedermeier Theory of Computing Systems 47 (1), 196-217, 2010	120	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