Haris Angelidakis 个人学术档案

引用次数

	总计	2019 年至今
引用	233	183
h 指数	7	7
i10 指数	7	6

201420152016201720182019202020212022202320241 9 4 13 19 18 29 22 37 43 32

开放获取的出版物数量

查看全部

7 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Rico ZenklusenETH Zurich在 math.ethz.ch 的电子邮件经过验证
Yury MakarychevProfessor of Computer Science, Toyota Technological Institute at Chicago在 ttic.edu 的电子邮件经过验证
Adam KurpiszBern University of Applied Sciences, ETH Zürich在 ifor.math.ethz.ch 的电子邮件经过验证
Georg AneggETH Zurich在 ifor.math.ethz.ch 的电子邮件经过验证
Konstantin MakarychevNorthwestern University在 northwestern.edu 的电子邮件经过验证
Thanasis Lianeas在 corelab.ntua.gr 的电子邮件经过验证
Dimitris FotakisProfessor, Electrical & Computer Eng., NTU Athens在 cs.ntua.gr 的电子邮件经过验证
Pasin ManurangsiGoogle Research在 google.com 的电子邮件经过验证
Leon SeringPostDoc, ETH Zürich在 math.ethz.ch 的电子邮件经过验证
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at Chicago在 ttic.edu 的电子邮件经过验证
Vaggos ChatziafratisUniversity of California, Santa Cruz在 cs.stanford.edu 的电子邮件经过验证
pranjal awasthiGoogle在 rutgers.edu 的电子邮件经过验证
Chen DanPostdoctoral Researcher, Toyota Technological Institute at Chicago在 ttic.edu 的电子邮件经过验证
Laura SanitàAssociate Professor, Bocconi University of Milan在 unibocconi.it 的电子邮件经过验证
Dylan Hyatt-Denesik在 tue.nl 的电子邮件经过验证
Ivan SergeevDoctoral Student, ETH Zürich在 ifor.math.ethz.ch 的电子邮件经过验证

关注

Haris Angelidakis

Researcher at CoW Protocol

在 cow.fi 的电子邮件经过验证 - 首页

Theoretical Computer Science Approximation Algorithms Combinatorial Optimization


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	64	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	53	2020
Stochastic congestion games with risk-averse players H Angelidakis, D Fotakis, T Lianeas International Symposium on Algorithmic Game Theory, 86-97, 2013	38	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	28	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	14	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	12	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	11	2018
Node connectivity augmentation via iterative randomized rounding H Angelidakis, D Hyatt-Denesik, L Sanità Mathematical Programming 199 (1), 995-1031, 2023	7	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	4	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

系统目前无法执行此操作，请稍后再试。

文章 1–11

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用