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 | Journal Article | IST-REx-ID: 11759 | OA
P. Dütting, M. H. Henzinger, and I. Weber, “Sponsored search, market equilibria, and the Hungarian Method,” Information Processing Letters, vol. 113, no. 3. Elsevier, pp. 67–73, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2011 | Journal Article | IST-REx-ID: 11760
P. Dütting, M. H. Henzinger, and I. Weber, “Offline file assignments for online load balancing,” Information Processing Letters, vol. 111, no. 4. Elsevier, pp. 178–183, 2011.
View | DOI
 

1996 | Journal Article | IST-REx-ID: 11761
M. H. Henzinger and D. P. Williamson, “On the number of small cuts in a graph,” Information Processing Letters, vol. 59, no. 1. Elsevier, pp. 41–44, 1996.
View | DOI
 

1992 | Journal Article | IST-REx-ID: 4048
A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari, “Optimal time bounds for some proximity problems in the plane,” Information Processing Letters, vol. 42, no. 1. Elsevier, pp. 55–60, 1992.
View | DOI | Download None (ext.)
 

1992 | Journal Article | IST-REx-ID: 4517
T. A. Henzinger, “Sooner Is Safer Than Later,” Information Processing Letters, vol. 43, no. 3. Elsevier, pp. 135–141, 1992.
View | DOI | Download None (ext.)
 

1987 | Journal Article | IST-REx-ID: 4101
H. Edelsbrunner and M. Overmars, “Zooming by repeated range detection,” Information Processing Letters, vol. 24, no. 6. Elsevier, pp. 413–417, 1987.
View | DOI | Download None (ext.)
 

1987 | Journal Article | IST-REx-ID: 4094
H. Edelsbrunner and X. Shen, “A tight lower bound on the size of visibility graphs,” Information Processing Letters, vol. 26, no. 2. Elsevier, pp. 61–64, 1987.
View | DOI | Download None (ext.)
 

1986 | Journal Article | IST-REx-ID: 4099
H. Edelsbrunner and E. Welzl, “Halfplanar range search in linear space and O(n0.695) query time,” Information Processing Letters, vol. 23, no. 5. Elsevier, pp. 289–293, 1986.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4111
H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” Information Processing Letters, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.
View | DOI
 

1982 | Journal Article | IST-REx-ID: 4130
H. Edelsbrunner, H. Maurer, and D. Kirkpatrick, “Polygonal intersection searching,” Information Processing Letters, vol. 14, no. 2. Elsevier, pp. 74–79, 1982.
View | DOI
 

1981 | Journal Article | IST-REx-ID: 4132 | OA
H. Edelsbrunner and H. Maurer, “On the intersection of Orthogonal objects,” Information Processing Letters, vol. 13, no. 4–5. Elsevier, pp. 177–181, 1981.
[Published Version] View | DOI | Download Published Version (ext.)
 

Filters and Search Terms

issn=0020-0190

Search

Filter Publications