1. Adjiashvili, D.: Beating approximation factor two for weighted tree augmentation with bounded costs. ACM Trans. Alg. (TALG) 15(2), 19 (2018)
2. Lecture Notes in Computer Science;D Adjiashvili,2014
3. Adjiashvili, D., Hommelsheim, F., Mühlenthaler, M.: Flexible graph connectivity (2019).
https://arxiv.org/abs/1910.13297
4. Adjiashvili, D., Stiller, S., Zenklusen, R.: Bulk-robust combinatorial optimization. Math. Program. 149(1–2), 361–390 (2015).
https://doi.org/10.1007/s10107-014-0760-6
5. Byrka, J., Grandoni, F., Ameli, A.J.: Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree (2019).
https://arxiv.org/abs/1911.02259