1. Nearly tight low stretch spanning trees;I Abraham;49th Annual IEEE Symposium on Foundations of Computer Science (FOCS),2008
2. Beating approximation factor two for weighted tree augmentation with bounded costs;D Adjiashvili;ACM Transactions on Algorithms,2019
3. Node connectivity augmentation via iterative randomized rounding;H Angelidakis;Math. Program,2023
4. Parameterized algorithms to preserve connectivity;M Basavaraju;Automata, Languages, and Programming -41st International Colloquium (ICALP), Part I,2014
5. Improved approximation algorithms for (budgeted) node-weighted steiner problems;M H Bateni;SIAM J. Computing,2018