Haris Angelidakis

18 papers A* 3A 1B 3Journal 10Unranked 1

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Node connectivity augmentation via iterative randomized rounding. Math. Program. Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità
2022	J	`jnl`	A technique for obtaining true approximations for k-center with covering constraints. Math. Program. Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
2022	A*	`conf`	Fair and Fast k-Center Clustering for Data Summarization. ICML Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen
2021	J	`jnl`	Improved approximation algorithms for two Euclidean k-Center variants. CoRR Haris Angelidakis, Ivan Sergeev, Pontus Westermark
2021	J	`jnl`	Node Connectivity Augmentation via Iterative Randomized Rounding. CoRR Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità
2021	—	`conf`	Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. SOSA Georg Anegg, Haris Angelidakis, Rico Zenklusen
2020	B	`conf`	A Technique for Obtaining True Approximations for k-Center with Covering Constraints. IPCO Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
2020	J	`jnl`	A Technique for Obtaining True Approximations for k-Center with Covering Constraints. CoRR Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
2020	J	`jnl`	Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. CoRR Georg Anegg, Haris Angelidakis, Rico Zenklusen
2019	A	`conf`	Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem. ESA Haris Angelidakis, Pranjal Awasthi, Avrim Blum, Vaggos Chatziafratis, Chen Dan
2018	J	`jnl`	Bilu-Linial stability, certified algorithms and the Independent Set problem. CoRR Haris Angelidakis, Pranjal Awasthi, Avrim Blum, Vaggos Chatziafratis, Chen Dan
2018	J	`jnl`	Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings. CoRR Haris Angelidakis
2017	A*	`conf`	Algorithmic and Hardness Results for the Hub Labeling Problem. SODA Haris Angelidakis, Yury Makarychev, Vsevolod Oparin
2017	A*	`conf`	Algorithms for stable and perturbation-resilient problems. STOC Haris Angelidakis, Konstantin Makarychev, Yury Makarychev
2017	B	`conf`	An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut. IPCO Haris Angelidakis, Yury Makarychev, Pasin Manurangsi
2016	J	`jnl`	Algorithmic and Hardness Results for the Hub Labeling Problem. CoRR Haris Angelidakis, Yury Makarychev, Vsevolod Oparin
2016	J	`jnl`	An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut. CoRR Haris Angelidakis, Yury Makarychev, Pasin Manurangsi
2013	B	`conf`	Stochastic Congestion Games with Risk-Averse Players. SAGT Haris Angelidakis, Dimitris Fotakis, Thanasis Lianeas