Alexandros Hollender
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
19
Venues
10
Active years
2014–2026
Best venue rank
A*
Where they publish
Papers
19 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STOC | Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2025 | FOCS | High-to-Low Dimensional PPA-completeness: Borsuk-Ulam, Tucker, Consensus Halving, and Ham Sandwich. | Ruiquan Gao, Alexandros Hollender, Aviad Rubinstein |
| 2025 | ICLR | The Complexity of Two-Team Polymatrix Games with Independent Adversaries. | Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan |
| 2024 | STOC | The Complexity of Computing KKT Solutions of Quadratic Programs. | John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani |
| 2024 | STOC | PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. | Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Hgh, Alexandros Hollender |
| 2023 | AAAI | Tight Inapproximability for Graphical Games. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2023 | COLT | The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. | Alexandros Hollender, Emmanouil Zampetakis |
| 2023 | FOCS | Envy-Free Cake-Cutting for Four Agents. | Alexandros Hollender, Aviad Rubinstein |
| 2023 | SAGT | The Frontier of Intractability for EFX with Two Agents. | Paul W. Goldberg, Kasper Hgh, Alexandros Hollender |
| 2022 | FOCS | Pure-Circuit: Strong Inapproximability for PPAD. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2022 | FOCS | Separations in Proof Complexity and TFNP. | Mika Gs, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao |
| 2022 | STOC | Constant inapproximability for PPA. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2021 | FOCS | FIXP-membership via Convex Optimization: Games, Cakes, and Markets. | Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Hgh, Alexandros Hollender |
| 2021 | SODA | A Topological Characterization of Modulo- | Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis |
| 2021 | STOC | The complexity of gradient descent: CLS = PPAD ∩ PLS. | John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani |
| 2020 | AAAI | Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. | Paul W. Goldberg, Alexandros Hollender, Warut Suksompong |
| 2020 | IJCAI | Maximum Nash Welfare and Other Stories About EFX. | Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris |
| 2019 | ICALP | The Hairy Ball Problem is PPAD-Complete. | Paul W. Goldberg, Alexandros Hollender |
| 2014 | CRiSIS | Attacking Suggest Boxes in Web Applications Over HTTPS Using Side-Channel Stochastic Algorithms. | Alexander Schaub, Emmanuel Schneider, Alexandros Hollender, Vinicius Calasans, Laurent Jolie, Robin Touillon, Annelie Heuser, Sylvain Guilley, Olivier Rioul |