Henzinger, Monika H. “Algorithmic Aspects of Web Search Engines.”https://doi.org/10.1007/978-3-540-30140-0_2__In 2th Annual European Symposium on Algorithms, 3221:3. Springer Nature, 2004.https://doi.org/10.1007/978-3-540-30140-0_2 .
LibreCat: https://research-explorer.ista.ac.at/record/11801
DOI: 10.1007/978-3-540-30140-0_2

Henzinger, Monika H. “The Past, Present, and Future of Web Search Engines.”https://doi.org/10.1007/978-3-540-27836-8_2__In 31st International Colloquium on Automata, Languages and Programming, 3142:3. Springer Nature, 2004.https://doi.org/10.1007/978-3-540-27836-8_2 .
LibreCat: https://research-explorer.ista.ac.at/record/11800
DOI: 10.1007/978-3-540-27836-8_2

Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.”https://doi.org/10.1007/3-540-45253-2_1__In 8th Annual European Symposium on Algorithms, 1879:1–8. Springer Nature, 2000.https://doi.org/10.1007/3-540-45253-2_1 .
LibreCat: https://research-explorer.ista.ac.at/record/11802
DOI: 10.1007/3-540-45253-2_1

Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.”https://doi.org/10.1007/3-540-63165-8_214__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 .
LibreCat: https://research-explorer.ista.ac.at/record/11803
DOI: 10.1007/3-540-63165-8_214

Henzinger, Monika H, and Jan Arne Telle. “Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.”https://doi.org/10.1007/3-540-61422-2_117__In 5th Scandinavian Workshop on Algorithm Theory, 1097:16–27. Springer Nature, 1996.https://doi.org/10.1007/3-540-61422-2_117 .
LibreCat: https://research-explorer.ista.ac.at/record/11804
DOI: 10.1007/3-540-61422-2_117

Henzinger, Monika H, and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.”https://doi.org/10.1007/3-540-61440-0_136__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 .
LibreCat: https://research-explorer.ista.ac.at/record/11910
DOI: 10.1007/3-540-61440-0_136

Alur, Rajeev, Thomas A Henzinger, and Eduardo D Sontag, eds. Hybrid Systems III: Verification and Control. Vol. 1066. Lecture Notes in Computer Science. Berlinf; Heidelberg: Springer, 1996.https://doi.org/10.1007/BFb0020931 .
LibreCat: https://research-explorer.ista.ac.at/record/4612
DOI: 10.1007/BFb0020931

Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.”https://doi.org/10.1007/3-540-60084-1_81__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 .
LibreCat: https://research-explorer.ista.ac.at/record/11806
DOI: 10.1007/3-540-60084-1_81

Henzinger, Monika H, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.”https://doi.org/10.1007/3-540-60313-1_142__In 3rd Annual European Symposium on Algorithms, 979:171–184. Springer Nature, 1995.https://doi.org/10.1007/3-540-60313-1_142 .
LibreCat: https://research-explorer.ista.ac.at/record/11805
DOI: 10.1007/3-540-60313-1_142