1. Agarwal, P., Chang, H., Munagala, K., Taylor, E., Welzl, E.: Clustering under perturbation stability in near-linear time. In: Proceedings of the 40th IARCS Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). LIPIcs, vol. 182, pp. 8:1–8:16 (2020)
2. Alon, N., Feldman, M., Procaccia, A., Tennenholtz, M.: Strategyproof approximation of the minimax on networks. Math. Oper. Res. 35(3), 513–526 (2010)
3. Angelidakis, H., Makarychev, K., Makarychev, Y.: Algorithms for stable and perturbation-resilient problems. In: Proceedings of the 49th ACM Symposium on Theory of Computing (STOC 2017), pp. 438–451 (2017)
4. Archer, A., Kleinberg, R.: Truthful germs are contagious: a local-to-global characterization of truthfulness. In: Proceedings of the 9th ACM Conference on Electronic Commerce (EC 2008), pp. 21–30 (2008)
5. Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 1027–1035. SIAM (2007)