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
M. H. Henzinger, “Fully dynamic biconnectivity in graphs,” Algorithmica, vol. 13, no. 6. Springer Nature, pp. 503–538, 1995.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11684
M. H. Henzinger and V. King, “Fully dynamic biconnectivity and transitive closure,” in Proceedings of IEEE 36th Annual Foundations of Computer Science, Milwaukee, WI, United States, 1995, pp. 664–672.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11806
M. H. Henzinger, “Approximating minimum cuts under insertions,” in 22nd International Colloquium on Automata, Languages and Programming, Szeged, Hungary, 1995, vol. 944, pp. 280–291.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11805
M. H. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity in fully-dynamic graphs,” in 3rd Annual European Symposium on Algorithms, Corfu, Greece, 1995, vol. 979, pp. 171–184.
View | DOI
 

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

Filters and Search Terms

year=1995

Search

Filter Publications