( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Valued Authorization Policy Existence Problem: Theory and Experiments.

, , , , и . ACM Trans. Priv. Secur., 25 (4): 28:1-28:32 (2022)

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 Eiben

Bernd Eiben

Robert Eiben

Klaus Eiben

Jürgen Eiben

 

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

Complexity of the Steiner Network Problem with Respect to the Number of Terminals., , , и . CoRR, (2018)How to Navigate Through Obstacles?., и . ICALP, том 107 из LIPIcs, стр. 48:1-48:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Valued Authorization Policy Existence Problem: Theory and Experiments., , , , и . ACM Trans. Priv. Secur., 25 (4): 28:1-28:32 (2022)On the Complexity of Rainbow Coloring Problems., , и . IWOCA, том 9538 из Lecture Notes in Computer Science, стр. 209-220. Springer, (2015)Manipulating Districts to Win Elections: Fine-Grained Complexity., , , и . AAAI, стр. 1902-1909. AAAI Press, (2020)Counting Linear Extensions: Parameterizations by Treewidth., , , и . ESA, том 57 из LIPIcs, стр. 39:1-39:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems., , , , и . IJCAI, стр. 2642-2650. ijcai.org, (2023)Small Resolution Proofs for QBF using Dependency Treewidth., , и . STACS, том 96 из LIPIcs, стр. 28:1-28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Polynomial Kernel for Line Graph Deletion., и . ESA, том 173 из LIPIcs, стр. 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The parameterized complexity of welfare guarantees in Schelling segregation., , и . Theor. Comput. Sci., (2024)