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.
137 Publications
2000 | Conference Paper | IST-REx-ID: 11802
Henzinger MH. Web information retrieval - an algorithmic perspective. In: 8th Annual European Symposium on Algorithms. Vol 1879. Springer Nature; 2000:1–8. doi:10.1007/3-540-45253-2_1
View
| DOI
1997 | Conference Paper | IST-REx-ID: 11803
Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs. In: 24th International Colloquium on Automata, Languages and Programming. Vol 1256. Springer Nature; 1997:594–604. doi:10.1007/3-540-63165-8_214
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11804
Henzinger MH, Telle JA. Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. In: 5th Scandinavian Workshop on Algorithm Theory. Vol 1097. Springer Nature; 1996:16–27. doi:10.1007/3-540-61422-2_117
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11910
Henzinger MH, Thorup M. Improved sampling with applications to dynamic graph algorithms. In: 23rd International Colloquium on Automata, Languages, and Programming. Vol 1099. Springer Nature; 1996:290-299. doi:10.1007/3-540-61440-0_136
View
| DOI
1996 | Book (Editor) | IST-REx-ID: 4612
Alur R, Henzinger TA, Sontag ED, eds. Hybrid Systems III: Verification and Control. Vol 1066. Berlin ; Heidelberg: Springer; 1996. doi:10.1007/BFb0020931
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