( en | de | ru )

 

Disambiguation of "Deligkas, Argyrios"

Author of the publication

copydeleteadd this publication to your clipboard
Binary Search in Graphs Revisited.

, , and . MFCS, volume 83 of LIPIcs, page 20:1-20:14. 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.

Argyrios Mavros

Argyrios Chronopoulos

Argyrios Kasioptas

Argyrios Stringaris

Theodor Argyrios Tsatsas

 

Other publications of authors with the same name

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems., , , , and . CoRR, (2023)Two's company, three's a crowd: Consensus-halving for a constant number of agents., , and . Artif. Intell., (2022)A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games., , and . CoRR, (2022)The Complexity of Envy-Free Graph Cutting., , , , and . CoRR, (2023)Connected Subgraph Defense Games., , , and . SAGT, volume 11801 of Lecture Notes in Computer Science, page 216-236. Springer, (2019)A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games., , and . SODA, page 3777-3787. SIAM, (2023)The k-Centre Problem for Classes of Cyclic Words., , , and . SOFSEM, volume 13878 of Lecture Notes in Computer Science, page 385-400. Springer, (2023)The Complexity of Fair Division of Indivisible Items with Externalities., , , and . AAAI, page 9653-9661. AAAI Press, (2024)Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems., , , , and . IJCAI, page 2642-2650. ijcai.org, (2023)Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents., , and . CoRR, (2020)