Author of the publication

Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network.

, , and . MFCS, volume 83 of LIPIcs, page 75:1-75:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

 

Other publications of authors with the same name

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases., , , , and . J. Comb. Optim., 18 (3): 229-257 (2009)Dynamic Multi-level Overlay Graphs for Shortest Paths., , , , and . Math. Comput. Sci., 1 (4): 709-736 (2008)Election Control with Voters' Uncertainty: Hardness and Approximation Results., , , and . CoRR, (2019)The Minimum k-Storage Problem: Complexity, Approximation, and Experimental Analysis., , , and . IEEE Trans. Mob. Comput., 15 (7): 1797-1811 (2016)How to Gather Asynchronous Oblivious Robots on Anonymous Rings., , and . DISC, volume 7611 of Lecture Notes in Computer Science, page 326-340. Springer, (2012)Maximum flow and minimum-cost flow in multi-interface networks., , and . ICUIMC, page 19. ACM, (2011)Fairness in Influence Maximization through Randomization., , , and . J. Artif. Intell. Res., (2022)Finding disjoint paths in networks with star shared risk link groups., , , and . Theor. Comput. Sci., (2015)Generalized budgeted submodular set function maximization., , , and . Inf. Comput., (2021)Exploiting social influence to control elections based on positional scoring rules., , , and . Inf. Comput., 289 (Part): 104940 (2022)