G. Juhás, I. Kazlov, and A. Juhásová, “Instance Deadlock: A Mystery behind Frozen Programs,” in Applications and Theory of Petri Nets, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 1–17.
LibreCat: https://research-explorer.ista.ac.at/record/5940
DOI: 10.1007/978-3-642-13675-7_1

M. H. Henzinger, “Algorithmic aspects of web search engines,” in 2th Annual European Symposium on Algorithms, Bergen, Norway, 2004, vol. 3221, p. 3.
LibreCat: https://research-explorer.ista.ac.at/record/11801
DOI: 10.1007/978-3-540-30140-0_2

M. H. Henzinger, “The past, present, and future of web search engines,” in 31st International Colloquium on Automata, Languages and Programming, Turku, Finland, 2004, vol. 3142, p. 3.
LibreCat: https://research-explorer.ista.ac.at/record/11800
DOI: 10.1007/978-3-540-27836-8_2

M. H. Henzinger, “Web information retrieval - an algorithmic perspective,” in 8th Annual European Symposium on Algorithms, Saarbrücken, Germany, 2000, vol. 1879, pp. 1–8.
LibreCat: https://research-explorer.ista.ac.at/record/11802
DOI: 10.1007/3-540-45253-2_1

M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,” in 24th International Colloquium on Automata, Languages and Programming, Bologna, Italy, 1997, vol. 1256, pp. 594–604.
LibreCat: https://research-explorer.ista.ac.at/record/11803
DOI: 10.1007/3-540-63165-8_214

M. H. Henzinger and J. A. Telle, “Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning,” in 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, 1996, vol. 1097, pp. 16–27.
LibreCat: https://research-explorer.ista.ac.at/record/11804
DOI: 10.1007/3-540-61422-2_117

M. H. Henzinger and M. Thorup, “Improved sampling with applications to dynamic graph algorithms,” in 23rd International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 1996, vol. 1099, pp. 290–299.
LibreCat: https://research-explorer.ista.ac.at/record/11910
DOI: 10.1007/3-540-61440-0_136

R. Alur, T. A. Henzinger, and E. D. Sontag, Eds., Hybrid Systems III: Verification and Control, vol. 1066. Berlinf; Heidelberg: Springer, 1996.
LibreCat: https://research-explorer.ista.ac.at/record/4612
DOI: 10.1007/BFb0020931

M. H. Henzinger, “Approximating minimum cuts under insertions,” in 22nd International Colloquium on Automata, Languages and Programming, Szeged, Hungary, 1995, vol. 944, pp. 280–291.
LibreCat: https://research-explorer.ista.ac.at/record/11806
DOI: 10.1007/3-540-60084-1_81

M. H. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity in fully-dynamic graphs,” in 3rd Annual European Symposium on Algorithms, Corfu, Greece, 1995, vol. 979, pp. 171–184.
LibreCat: https://research-explorer.ista.ac.at/record/11805
DOI: 10.1007/3-540-60313-1_142