Author of the publication

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source.

, , , , and . Inf. Comput., (2024)

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

Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents., , and . CoRR, (2020)Pizza Sharing Is PPA-Hard., , and . AAAI, page 4957-4965. AAAI Press, (2022)Tight Inapproximability for Graphical Games., , , and . AAAI, page 5600-5607. AAAI Press, (2023)Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy., , , , and . ICALP, volume 297 of LIPIcs, page 53:1-53:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Tree Polymatrix Games Are PPAD-Hard., , and . ICALP, volume 168 of LIPIcs, page 38:1-38:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Heterogeneous facility location with limited resources., , and . Games Econ. Behav., (May 2023)On the Hardness of Energy Minimisation for Crystal Structure Prediction., , , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 587-596. Springer, (2020)Constant inapproximability for PPA., , , and . STOC, page 1010-1023. ACM, (2022)The Parameterized Complexity of Connected Fair Division., , , , and . IJCAI, page 139-145. ijcai.org, (2021)Optimizing Reachability Sets in Temporal Graphs by Delaying., and . AAAI, page 9810-9817. AAAI Press, (2020)