Rolf Niedermeier
Rolf Niedermeier
Professor of Theoretical Computer Science, TU Berlin
E-mail megerősítve itt: tu-berlin.de
Cím
Hivatkozott rá
Hivatkozott rá
Év
Invitation to fixed-parameter algorithms
R Niedermeier
18982006
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
3502007
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
1822003
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
1691999
A general method to speed up fixed-parameter-tractable algorithms
R Niedermeier, P Rossmanith
Information Processing Letters 73 (3-4), 125-129, 2000
1662000
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
1462004
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
1282004
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
1232010
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
1202010
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20