Publications
- Node Connectivity Augmentation via Iterative Randomized Rounding.
Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanita.
In Mathematical Programming (2022).
- Fair and Fast k-Center Clustering for Data Summarization.
Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen.
In ICML 2022.
- Improved approximation algorithms for two Euclidean k-Center variants.
Haris Angelidakis, Ivan Sergeev, Pontus Westermark.
Preprint (2021).
- Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture.
Georg Anegg, Haris Angelidakis, Rico Zenklusen.
In SOSA 2021.
- A Technique for Obtaining True Approximations for k-Center with Covering Constrains.
Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen.
In Mathematical Programming (2021). Preliminary version appeared in IPCO 2020.
- Bilu-Linial stability, certified algorithms and the Independent Set problem.
Haris Angelidakis, Pranjal Awasthi, Avrim Blum, Vaggos Chatziafratis, Chen Dan.
In ESA 2019.
- Algorithms for Stable and Perturbation-Resilient Problems.
Haris Angelidakis, Konstantin Makarychev, Yury Makarychev.
In STOC 2017.
(Some results first reported by the last 2 authors in the arXiv preprint Metric Perturbation Resilience).
- An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut.
Haris Angelidakis, Yury Makarychev, Pasin Manurangsi.
In IPCO 2017.
- Algorithmic and Hardness Results for the Hub Labeling Problem.
Haris Angelidakis, Yury Makarychev, Vsevolod Oparin.
In SODA 2017.
- Stochastic Congestion Games with Risk-Averse Players.
Haris Angelidakis, Dimitris Fotakis, Thanasis Lianeas.
In SAGT 2013.
Theses
