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.
129 Publications
2011 | Conference Paper | IST-REx-ID: 10907
Artner, N. M., Ion, A., & Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, & A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-20844-7_22
View
| DOI
2010 | Conference Paper | IST-REx-ID: 10908 | 
Blanc, R., Henzinger, T. A., Hottelier, T., & Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. https://doi.org/10.1007/978-3-642-17511-4_7
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2010 | Conference Paper | IST-REx-ID: 11797 |
Feldman, J., Henzinger, M. H., Korula, N., Mirrokni, V. S., & Stein, C. (2010). Online stochastic packing applied to display ad allocation. In 18th Annual European Symposium on Algorithms (Vol. 6346, pp. 182–194). Liverpool, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-642-15775-2_16
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2010 | Conference Paper | IST-REx-ID: 11798
Dütting, P., & Henzinger, M. H. (2010). Mechanisms for the marriage and the assignment game. In 7th International Conference on Algorithms and Complexity (Vol. 6078, pp. 6–12). Rome, Italy: Springer Nature. https://doi.org/10.1007/978-3-642-13073-1_2
View
| DOI
2010 | Book Chapter | IST-REx-ID: 5940
Juhás, G., Kazlov, I., & Juhásová, A. (2010). Instance Deadlock: A Mystery behind Frozen Programs. In Applications and Theory of Petri Nets (pp. 1–17). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13675-7_1
View
| DOI
2009 | Conference Paper | IST-REx-ID: 11799
Dütting, P., Henzinger, M. H., & Weber, I. (2009). Bidder optimal assignments for general utilities. In 5th International Workshop on Internet and Network Economics (Vol. 5929, pp. 575–582). Rome, Italy: Springer Nature. https://doi.org/10.1007/978-3-642-10841-9_58
View
| Files available
| DOI
2004 | Conference Paper | IST-REx-ID: 11801
Henzinger, M. H. (2004). Algorithmic aspects of web search engines. In 2th Annual European Symposium on Algorithms (Vol. 3221, p. 3). Bergen, Norway: Springer Nature. https://doi.org/10.1007/978-3-540-30140-0_2
View
| DOI
2004 | Conference Paper | IST-REx-ID: 11800
Henzinger, M. H. (2004). The past, present, and future of web search engines. In 31st International Colloquium on Automata, Languages and Programming (Vol. 3142, p. 3). Turku, Finland: Springer Nature. https://doi.org/10.1007/978-3-540-27836-8_2
View
| DOI
2000 | Conference Paper | IST-REx-ID: 11802
Henzinger, M. H. (2000). Web information retrieval - an algorithmic perspective. In 8th Annual European Symposium on Algorithms (Vol. 1879, pp. 1–8). Saarbrücken, Germany: Springer Nature. https://doi.org/10.1007/3-540-45253-2_1
View
| DOI
1997 | Conference Paper | IST-REx-ID: 11803
Henzinger, M. H., & King, V. (1997). Maintaining minimum spanning trees in dynamic graphs. In 24th International Colloquium on Automata, Languages and Programming (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature. https://doi.org/10.1007/3-540-63165-8_214
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11804
Henzinger, M. H., & Telle, J. A. (1996). Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. In 5th Scandinavian Workshop on Algorithm Theory (Vol. 1097, pp. 16–27). Reykjavik, Iceland: Springer Nature. https://doi.org/10.1007/3-540-61422-2_117
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11910
Henzinger, M. H., & Thorup, M. (1996). Improved sampling with applications to dynamic graph algorithms. In 23rd International Colloquium on Automata, Languages, and Programming (Vol. 1099, pp. 290–299). Paderborn, Germany: Springer Nature. https://doi.org/10.1007/3-540-61440-0_136
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11806
Henzinger, M. H. (1995). Approximating minimum cuts under insertions. In 22nd International Colloquium on Automata, Languages and Programming (Vol. 944, pp. 280–291). Szeged, Hungary: Springer Nature. https://doi.org/10.1007/3-540-60084-1_81
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11805
Henzinger, M. H., & Poutré, H. (1995). Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In 3rd Annual European Symposium on Algorithms (Vol. 979, pp. 171–184). Corfu, Greece: Springer Nature. https://doi.org/10.1007/3-540-60313-1_142
View
| DOI