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 MH. Fully dynamic biconnectivity in graphs. Algorithmica. 1995;13(6):503-538. doi:10.1007/bf01189067
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11684
Henzinger MH, King V. Fully dynamic biconnectivity and transitive closure. In: Proceedings of IEEE 36th Annual Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 1995:664-672. doi:10.1109/SFCS.1995.492668
View | DOI
 

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

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

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

Filters and Search Terms

year=1995

Search

Filter Publications