( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Complexity of Periodic Energy Minimisation.

, , , и . MFCS, том 241 из LIPIcs, стр. 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Argyrios Mavros

Argyrios Chronopoulos

Argyrios Kasioptas

Argyrios Stringaris

Theodor Argyrios Tsatsas

 

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

Directed Graph Minors and Serial-Parallel Width., и . MFCS, том 117 из LIPIcs, стр. 44:1-44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games.. University of Liverpool, UK, (2016)British Library, EThOS.Optimizing Reachability Sets in Temporal Graphs by Delaying., и . AAAI, стр. 9810-9817. AAAI Press, (2020)Minimizing Reachability Times on Temporal Graphs via Shifting Labels., , и . IJCAI, стр. 5333-5340. ijcai.org, (2023)Heterogeneous Facility Location Games., и . AAMAS, стр. 623-631. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem., , , и . ICALP, том 132 из LIPIcs, стр. 138:1-138:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Hardness of Energy Minimisation for Crystal Structure Prediction., , , и . SOFSEM, том 12011 из Lecture Notes in Computer Science, стр. 587-596. Springer, (2020)Tight Inapproximability for Graphical Games., , , и . AAAI, стр. 5600-5607. AAAI Press, (2023)Pizza Sharing Is PPA-Hard., , и . AAAI, стр. 4957-4965. AAAI Press, (2022)Constant inapproximability for PPA., , , и . STOC, стр. 1010-1023. ACM, (2022)