Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”10.1137/16m1093306__SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial &; Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
LibreCat: https://research-explorer.ista.ac.at/record/5975
DOI: 10.1137/16m1093306
WoS: 000453785100001
arXiv: 1506.08547

Henzinger, Monika H., et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.”10.1137/140957299__SIAM Journal on Computing, vol. 45, no. 3, Society for Industrial &; Applied Mathematics, 2016, pp. 947–1006, doi:10.1137/140957299.
LibreCat: https://research-explorer.ista.ac.at/record/11891
DOI: 10.1137/140957299
arXiv: 1308.0776

Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.”10.1137/s0097539797327209__SIAM Journal on Computing, vol. 31, no. 2, Society for Industrial &; Applied Mathematics, 2001, pp. 364–74, doi:10.1137/s0097539797327209.
LibreCat: https://research-explorer.ista.ac.at/record/11892
DOI: 10.1137/s0097539797327209

Albers, Susanne, and Monika H. Henzinger. “Exploring Unknown Environments.”10.1137/s009753979732428x__SIAM Journal on Computing, vol. 29, no. 4, Society for Industrial and Applied Mathematics, 2000, pp. 1164–88, doi:10.1137/s009753979732428x.
LibreCat: https://research-explorer.ista.ac.at/record/11694
DOI: 10.1137/s009753979732428x

Henzinger, Monika H. “Improved Data Structures for Fully Dynamic Biconnectivity.”10.1137/s0097539794263907__SIAM Journal on Computing, vol. 29, no. 6, Society for Industrial &; Applied Mathematics, 2000, pp. 1761–815, doi:10.1137/s0097539794263907.
LibreCat: https://research-explorer.ista.ac.at/record/11893
DOI: 10.1137/s0097539794263907

Edelsbrunner, Herbert, et al. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.”10.1137/0913058__SIAM Journal on Scientific Computing, vol. 13, no. 4, Society for Industrial and Applied Mathematics , 1992, pp. 994–1008, doi:10.1137/0913058.
LibreCat: https://research-explorer.ista.ac.at/record/4043
DOI: 10.1137/0913058

Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.”10.1137/0220016 __SIAM Journal on Computing, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi:10.1137/0220016 .
LibreCat: https://research-explorer.ista.ac.at/record/4051
DOI: 10.1137/0220016 

Yao, F., et al. “Partitioning Space for Range Queries.”10.1137/0218025__SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
LibreCat: https://research-explorer.ista.ac.at/record/4083
DOI: 10.1137/0218025

Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.”10.1137/0217054 __SIAM Journal on Computing, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:10.1137/0217054 .
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054 

Edelsbrunner, Herbert, et al. “Constructing Arrangements of Lines and Hyperplanes with Applications.”10.1137/0215024__SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 341–63, doi:10.1137/0215024.
LibreCat: https://research-explorer.ista.ac.at/record/4105
DOI: 10.1137/0215024

Edelsbrunner, Herbert, et al. “Optimal Point Location in a Monotone Subdivision.”10.1137/0215023__SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 317–40, doi:10.1137/0215023.
LibreCat: https://research-explorer.ista.ac.at/record/4104
DOI: 10.1137/0215023

Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.”10.1137/0215019__SIAM Journal on Computing, vol. 15, no. 1, SIAM, 1986, pp. 271–84, doi:10.1137/0215019.
LibreCat: https://research-explorer.ista.ac.at/record/4110
DOI: 10.1137/0215019