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, M. H. (1995). Fully dynamic biconnectivity in graphs. Algorithmica. Springer Nature. https://doi.org/10.1007/bf01189067
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11684
Henzinger, M. H., & King, V. (1995). Fully dynamic biconnectivity and transitive closure. In Proceedings of IEEE 36th Annual Foundations of Computer Science (pp. 664–672). Milwaukee, WI, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/SFCS.1995.492668
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11806
Henzinger, M. H. (1995). Approximating minimum cuts under insertions. In 22nd International Colloquium on Automata, Languages and Programming (Vol. 944, pp. 280–291). Szeged, Hungary: Springer Nature. https://doi.org/10.1007/3-540-60084-1_81
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11805
Henzinger, M. H., & Poutré, H. (1995). Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In 3rd Annual European Symposium on Algorithms (Vol. 979, pp. 171–184). Corfu, Greece: Springer Nature. https://doi.org/10.1007/3-540-60313-1_142
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11928 | OA
Alberts, D., & Henzinger, M. H. (1995). Average case analysis of dynamic graph algorithms. In 6th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 312–321). San Francisco, CA, United States: Society for Industrial and Applied Mathematics.
[Published Version] View | Files available | Download Published Version (ext.)
 

Filters and Search Terms

year=1995

Search

Filter Publications