Scholar
Argyrios Deligkas
Google Scholar ID: mAaAe9sAAAAJ
Royal Holloway University of London
Citations & Impact
Citations
675
H-index
15
i10-index
25
Publications
20
Co-authors
44
list available
Contact
Publications
Resume (English only)
Academic Achievements
- 1. Published a paper 'EF1 and EFX Orientations' at IJCAI 2025.
- 2. Published a paper 'Routing Few Robots in a Crowded Network' at WADS 2025.
- 3. Published a paper 'Pizza Sharing is PPA-hard' at ACM Transactions on Computation Theory.
- 4. Published a paper 'Agent-Constrained Truthful Facility Location Games' at Journal of Combinatorial Optimization.
- 5. Published a paper 'Fixed-Parameter Algorithms for Multiagent Pathfinding on Trees' at AAMAS 2025.
- 6. Published three papers at AAAI 2025:
- - 'How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs'
- - 'Balanced and Fair Partitioning of Friends'
- - 'The Complexity of Extending Fair Allocations of Indivisible Goods'
Research Experience
- Currently a Senior Lecturer (Associate Professor) at Royal Holloway University of London. Previously, he was a Post Doc at the University of Liverpool and in the department of Industrial Engineering and Management at Technion.
Education
- Received his PhD from the University of Liverpool under the supervision of Rahul Savani.
Background
- Research interests include computational complexity, algorithmic game theory, mechanism design, combinatorial optimization, parameterized complexity, and equilibrium computation.
Miscellany
- 1. Attended ALGA2025 in Sardinia in June 2025 and gave a talk on the computation of approximate Nash equilibria.
- 2. Visited Scotland in May 2025, gave a talk on temporal graphs at the FATA seminar in Glasgow, and a talk on fair division with set restrictions at the Econ/CS seminar in Edinburgh.
- 3. Published two new papers on Arxiv in September and October 2025:
- - 'Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs'
- - 'Mechanism Design with Outliers and Predictions'
