| Computing exact solutions of consensus halving and the Borsuk-Ulam theorem A Deligkas, J Fearnley, T Melissourgos, PG Spirakis Journal of Computer and System Sciences 117, 75-98, 2021 | 23 | 2021 |
| Approximating the existential theory of the reals A Deligkas, J Fearnley, T Melissourgos, PG Spirakis Journal of Computer and System Sciences 125, 106-128, 2022 | 17* | 2022 |
| Pure-circuit: Strong inapproximability for PPAD A Deligkas, J Fearnley, A Hollender, T Melissourgos 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 15 | 2022 |
| Constant inapproximability for PPA A Deligkas, J Fearnley, A Hollender, T Melissourgos Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 14 | 2022 |
| Pizza sharing is PPA-hard A Deligkas, J Fearnley, T Melissourgos Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 4957-4965, 2022 | 9* | 2022 |
| Optimization of trading strategies using a genetic algorithm under the directional changes paradigm with multiple thresholds O Salman, T Melissourgos, M Kampouridis 2023 IEEE Congress on Evolutionary Computation (CEC), 1-8, 2023 | 4 | 2023 |
| An extension of the Moran process using type-specific connection graphs T Melissourgos, SE Nikoletseas, CL Raptopoulos, PG Spirakis Journal of Computer and System Sciences 124, 77-96, 2022 | 4 | 2022 |
| Multi-agent systems for computational economics and finance M Kampouridis, P Kanellopoulos, M Kyropoulou, T Melissourgos, ... AI Communications 35 (4), 369-380, 2022 | 4 | 2022 |
| Connected subgraph defense games EC Akrida, A Deligkas, T Melissourgos, PG Spirakis Algorithmica 83 (11), 3403-3431, 2021 | 4 | 2021 |
| Mutants and residents with different connection graphs in the Moran process T Melissourgos, S Nikoletseas, C Raptopoulos, P Spirakis LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018 | 4 | 2018 |
| Short paper: Strategic contention resolution in multiple channels with limited feedback G Christodoulou, T Melissourgos, PG Spirakis International Symposium on Algorithmic Game Theory, 245-250, 2018 | 3 | 2018 |
| Strategic contention resolution in multiple channels G Christodoulou, T Melissourgos, PG Spirakis International Workshop on Approximation and Online Algorithms, 165-180, 2018 | 3 | 2018 |
| Tight inapproximability for graphical games A Deligkas, J Fearnley, A Hollender, T Melissourgos Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 5600-5607, 2023 | 2 | 2023 |
| On the smoothed complexity of combinatorial local search Y Giannakopoulos, A Grosz, T Melissourgos arXiv preprint arXiv:2211.07547, 2022 | 2 | 2022 |
| Existence of evolutionarily stable strategies remains hard to decide for a wide range of payoff values T Melissourgos, P Spirakis International Conference on Algorithms and Complexity, 418-429, 2017 | 2 | 2017 |
| Walrasian equilibria in markets with small demands A Deligkas, T Melissourgos, PG Spirakis arXiv preprint arXiv:2005.11796, 2020 | 1 | 2020 |
| Pure-Circuit: Tight Inapproximability for PPAD A Deligkas, J Fearnley, A Hollender, T Melissourgos Journal of the ACM, 2024 | | 2024 |
| Algorithms and Complexity of Problems Arising from Strategic Settings T Melissourgos PQDT-Global, 2019 | | 2019 |
Argyrios DeligkasRoyal Holloway University of London在 rhul.ac.uk 的电子邮件经过验证
