( en | de | ru )

 

Disambiguation of "Skretas, George"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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 . CoRR, (2023)Minimizing Reachability Times on Temporal Graphs via Shifting Labels., , and . IJCAI, page 5333-5340. ijcai.org, (2023)Distributed Computation and Reconfiguration in Actively Dynamic Networks., , and . PODC, page 448-457. ACM, (2020)Temporal Network Creation Games., , , , , , and . IJCAI, page 2511-2519. 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)On the transformation capability of feasible mechanisms for programmable matter., , and . J. Comput. Syst. Sci., (2019)Distributed computation and reconfiguration in actively dynamic networks., , and . Distributed Comput., 35 (2): 185-206 (2022)Towards Linear Spanners in All Temporal Cliques., , , , , , , , , and . CoRR, (2024)Minimizing Reachability Times on Temporal Graphs via Shifting Labels., , and . CoRR, (2021)