( en | de | ru )

 

Disambiguation of "Kontogiannis, Spyros C."

Author of the publication

copydeleteadd this publication to your clipboard
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses.

, and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 312-325. Springer, (2010)

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.

Spyros Rammos

Spyros Kritsikis

Spyros Thiveos

Spyros Krivas

Spyros Vassilas

 

Other publications of authors with the same name

Distance Oracles for Time-Dependent Networks., and . CoRR, (2013)"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments., , , and . SPAA, page 37-46. ACM, (1998)Approximations of Bimatrix Nash Equilibria., , and . Encyclopedia of Algorithms, Springer, (2008)Time-Dependent Alternative Route Planning: Theory and Practice., , and . Algorithms, 14 (8): 220 (2021)Recent Advances in Approximability of Bimatrix Nash., , and . Bulletin of the EATCS, (2009)Time-Dependent Alternative Route Planning., , and . ATMOS, volume 85 of OASIcs, page 8:1-8:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Exploiting Amorphous Data Parallelism to Speed-Up Massive Time-Dependent Shortest-Path Computations., , , and . ATMOS, volume 75 of OASIcs, page 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Engineering Oracles for Time-Dependent Road Networks., , , , , and . ALENEX, page 1-14. SIAM, (2016)Polynomial algorithms for approximating Nash equilibria of bimatrix games., , and . Theor. Comput. Sci., 410 (17): 1599-1606 (2009)Incentivizing Truthfulness in Crowdsourced Parking Ecosystems., , , and . ISC2, page 1-7. IEEE, (2021)