( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How to Put Through Your Agenda in Collective Binary Decisions.

, , , , , и . ACM Trans. Economics and Comput., 4 (1): 5:1-5:28 (2015)

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.

Rolf Niedermeier

Rolf Niedermeier

Rolf Niedermeier

Ulrich Niedermeier

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

Theodor Niedermeier

 

Другие публикации лиц с тем же именем

Feedback Edge Sets in Temporal Graphs., , , и . WG, том 12301 из Lecture Notes in Computer Science, стр. 200-212. Springer, (2020)Efficient computation of optimal temporal walks under waiting-time constraints., , , и . Appl. Netw. Sci., 5 (1): 73 (2020)The Computational Complexity of Finding Separators in Temporal Graphs., , , и . CoRR, (2017)Interval Scheduling and Colorful Independent Sets., , , и . ISAAC, том 7676 из Lecture Notes in Computer Science, стр. 247-256. Springer, (2012)Listing All Maximal k-Plexes in Temporal Graphs., , , , , и . ACM Journal of Experimental Algorithmics, 24 (1): 1.13:1-1.13:27 (2019)Complexity of Combinatorial Matrix Completion With Diameter Constraints., , и . CoRR, (2020)An Adaptive Version of Brandes' Algorithm for Betweenness Centrality., , , , и . ISAAC, том 123 из LIPIcs, стр. 36:1-36:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Reflections on Multivariate Algorithmics and Problem Parameterization.. STACS, том 5 из LIPIcs, стр. 17-32. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)As Time Goes By: Reflections on Treewidth for Temporal Graphs., , , , и . Treewidth, Kernels, and Algorithms, том 12160 из Lecture Notes in Computer Science, стр. 49-77. Springer, (2020)Invitation to Fixed-Parameter Algorithms. Oxford University Press, (2006)