Dütting, P., Henzinger, M. H., &; 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 

Dütting, P., Henzinger, M. H., &; Weber, I. (2011). Offline file assignments for online load balancing. Information Processing Letters. Elsevier.https://doi.org/10.1016/j.ipl.2010.11.022 

Henzinger, M. H., &; 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 

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 

Henzinger, T. A. (1992). Sooner Is Safer Than Later. Information Processing Letters. Elsevier.https://doi.org/10.1016/0020-0190(92)90005-G 

Edelsbrunner, H., &; Overmars, M. (1987). Zooming by repeated range detection. Information Processing Letters. Elsevier.https://doi.org/10.1016/0020-0190(87)90120-7 

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 

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 

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 

Edelsbrunner, H., Maurer, H., &; Kirkpatrick, D. (1982). Polygonal intersection searching. Information Processing Letters. Elsevier.https://doi.org/10.1016/0020-0190(82)90090-4 

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