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.
12 Publications
2017 | Published | Journal Article | IST-REx-ID: 1065 | 
Chatterjee, Krishnendu, Pushdown reachability with constant treewidth. Information Processing Letters 122. 2017
[Submitted Version]
View
| Files available
| DOI
| WoS
2013 | Published | Journal Article | IST-REx-ID: 11759 |
Dütting, P., Henzinger, M., & Weber, I. (2013). Sponsored search, market equilibria, and the Hungarian Method. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2012.11.006
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 11760
Dütting, P., Henzinger, M., & Weber, I. (2011). Offline file assignments for online load balancing. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2010.11.022
View
| DOI
1996 | Published | Journal Article | IST-REx-ID: 11761
Henzinger, M., & Williamson, D. P. (1996). On the number of small cuts in a graph. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(96)00079-8
View
| DOI
1992 | Published | Journal Article | IST-REx-ID: 4517
Henzinger, T. A. (1992). Sooner Is Safer Than Later. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(92)90005-G
View
| DOI
| Download None (ext.)
1992 | Published | Journal Article | IST-REx-ID: 4048
Aggarwal, A., Edelsbrunner, H., Raghavan, P., & Tiwari, P. (1992). Optimal time bounds for some proximity problems in the plane. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(92)90133-G
View
| DOI
| Download None (ext.)
1987 | Published | Journal Article | IST-REx-ID: 4094
Edelsbrunner, H., & Shen, X. (1987). A tight lower bound on the size of visibility graphs. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(87)90038-X
View
| DOI
| Download None (ext.)
1987 | Published | Journal Article | IST-REx-ID: 4101
Edelsbrunner, H., & Overmars, M. (1987). Zooming by repeated range detection. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(87)90120-7
View
| DOI
| Download None (ext.)
1986 | Published | Journal Article | IST-REx-ID: 4099
Edelsbrunner, H., & Welzl, E. (1986). Halfplanar range search in linear space and O(n0.695) query time. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(86)90088-8
View
| DOI
1985 | Published | Journal Article | IST-REx-ID: 4111
Edelsbrunner, H., & Maurer, H. (1985). Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(85)90107-3
View
| DOI
1982 | Published | Journal Article | IST-REx-ID: 4130
Edelsbrunner, H., Maurer, H., & Kirkpatrick, D. (1982). Polygonal intersection searching. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(82)90090-4
View
| DOI
1981 | Published | Journal Article | IST-REx-ID: 4132 |
Edelsbrunner, H., & Maurer, H. (1981). On the intersection of Orthogonal objects. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(81)90053-3
[Published Version]
View
| DOI
| Download Published Version (ext.)