1. Beating approximation factor two for weighted tree augmentation with bounded costs;Adjiashvili D.;ACM Transactions on Algorithms,2018
2. H. Angelidakis D. Hyatt-Denesik and L. Sanitá. 2022. Node connectivity augmentation via iterative randomized rounding. Mathematical Programming. doi: 10.1007/s10107-022-01854-z. 10.1007/s10107-022-01854-z
3. H. Angelidakis D. Hyatt-Denesik and L. Sanitá. 2022. Node connectivity augmentation via iterative randomized rounding. Mathematical Programming. doi: 10.1007/s10107-022-01854-z.
4. É. Bamas, M. Drygala , and O. Svensson . 2022. A simple LP-based approximation algorithm for the matching augmentation problem . In Proceedings of the International Conference on Integer Programming and Combinatorial Optimization (IPCO), 57-69 . doi: 10.1007/978-3-031-06901-7_5. 10.1007/978-3-031-06901-7_5 É. Bamas, M. Drygala, and O. Svensson. 2022. A simple LP-based approximation algorithm for the matching augmentation problem. In Proceedings of the International Conference on Integer Programming and Combinatorial Optimization (IPCO), 57-69. doi: 10.1007/978-3-031-06901-7_5.
5. Saurabh. 2014 . Parameterized algorithms to preserve connectivity . In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), 800-811 . doi: 10.1007/978-3-662-43948-7_66. 10.1007/978-3-662-43948-7_66 Saurabh. 2014. Parameterized algorithms to preserve connectivity. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), 800-811. doi: 10.1007/978-3-662-43948-7_66.