Themistoklis Melissourgos
Scholar

Themistoklis Melissourgos

Google Scholar ID: t1KpSQoAAAAJ
University of Essex
Algorithmic game theoryComputational complexityApproximation algorithms
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
165
 
H-index
7
 
i10-index
6
 
Publications
20
 
Co-authors
12
list available
Contact
No contact links provided.
Publications
4 items
Constant Inapproximability for Fisher Markets
2026
Cited
0
Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
2026
Cited
0
Online EFX Allocations with Predictions
2025
Cited
0
On the Smoothed Complexity of Combinatorial Local Search
International Colloquium on Automata, Languages and Programming · 2022
Cited
5
Resume (English only)
Co-authors
12 total
Argyrios Deligkas
Argyrios Deligkas
Royal Holloway University of London
John Fearnley
John Fearnley
University of Liverpool
Paul Spirakis
Paul Spirakis
Professor of Computer Science U. Liverpool and U. Patras
Alexandros Hollender
Alexandros Hollender
Post-Doctoral Research Fellow, All Souls College, University of Oxford
Michael Kampouridis
Michael Kampouridis
Reader, School of Computer Science and Electronic Engineering, University of Essex
Sotiris Nikoletseas
Sotiris Nikoletseas
University of Patras and CTI
Giorgos Christodoulou
Giorgos Christodoulou
Aristotle University of Thessaloniki
Co-author 8
Co-author 8