( en | de | ru )

 

Disambiguation of "Skretas, George"

Author of the publication

copydeleteadd this publication to your clipboard
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source.

, , , and . AAMAS, page 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. You can also use the button next to the name to display some publications already assigned to the person.

George Mertzios

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

Witold George

Hans George

George Glowik

George Leon

 

Other publications of authors with the same name

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source., , , , and . Inf. Comput., (2024)Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source., , , , and . CoRR, (2023)Minimizing Reachability Times on Temporal Graphs via Shifting Labels., , and . IJCAI, page 5333-5340. ijcai.org, (2023)Minimizing Reachability Times on Temporal Graphs via Shifting Labels., , and . CoRR, (2021)Towards Linear Spanners in All Temporal Cliques., , , , , , , , , and . CoRR, (2024)The Complexity of Growing a Graph., , , , and . ALGOSENSORS, volume 13707 of Lecture Notes in Computer Science, page 123-137. Springer, (2022)Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source., , , and . AAMAS, page 2222-2230. ACM, (2023)Distributed computation and reconfiguration in actively dynamic networks., , and . Distributed Comput., 35 (2): 185-206 (2022)On the transformation capability of feasible mechanisms for programmable matter., , and . J. Comput. Syst. Sci., (2019)The Complexity of Growing a Graph., , , , and . CoRR, (2021)