Author of the publication

Distributed computation and reconfiguration in actively dynamic networks.

, , and . Distributed Comput., 35 (2): 185-206 (2022)

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

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)On the Transformation Capability of Feasible Mechanisms for Programmable Matter., , and . ICALP, volume 80 of LIPIcs, page 136:1-136:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Complexity of Growing a Graph., , , , and . CoRR, (2021)Distributed computation and reconfiguration in actively dynamic networks., , and . Distributed Comput., 35 (2): 185-206 (2022)Distributed Computation and Reconfiguration in Actively Dynamic Networks., , and . PODC, page 448-457. ACM, (2020)All for One and One for All: An O(1)-Musketeers Universal Transformation for Rotating Robots., , and . SAND, volume 292 of LIPIcs, page 9:1-9:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Temporal Network Creation Games., , , , , , and . IJCAI, page 2511-2519. ijcai.org, (2023)The Complexity of Growing a Graph., , , , and . ALGOSENSORS, volume 13707 of Lecture Notes in Computer Science, page 123-137. Springer, (2022)