( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source.

, , , и . AAMAS, стр. 2222-2230. ACM, (2023)

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.

George Mertzios

Combinatorial optimization and recognition of graph classes with applications to related models. TU Aachen, (2009)

George Anderson

Witold George

Hans George

George Glowik

 

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

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source., , , , и . Inf. Comput., (2024)Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source., , , , и . CoRR, (2023)Minimizing Reachability Times on Temporal Graphs via Shifting Labels., , и . IJCAI, стр. 5333-5340. ijcai.org, (2023)Distributed Computation and Reconfiguration in Actively Dynamic Networks., , и . PODC, стр. 448-457. ACM, (2020)Temporal Network Creation Games., , , , , , и . IJCAI, стр. 2511-2519. ijcai.org, (2023)All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots., , и . SAND, том 292 из LIPIcs, стр. 9:1-9:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Transformation Capability of Feasible Mechanisms for Programmable Matter., , и . ICALP, том 80 из LIPIcs, стр. 136:1-136:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Distributed computation and reconfiguration in actively dynamic networks., , и . Distributed Comput., 35 (2): 185-206 (2022)On the transformation capability of feasible mechanisms for programmable matter., , и . J. Comput. Syst. Sci., (2019)The Complexity of Growing a Graph., , , , и . CoRR, (2021)