Scholar
Alexandros Hollender
Google Scholar ID: m7PgjYwAAAAJ
Post-Doctoral Research Fellow, All Souls College, University of Oxford
Theoretical Computer Science
Algorithms and Complexity
Algorithmic Game Theory
Optimization
Follow
Google Scholar
↗
Citations & Impact
All-time
Citations
783
H-index
16
i10-index
20
Publications
20
Co-authors
26
list available
Contact
No contact links provided.
Publications
12 items
The Complexity of Min-Max Optimization for Quadratic Polynomials
2026
Cited
0
On Cutting Cakes and Crossing Curves
2026
Cited
0
Min-Max Optimization Requires Exponentially Many Queries
2026
Cited
0
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
Efficient Equilibrium Computation in Symmetric First-Price Auctions
2026
Cited
0
Computing Equilibrium Points of Electrostatic Potentials
2025
Cited
0
Discrepancy Beyond Additive Functions with Applications to Fair Division
2025
Cited
0
Load more
Resume (English only)
Co-authors
26 total
Aris Filos-Ratsikas
University of Edinburgh
Co-author 2
John Fearnley
University of Liverpool
Argyrios Deligkas
Royal Holloway University of London
Themistoklis Melissourgos
University of Essex
Alexandros A. Voudouris
CSEE, University of Essex
Georgios Birmpas
University of Liverpool
Gilbert Maystre
Oracle