Stochastic Congestion Games with Risk-Averse Players. - Haris Angelidakis; Dimitris Fotakis 001; Thanasis Lianeas (SAGT, 2013)

An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut. - Haris Angelidakis; Yury Makarychev; Pasin Manurangsi (IPCO, 2017)

Algorithmic and Hardness Results for the Hub Labeling Problem. - Haris Angelidakis; Yury Makarychev; Vsevolod Oparin (SODA, 2017)

Algorithms for stable and perturbation-resilient problems. - Haris Angelidakis; Konstantin Makarychev; Yury Makarychev (STOC, 2017)

Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings. - Haris Angelidakis (CoRR, 2018)

Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem. - Haris Angelidakis; Pranjal Awasthi; Avrim Blum; Vaggos Chatziafratis; Chen Dan 001 (ESA, 2019)

Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. - Georg Anegg; Haris Angelidakis; Rico Zenklusen (SOSA, 2021)

Improved approximation algorithms for two Euclidean k-Center variants. - Haris Angelidakis; Ivan Sergeev; Pontus Westermark (CoRR, 2021)

Fair and Fast k-Center Clustering for Data Summarization. - Haris Angelidakis; Adam Kurpisz; Leon Sering; Rico Zenklusen (ICML, 2022)

A technique for obtaining true approximations for k-center with covering constraints. - Georg Anegg; Haris Angelidakis; Adam Kurpisz; Rico Zenklusen (Math. Program., 2022)

Node connectivity augmentation via iterative randomized rounding. - Haris Angelidakis; Dylan Hyatt-Denesik; Laura Sanità (Math. Program., 2023)