Henzinger, Monika H., et al. “Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.”10.1007/978-3-662-47672-7_59__42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 725–36, doi:10.1007/978-3-662-47672-7_59.
LibreCat: https://research-explorer.ista.ac.at/record/11785
DOI: 10.1007/978-3-662-47672-7_59
arXiv: 1612.03856

Henzinger, Monika H., et al. “Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.”10.1007/978-3-662-47672-7_58__2nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 713–24, doi:10.1007/978-3-662-47672-7_58.
LibreCat: https://research-explorer.ista.ac.at/record/11787
DOI: 10.1007/978-3-662-47672-7_58
arXiv: 1412.6466

Bhattacharya, Sayan, et al. “Design of Dynamic Algorithms via Primal-Dual Method.”10.1007/978-3-662-47672-7_17__42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 206–18, doi:10.1007/978-3-662-47672-7_17.
LibreCat: https://research-explorer.ista.ac.at/record/11786
DOI: 10.1007/978-3-662-47672-7_17
arXiv: 1604.05337