Browse by People

Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 (2019) Algorithms and Complexity of Problems Arising from Strategic Settings. PhD thesis, University of Liverpool.

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2018) Approximating the Existential Theory of the Reals. In: 14th Conference on Web and Internet Economics (WINE 2018), 2018-12-15 - 2018-12-17, Oxford , UK.

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2022) Approximating the existential theory of the reals. Journal of Computer and System Sciences, 125. pp. 106-128.

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2019) Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. Leibniz International Proceedings in Informatics, LIPIcs, 132.

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2021) Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. In: ICALP 2019.

Akrida, Eleni C, Deligkas, Argyrios, Melissourgos, Themistoklis and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2021) Connected Subgraph Defense Games. ALGORITHMICA, 83 (11). pp. 3403-3431.

Akrida, Eleni C ORCID: 0000-0002-1126-1623, Deligkas, Argyrios, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2019) Connected Subgraph Defense Games. In: Algorithmic Game Theory.

Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. [Preprint]

Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing.

Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul ORCID: 0000-0001-5396-3749 (2017) Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. In: 10th International Conference on Algorithms and Complexity - CIAC 2017, 2017-5-24 - 2017-5-26, Athens Greece.

Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257, Nikoletseas, Sotiris, Raptopoulos, Christoforos and Spirakis, Paul ORCID: 0000-0001-5396-3749 (2018) Mutants and Residents with Different Connection Graphs in the Moran Process. LATIN 2018: THEORETICAL INFORMATICS, 10807. pp. 790-804.

Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2018) Mutants and Residents with Different Connection Graphs in the Moran Process. In: Latin American Theoretical Informatics Symposium, 2018-4-16 - 2018-4-19, Buenos Aires Argentina.

Deligkas, Argyrios, Fearnley, John and Melissourgos, Themistoklis (2022) Pizza Sharing Is PPA-Hard. THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 36. pp. 4957-4965.

Deligkas, Argyrios, Fearnley, John and Melissourgos, Themistoklis (2022) Pizza Sharing Is PPA-Hard. In: AAAI 2022.

Christodoulou, George, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2018) Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. .

Christodoulou, George, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2018) Strategic Contention Resolution in Multiple Channels. In: 16th Workshop on Approximation and Online Algorithms (WAOA 2018), 2018-8-23 - 2018-8-24, Helsinki Finland.

Melissourgos, Themistoklis, Nikoletseas, Sotiris E, Raptopoulos, Christoforos L and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2022) An extension of the Moran process using type-specific connection graphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 124. pp. 77-96.