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. 1995. Fully dynamic biconnectivity in graphs. Algorithmica. 13(6), 503–538.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11684
Henzinger MH, King V. 1995. Fully dynamic biconnectivity and transitive closure. Proceedings of IEEE 36th Annual Foundations of Computer Science. Foundations of Computer Science, 664–672.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11806
Henzinger MH. 1995. Approximating minimum cuts under insertions. 22nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 944, 280–291.
View | DOI
 

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

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

Filters and Search Terms

year=1995

Search

Filter Publications