Henzinger, Monika H. “The Past, Present, and Future of Web Search Engines.”10.1007/978-3-540-27836-8_2__31st International Colloquium on Automata, Languages and Programming, vol. 3142, Springer Nature, 2004, p. 3, doi:10.1007/978-3-540-27836-8_2.

Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.”10.1007/3-540-45253-2_1__8th Annual European Symposium on Algorithms, vol. 1879, Springer Nature, 2000, pp. 1–8, doi:10.1007/3-540-45253-2_1.

Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.”10.1007/3-540-63165-8_214__24th International Colloquium on Automata, Languages and Programming, vol. 1256, Springer Nature, 1997, pp. 594–604, 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.”10.1007/3-540-61422-2_117__5th Scandinavian Workshop on Algorithm Theory, vol. 1097, Springer Nature, 1996, pp. 16–27, doi:10.1007/3-540-61422-2_117.

Henzinger, Monika H., and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.”10.1007/3-540-61440-0_136__23rd International Colloquium on Automata, Languages, and Programming, vol. 1099, Springer Nature, 1996, pp. 290–99, doi:10.1007/3-540-61440-0_136.

Alur, Rajeev, et al., editors. Hybrid Systems III: Verification and Control. Vol. 1066, Springer, 1996, doi:10.1007/BFb0020931.

Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.”10.1007/3-540-60084-1_81__22nd International Colloquium on Automata, Languages and Programming, vol. 944, Springer Nature, 1995, pp. 280–291, doi:10.1007/3-540-60084-1_81.

Henzinger, Monika H., and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.”10.1007/3-540-60313-1_142__3rd Annual European Symposium on Algorithms, vol. 979, Springer Nature, 1995, pp. 171–184, doi:10.1007/3-540-60313-1_142.