1. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM (JACM) 48(5), 1069–1090 (2001)
2. Bhattacharya, B., Hell, P., Huang, J.: A linear algorithm for maximum weight cliques in proper circular arc graphs. SIAM J. Discrete Math. 9(2), 274–289 (1996)
3. Bonamy, M., Bonnet, E., Bousquet, N., Charbit, P., Thomassé, S.: EPTAS for max clique on disks and unit balls. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 568–579. IEEE (2018)
4. Bonnet, E., Giannopoulos, P., Kim, E.J., Rzążewski, P., Sikora, F.: QPTAS and subexponential algorithm for maximum clique on disk graphs. In 34th International Symposiumon Computational Geometry (SoCG), pp. 12:1–12:15 (2018)
5. Bonnet, É., Grelier, N., Miltzow, T.: Maximum clique in disk-like intersection graphs (2020). arXiv preprint arXiv:2003.02583