Sledovať
Rolf Niedermeier
Rolf Niedermeier
TU Berlin
Overená e-mailová adresa na: tu-berlin.de - Domovská stránka
Názov
Citované v
Citované v
Rok
Invitation to fixed-parameter algorithms
R Niedermeier
OUP Oxford, 2006
21952006
Fixed parameter algorithms for dominating set and related problems on planar graphs
Alber, Bodlaender, Fernau, Kloks, Niedermeier
Algorithmica 33, 461-493, 2002
389*2002
Invitation to data reduction and problem kernelization
J Guo, R Niedermeier
ACM SIGACT News 38 (1), 31-45, 2007
3662007
Polynomial-time data reduction for dominating set
J Alber, MR Fellows, R Niedermeier
Journal of the ACM (JACM) 51 (3), 363-384, 2004
314*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
258*2006
Fixed-parameter algorithms for closest string and related problems
Gramm, Niedermeier, Rossmanith
Algorithmica 37, 25-42, 2003
247*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
234*2005
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
211*2009
Parameterized complexity of vertex cover variants
J Guo, R Niedermeier, S Wernicke
Theory of Computing Systems 41, 501-520, 2007
211*2007
An efficient fixed-parameter algorithm for 3-Hitting Set
R Niedermeier, P Rossmanith
Journal of Discrete Algorithms 1 (1), 89-102, 2003
2042003
Upper bounds for vertex cover further improved
R Niedermeier, P Rossmanith
STACS 99: 16th Annual Symposium on Theoretical Aspects of Computer Science …, 1999
1901999
A general method to speed up fixed-parameter-tractable algorithms
R Niedermeier, P Rossmanith
Information Processing Letters 73 (3-4), 125-129, 2000
1762000
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
1642010
Fixed-parameter algorithms for Kemeny rankings
N Betzler, MR Fellows, J Guo, R Niedermeier, FA Rosamond
Theoretical Computer Science 410 (45), 4554-4570, 2009
158*2009
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
1582004
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
1562004
New upper bounds for maximum satisfiability
R Niedermeier, P Rossmanith
Journal of Algorithms 36 (1), 63-88, 2000
149*2000
Towards optimal locality in mesh-indexings
R Niedermeier, K Reinhardt, P Sanders
Discrete Applied Mathematics 117 (1-3), 211-237, 2002
146*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
140*2003
Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
AS Himmel, H Molter, R Niedermeier, M Sorge
Social Network Analysis and Mining 7, 1-16, 2017
137*2017
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20