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, Monika H. “Web Information Retrieval - an Algorithmic Perspective.” In 8th Annual European Symposium on Algorithms, 1879:1–8. Springer Nature, 2000. https://doi.org/10.1007/3-540-45253-2_1.
View
| DOI
1997 | Conference Paper | IST-REx-ID: 11803
Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” In 24th International Colloquium on Automata, Languages and Programming, 1256:594–604. Springer Nature, 1997. https://doi.org/10.1007/3-540-63165-8_214.
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11804
Henzinger, Monika H, and Jan Arne Telle. “Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.” In 5th Scandinavian Workshop on Algorithm Theory, 1097:16–27. Springer Nature, 1996. https://doi.org/10.1007/3-540-61422-2_117.
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11910
Henzinger, Monika H, and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.” In 23rd International Colloquium on Automata, Languages, and Programming, 1099:290–99. Springer Nature, 1996. https://doi.org/10.1007/3-540-61440-0_136.
View
| DOI
1996 | Book (Editor) | IST-REx-ID: 4612
Alur, Rajeev, Thomas A Henzinger, and Eduardo D Sontag, eds. Hybrid Systems III: Verification and Control. Vol. 1066. Lecture Notes in Computer Science. Berlin ; Heidelberg: Springer, 1996. https://doi.org/10.1007/BFb0020931.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11806
Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” In 22nd International Colloquium on Automata, Languages and Programming, 944:280–291. Springer Nature, 1995. https://doi.org/10.1007/3-540-60084-1_81.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11805
Henzinger, Monika H, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.” In 3rd Annual European Symposium on Algorithms, 979:171–184. Springer Nature, 1995. https://doi.org/10.1007/3-540-60313-1_142.
View
| DOI