Haris Angelidakis
Haris Angelidakis
Postdoctoral researcher at TU Eindhoven
Bestätigte E-Mail-Adresse bei ttic.edu - Startseite
Zitiert von
Zitiert von
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
Stochastic congestion games with risk-averse players
H Angelidakis, D Fotakis, T Lianeas
International Symposium on Algorithmic Game Theory, 86-97, 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
A technique for obtaining true approximations for k-center with covering constraints
G Anegg, H Angelidakis, A Kurpisz, R Zenklusen
Mathematical Programming, 1-25, 2021
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
Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem
H Angelidakis, P Awasthi, A Blum, V Chatziafratis, C Dan
Proceedings of the 27th Annual European Symposium on Algorithms, 7:1 - 7:16, 2019
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
Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings
H Angelidakis
arXiv preprint arXiv:1807.09389, 2018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–8