Haris Angelidakis

Cited by

	All	Since 2020
Citations	261	193
h-index	8	8
i10-index	8	7

2014201520162017201820192020202120222023202420251 9 4 14 19 18 30 22 38 49 47 5

Public access

View all

7 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Rico ZenklusenETH ZurichVerified email at math.ethz.ch
Yury MakarychevProfessor of Computer Science, Toyota Technological Institute at ChicagoVerified email at ttic.edu
Adam KurpiszBern University of Applied Sciences, ETH ZürichVerified email at ifor.math.ethz.ch
Georg AneggETH ZurichVerified email at ifor.math.ethz.ch
Konstantin MakarychevNorthwestern UniversityVerified email at northwestern.edu
Thanasis LianeasVerified email at corelab.ntua.gr
Dimitris FotakisProfessor, Electrical & Computer Eng., NTU AthensVerified email at cs.ntua.gr
Pasin ManurangsiGoogle ResearchVerified email at google.com
Leon SeringPostDoc, ETH ZürichVerified email at math.ethz.ch
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at ChicagoVerified email at ttic.edu
Vaggos ChatziafratisUniversity of California, Santa CruzVerified email at cs.stanford.edu
pranjal awasthiGoogleVerified email at rutgers.edu
Chen DanPostdoctoral Researcher, Toyota Technological Institute at ChicagoVerified email at ttic.edu
Laura SanitàAssociate Professor, Bocconi University of MilanVerified email at unibocconi.it
Dylan Hyatt-DenesikVerified email at tue.nl
Dr. Ivan SergeevPostdoctoral Researcher, IST AustriaVerified email at ist.ac.at

Haris Angelidakis

Researcher at CoW Protocol

Verified email at cow.fi - Homepage

Theoretical Computer Science Approximation Algorithms Combinatorial Optimization


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Algorithms for stable and perturbation-resilient problems H Angelidakis, K Makarychev, Y Makarychev Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	69	2017
A Technique for Obtaining True Approximations for k-Center with Covering Constraints G Anegg, H Angelidakis, A Kurpisz, R Zenklusen International conference on integer programming and combinatorial …, 2020	56	2020
Stochastic congestion games with risk-averse players H Angelidakis, D Fotakis, T Lianeas International Symposium on Algorithmic Game Theory, 86-97, 2013	39	2013
An improved integrality gap for the Călinescu-Karloff-Rabani relaxation for multiway cut H Angelidakis, Y Makarychev, P Manurangsi International Conference on Integer Programming and Combinatorial …, 2017	29	2017
Fair and fast k-center clustering for data summarization H Angelidakis, A Kurpisz, L Sering, R Zenklusen International Conference on Machine Learning, 669-702, 2022	23	2022
Algorithmic and hardness results for the hub labeling problem H Angelidakis, Y Makarychev, V Oparin Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	14	2017
Bilu-linial stability, certified algorithms and the independent set problem H Angelidakis, P Awasthi, A Blum, V Chatziafratis, C Dan arXiv preprint arXiv:1810.08414, 2018	12	2018
Node connectivity augmentation via iterative randomized rounding H Angelidakis, D Hyatt-Denesik, L Sanità Mathematical Programming 199 (1), 995-1031, 2023	11	2023
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture∗ G Anegg, H Angelidakis, R Zenklusen Symposium on Simplicity in Algorithms (SOSA), 196-203, 2021	6	2021
Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings H Angelidakis arXiv preprint arXiv:1807.09389, 2018	2	2018
Improved approximation algorithms for two Euclidean k-Center variants H Angelidakis, I Sergeev, P Westermark arXiv preprint arXiv:2112.05083, 2021		2021

The system can't perform the operation now. Try again later.

Articles 1–11

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors