Seguir
Rolf Niedermeier
Rolf Niedermeier
Dirección de correo verificada de tu-berlin.de - Página principal
Título
Citado por
Citado por
Año
Invitation to fixed-parameter algorithms
R Niedermeier
OUP Oxford, 2006
21102006
Fixed parameter algorithms for dominating set and related problems on planar graphs
Alber, Bodlaender, Fernau, Kloks, Niedermeier
Algorithmica 33, 461-493, 2002
382*2002
Invitation to data reduction and problem kernelization
J Guo, R Niedermeier
ACM SIGACT News 38 (1), 31-45, 2007
3672007
Polynomial-time data reduction for dominating set
J Alber, MR Fellows, R Niedermeier
Journal of the ACM (JACM) 51 (3), 363-384, 2004
300*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
252*2006
Fixed-parameter algorithms for closest string and related problems
Gramm, Niedermeier, Rossmanith
Algorithmica 37, 25-42, 2003
242*2003
Graph-modeled data clustering: Exact algorithms for clique generation
J Gramm, J Guo, F Hüffner, R Niedermeier
Theory of Computing Systems 38, 373-392, 2005
216*2005
Parameterized complexity of vertex cover variants
J Guo, R Niedermeier, S Wernicke
Theory of Computing Systems 41, 501-520, 2007
205*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
198*2009
An efficient fixed-parameter algorithm for 3-Hitting Set
R Niedermeier, P Rossmanith
Journal of Discrete Algorithms 1 (1), 89-102, 2003
1932003
Upper bounds for vertex cover further improved
R Niedermeier, P Rossmanith
STACS 99: 16th Annual Symposium on Theoretical Aspects of Computer Science …, 1999
1811999
A general method to speed up fixed-parameter-tractable algorithms
R Niedermeier, P Rossmanith
Information Processing Letters 73 (3-4), 125-129, 2000
1712000
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
1552010
Fixed-parameter algorithms for Kemeny rankings
N Betzler, MR Fellows, J Guo, R Niedermeier, FA Rosamond
Theoretical Computer Science 410 (45), 4554-4570, 2009
154*2009
New upper bounds for maximum satisfiability
R Niedermeier, P Rossmanith
Journal of Algorithms 36 (1), 63-88, 2000
150*2000
Automated generation of search tree algorithms for hard graph modification problems
J Gramm, J Guo, F Hüffner, R Niedermeier
Algorithmica 39, 321-347, 2004
1472004
Towards optimal locality in mesh-indexings
R Niedermeier, K Reinhardt, P Sanders
Discrete Applied Mathematics 117 (1-3), 211-237, 2002
142*2002
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
139*2003
A structural view on parameterizing problems: Distance from triviality
J Guo, F Hüffner, R Niedermeier
Parameterized and Exact Computation: First International Workshop, IWPEC …, 2004
1382004
Reflections on multivariate algorithmics and problem parameterization
R Niedermeier
27th International Symposium on Theoretical Aspects of Computer Science (2010), 2010
1332010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20