Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
52 Publications
1995 | Journal Article | IST-REx-ID: 11677
Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.” Algorithmica. Springer Nature, 1995. https://doi.org/10.1007/bf01189067.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11684
Henzinger, Monika H, and V. King. “Fully Dynamic Biconnectivity and Transitive Closure.” In Proceedings of IEEE 36th Annual Foundations of Computer Science, 664–72. Institute of Electrical and Electronics Engineers, 1995. https://doi.org/10.1109/SFCS.1995.492668.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11806
Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” In 22nd International Colloquium on Automata, Languages and Programming, 944:280–291. Springer Nature, 1995. https://doi.org/10.1007/3-540-60084-1_81.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11805
Henzinger, Monika H, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.” In 3rd Annual European Symposium on Algorithms, 979:171–184. Springer Nature, 1995. https://doi.org/10.1007/3-540-60313-1_142.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11928 | 
Alberts, David, and Monika H Henzinger. “Average Case Analysis of Dynamic Graph Algorithms.” In 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 312–21. Society for Industrial and Applied Mathematics, 1995.
[Published Version]
View
| Files available
| Download Published Version (ext.)