PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Niedermeier, Rolf"

Author of the publication

copydeleteadd this publication to your clipboard
Error Compensation in Leaf Power Problems.

, , , and . Algorithmica, 44 (4): 363-381 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

PD Dr. Rolf Brack University of Stuttgart

Rolf Beißwanger University of Stuttgart

PD Dr. Michael Rolf Schweikert University of Stuttgart

Dr. -Ing. Rolf Stierle University of Stuttgart

Dr. Rolf Bauer University of Stuttgart

 

Other publications of authors with the same name

Matrix Robustness, with an Application to Power System Observability., , , and . ACiD, volume 7 of Texts in Algorithmics, page 37-48. King's College, London, (2006)Towards realistic and simple models of parallel computation.. University of Tübingen, Germany, (1996)On The Parameterized Intractability Of Motif Search Problems., , and . Combinatorica, 26 (2): 141-167 (2006)The complexity of degree anonymization by vertex addition., , , , , and . Theor. Comput. Sci., (2015)Parameterized Complexity of Arc-Weighted Directed Steiner Problems., , and . SIAM J. Discrete Math., 25 (2): 583-599 (2011)A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack., , and . J. Scheduling, 20 (3): 255-265 (2017)A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths., , , , and . Networks, 73 (1): 23-37 (2019)An Adaptive Version of Brandes' Algorithm for Betweenness Centrality., , , , and . ISAAC, volume 123 of LIPIcs, page 36:1-36:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Interval Scheduling and Colorful Independent Sets., , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 247-256. Springer, (2012)Exact Solutions for CLOSEST STRING and Related Problems., , and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 441-453. Springer, (2001)