Dütting, Paul, et al. “Sponsored Search, Market Equilibria, and the Hungarian Method.”10.1016/j.ipl.2012.11.006__Information Processing Letters, vol. 113, no. 3, Elsevier, 2013, pp. 67–73, doi:10.1016/j.ipl.2012.11.006.
LibreCat: https://research-explorer.ista.ac.at/record/11759
DOI: 10.1016/j.ipl.2012.11.006
arXiv: 0912.1934

Dütting, Paul, et al. “Offline File Assignments for Online Load Balancing.”10.1016/j.ipl.2010.11.022__Information Processing Letters, vol. 111, no. 4, Elsevier, 2011, pp. 178–83, doi:10.1016/j.ipl.2010.11.022.
LibreCat: https://research-explorer.ista.ac.at/record/11760
DOI: 10.1016/j.ipl.2010.11.022

Henzinger, Monika H., and David P. Williamson. “On the Number of Small Cuts in a Graph.”10.1016/0020-0190(96)00079-8__Information Processing Letters, vol. 59, no. 1, Elsevier, 1996, pp. 41–44, doi:10.1016/0020-0190(96)00079-8.
LibreCat: https://research-explorer.ista.ac.at/record/11761
DOI: 10.1016/0020-0190(96)00079-8

Aggarwal, Alok, et al. “Optimal Time Bounds for Some Proximity Problems in the Plane.”10.1016/0020-0190(92)90133-G__Information Processing Letters, vol. 42, no. 1, Elsevier, 1992, pp. 55–60, doi:10.1016/0020-0190(92)90133-G.
LibreCat: https://research-explorer.ista.ac.at/record/4048
DOI: 10.1016/0020-0190(92)90133-G

Henzinger, Thomas A. “Sooner Is Safer Than Later.”10.1016/0020-0190(92)90005-G__Information Processing Letters, vol. 43, no. 3, Elsevier, 1992, pp. 135–41, doi:10.1016/0020-0190(92)90005-G.
LibreCat: https://research-explorer.ista.ac.at/record/4517
DOI: 10.1016/0020-0190(92)90005-G

Edelsbrunner, Herbert, and Mark Overmars. “Zooming by Repeated Range Detection.”10.1016/0020-0190(87)90120-7__Information Processing Letters, vol. 24, no. 6, Elsevier, 1987, pp. 413–17, doi:10.1016/0020-0190(87)90120-7.
LibreCat: https://research-explorer.ista.ac.at/record/4101
DOI: 10.1016/0020-0190(87)90120-7

Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.”10.1016/0020-0190(87)90038-X__Information Processing Letters, vol. 26, no. 2, Elsevier, 1987, pp. 61–64, doi:10.1016/0020-0190(87)90038-X.
LibreCat: https://research-explorer.ista.ac.at/record/4094
DOI: 10.1016/0020-0190(87)90038-X

Edelsbrunner, Herbert, and Emo Welzl. “Halfplanar Range Search in Linear Space and O(N0.695) Query Time.”10.1016/0020-0190(86)90088-8__Information Processing Letters, vol. 23, no. 5, Elsevier, 1986, pp. 289–93, doi:10.1016/0020-0190(86)90088-8.
LibreCat: https://research-explorer.ista.ac.at/record/4099
DOI: 10.1016/0020-0190(86)90088-8

Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.”10.1016/0020-0190(85)90107-3__Information Processing Letters, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:10.1016/0020-0190(85)90107-3.
LibreCat: https://research-explorer.ista.ac.at/record/4111
DOI: 10.1016/0020-0190(85)90107-3

Edelsbrunner, Herbert, et al. “Polygonal Intersection Searching.”10.1016/0020-0190(82)90090-4__Information Processing Letters, vol. 14, no. 2, Elsevier, 1982, pp. 74–79, doi:10.1016/0020-0190(82)90090-4.
LibreCat: https://research-explorer.ista.ac.at/record/4130
DOI: 10.1016/0020-0190(82)90090-4

Edelsbrunner, Herbert, and Hermann Maurer. “On the Intersection of Orthogonal Objects.”10.1016/0020-0190(81)90053-3__Information Processing Letters, vol. 13, no. 4–5, Elsevier, 1981, pp. 177–81, doi:10.1016/0020-0190(81)90053-3.
LibreCat: https://research-explorer.ista.ac.at/record/4132
DOI: 10.1016/0020-0190(81)90053-3