Dütting P, Henzinger MH, Weber I. 2013. Sponsored search, market equilibria, and the Hungarian Method. Information Processing Letters. 113(3), 67–73.

Dütting P, Henzinger MH, Weber I. 2011. Offline file assignments for online load balancing. Information Processing Letters. 111(4), 178–183.

Henzinger MH, Williamson DP. 1996. On the number of small cuts in a graph. Information Processing Letters. 59(1), 41–44.

Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. 1992. Optimal time bounds for some proximity problems in the plane. Information Processing Letters. 42(1), 55–60.

Henzinger TA. 1992. Sooner Is Safer Than Later. Information Processing Letters. 43(3), 135–141.

Edelsbrunner H, Overmars M. 1987. Zooming by repeated range detection. Information Processing Letters. 24(6), 413–417.

Edelsbrunner H, Shen X. 1987. A tight lower bound on the size of visibility graphs. Information Processing Letters. 26(2), 61–64.

Edelsbrunner H, Welzl E. 1986. Halfplanar range search in linear space and O(n0.695) query time. Information Processing Letters. 23(5), 289–293.

Edelsbrunner H, Maurer H. 1985. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 21(1), 39–47.

Edelsbrunner H, Maurer H, Kirkpatrick D. 1982. Polygonal intersection searching. Information Processing Letters. 14(2), 74–79.

Edelsbrunner H, Maurer H. 1981. On the intersection of Orthogonal objects. Information Processing Letters. 13(4–5), 177–181.