( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Models and Algorithms for Election Control through Influence Maximization.

, , , , и . ICTCS, том 2504 из CEUR Workshop Proceedings, стр. 97-103. CEUR-WS.org, (2019)

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.

Uta D'Angelo

Rainer D'Angelo

Gennaro D'Angelo

Pablo D'Angelo

Igor D'Angelo

 

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

Maximum flow and minimum-cost flow in multi-interface networks., , и . ICUIMC, стр. 19. ACM, (2011)Dynamic Multi-level Overlay Graphs for Shortest Paths., , , , и . Math. Comput. Sci., 1 (4): 709-736 (2008)Election Control with Voters' Uncertainty: Hardness and Approximation Results., , , и . CoRR, (2019)How to Gather Asynchronous Oblivious Robots on Anonymous Rings., , и . DISC, том 7611 из Lecture Notes in Computer Science, стр. 326-340. Springer, (2012)Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases., , , , и . J. Comb. Optim., 18 (3): 229-257 (2009)The Minimum k-Storage Problem: Complexity, Approximation, and Experimental Analysis., , , и . IEEE Trans. Mob. Comput., 15 (7): 1797-1811 (2016)Fairness in Influence Maximization through Randomization., , , и . J. Artif. Intell. Res., (2022)Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies., , и . ICALP, том 198 из LIPIcs, стр. 59:1-59:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Finding disjoint paths in networks with star shared risk link groups., , , и . Theor. Comput. Sci., (2015)Generalized budgeted submodular set function maximization., , , и . Inf. Comput., (2021)