Παρακολούθηση
Haris Angelidakis
Haris Angelidakis
Researcher at CoW Protocol
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cow.fi - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
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
692017
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
552020
Stochastic congestion games with risk-averse players
H Angelidakis, D Fotakis, T Lianeas
International Symposium on Algorithmic Game Theory, 86-97, 2013
392013
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
292017
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
212022
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
142017
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
122018
Node connectivity augmentation via iterative randomized rounding
H Angelidakis, D Hyatt-Denesik, L Sanità
Mathematical Programming 199 (1), 995-1031, 2023
112023
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
52021
Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings
H Angelidakis
arXiv preprint arXiv:1807.09389, 2018
22018
Improved approximation algorithms for two Euclidean k-Center variants
H Angelidakis, I Sergeev, P Westermark
arXiv preprint arXiv:2112.05083, 2021
2021
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–11