Pushdown reachability with constant treewidth
K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.

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

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

On the number of small cuts in a graph
M. Henzinger, D.P. Williamson, Information Processing Letters 59 (1996) 41–44.

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

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.

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

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

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

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.

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

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