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
Fully dynamic biconnectivity in graphs
M.H. Henzinger, Algorithmica 13 (1995) 503–538.
View
| DOI
M.H. Henzinger, Algorithmica 13 (1995) 503–538.
1995 | Conference Paper | IST-REx-ID: 11684
Fully dynamic biconnectivity and transitive closure
M.H. Henzinger, V. King, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 1995, pp. 664–672.
View
| DOI
M.H. Henzinger, V. King, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 1995, pp. 664–672.
1995 | Conference Paper | IST-REx-ID: 11806
Approximating minimum cuts under insertions
M.H. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming, Springer Nature, 1995, pp. 280–291.
View
| DOI
M.H. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming, Springer Nature, 1995, pp. 280–291.
1995 | Conference Paper | IST-REx-ID: 11805
Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
M.H. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms, Springer Nature, 1995, pp. 171–184.
View
| DOI
M.H. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms, Springer Nature, 1995, pp. 171–184.
1995 | Conference Paper | IST-REx-ID: 11928 |
Average case analysis of dynamic graph algorithms
D. Alberts, M.H. Henzinger, in:, 6th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 1995, pp. 312–321.
[Published Version]
View
| Files available
| Download Published Version (ext.)
D. Alberts, M.H. Henzinger, in:, 6th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 1995, pp. 312–321.