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.
11 Publications
2013 | Published | Journal Article | IST-REx-ID: 11759 | 
Sponsored search, market equilibria, and the Hungarian Method
P. Dütting, M. Henzinger, I. Weber, Information Processing Letters 113 (2013) 67–73.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
P. Dütting, M. Henzinger, I. Weber, Information Processing Letters 113 (2013) 67–73.
2011 | Published | Journal Article | IST-REx-ID: 11760
Offline file assignments for online load balancing
P. Dütting, M. Henzinger, I. Weber, Information Processing Letters 111 (2011) 178–183.
View
| DOI
P. Dütting, M. Henzinger, I. Weber, Information Processing Letters 111 (2011) 178–183.
1996 | Published | Journal Article | IST-REx-ID: 11761
On the number of small cuts in a graph
M. Henzinger, D.P. Williamson, Information Processing Letters 59 (1996) 41–44.
View
| DOI
M. Henzinger, D.P. Williamson, Information Processing Letters 59 (1996) 41–44.
1992 | Published | Journal Article | IST-REx-ID: 4517
Sooner Is Safer Than Later
T.A. Henzinger, Information Processing Letters 43 (1992) 135–141.
View
| DOI
| Download None (ext.)
T.A. Henzinger, Information Processing Letters 43 (1992) 135–141.
1992 | Published | Journal Article | IST-REx-ID: 4048
Optimal time bounds for some proximity problems in the plane
A. Aggarwal, H. Edelsbrunner, P. Raghavan, P. Tiwari, Information Processing Letters 42 (1992) 55–60.
View
| DOI
| Download None (ext.)
A. Aggarwal, H. Edelsbrunner, P. Raghavan, P. Tiwari, Information Processing Letters 42 (1992) 55–60.
1987 | Published | Journal Article | IST-REx-ID: 4094
A tight lower bound on the size of visibility graphs
H. Edelsbrunner, X. Shen, Information Processing Letters 26 (1987) 61–64.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, X. Shen, Information Processing Letters 26 (1987) 61–64.
1987 | Published | Journal Article | IST-REx-ID: 4101
Zooming by repeated range detection
H. Edelsbrunner, M. Overmars, Information Processing Letters 24 (1987) 413–417.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Overmars, Information Processing Letters 24 (1987) 413–417.
1986 | Published | Journal Article | IST-REx-ID: 4099
Halfplanar range search in linear space and O(n0.695) query time
H. Edelsbrunner, E. Welzl, Information Processing Letters 23 (1986) 289–293.
View
| DOI
H. Edelsbrunner, E. Welzl, Information Processing Letters 23 (1986) 289–293.
1985 | Published | Journal Article | IST-REx-ID: 4111
Finding extreme-points in 3-dimensions and solving the post-office problem in the plane
H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.
View
| DOI
H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.
1982 | Published | Journal Article | IST-REx-ID: 4130
Polygonal intersection searching
H. Edelsbrunner, H. Maurer, D. Kirkpatrick, Information Processing Letters 14 (1982) 74–79.
View
| DOI
H. Edelsbrunner, H. Maurer, D. Kirkpatrick, Information Processing Letters 14 (1982) 74–79.
1981 | Published | Journal Article | IST-REx-ID: 4132 |
On the intersection of Orthogonal objects
H. Edelsbrunner, H. Maurer, Information Processing Letters 13 (1981) 177–181.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, H. Maurer, Information Processing Letters 13 (1981) 177–181.