( en | de | ru )

 

Disambiguation of "Niedermeier, Rolf"

Author of the publication

copydeleteadd this publication to your clipboard
Network-Based Dissolution.

, , , , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 69-80. Springer, (2014)

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.

Rolf Niedermeier

Rolf Niedermeier

Rolf Niedermeier

Ulrich Niedermeier

Magnetic field effect in organic light emitting diodes. TU Darmstadt, (2009)

Marianne Niedermeier

 

Other publications of authors with the same name

The Computational Complexity of Finding Separators in Temporal Graphs., , , and . CoRR, (2017)As Time Goes By: Reflections on Treewidth for Temporal Graphs., , , , and . Treewidth, Kernels, and Algorithms, volume 12160 of Lecture Notes in Computer Science, page 49-77. Springer, (2020)Equitable Scheduling on a Single Machine., , , , , and . CoRR, (2020)Efficient computation of optimal temporal walks under waiting-time constraints., , , and . Appl. Netw. Sci., 5 (1): 73 (2020)Listing All Maximal k-Plexes in Temporal Graphs., , , , , and . ACM Journal of Experimental Algorithmics, 24 (1): 1.13:1-1.13:27 (2019)Complexity of Combinatorial Matrix Completion With Diameter Constraints., , and . CoRR, (2020)An Adaptive Version of Brandes' Algorithm for Betweenness Centrality., , , , and . ISAAC, volume 123 of LIPIcs, page 36:1-36:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Reflections on Multivariate Algorithmics and Problem Parameterization.. STACS, volume 5 of LIPIcs, page 17-32. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Faster Binary Mean Computation Under Dynamic Time Warping., , and . CoRR, (2020)Polynomial Time Data Reduction for Dominating Set, , and . CoRR, (2002)