Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.”https://doi.org/10.1137/20m1366502__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics, 2021.https://doi.org/10.1137/20m1366502 .

Henzinger, Monika H, Satish Rao, and Di Wang. “Local Flow Partitioning for Faster Edge Connectivity.”https://doi.org/10.1137/18m1180335__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics, 2020.https://doi.org/10.1137/18m1180335 .

Boissonnat, Jean-Daniel, Mael Rouxel-Labbé, and Mathijs Wintraecken. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.”https://doi.org/10.1137/17m1152292__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics (SIAM), 2019.https://doi.org/10.1137/17m1152292 .

Achlioptas, Dimitris, Fotis Iliopoulos, and Vladimir Kolmogorov. “A Local Lemma for Focused Stochastical Algorithms.”https://doi.org/10.1137/16m109332x__SIAM Journal on Computing. SIAM, 2019.https://doi.org/10.1137/16m109332x .

Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.”https://doi.org/10.1137/140998925__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics, 2018.https://doi.org/10.1137/140998925 .

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”https://doi.org/10.1137/16m1093306__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics (SIAM), 2018.https://doi.org/10.1137/16m1093306 .

Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.”https://doi.org/10.1137/140957299__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics, 2016.https://doi.org/10.1137/140957299 .

Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.”https://doi.org/10.1137/s0097539797327209__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics, 2001.https://doi.org/10.1137/s0097539797327209 .

Albers, Susanne, and Monika H Henzinger. “Exploring Unknown Environments.”https://doi.org/10.1137/s009753979732428x__SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2000.https://doi.org/10.1137/s009753979732428x .

Henzinger, Monika H. “Improved Data Structures for Fully Dynamic Biconnectivity.”https://doi.org/10.1137/s0097539794263907__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics, 2000.https://doi.org/10.1137/s0097539794263907 .

Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Selecting Heavily Covered Points.”https://doi.org/10.1137/S0097539790179919 __SIAM Journal on Computing. SIAM, 1994.https://doi.org/10.1137/S0097539790179919  .

Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements.”https://doi.org/10.1137/0222031__SIAM Journal on Computing. SIAM, 1993.https://doi.org/10.1137/0222031 .

Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments and Related Problems.”https://doi.org/10.1137/0222077 __SIAM Journal on Computing. SIAM, 1993.https://doi.org/10.1137/0222077  .

Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.”https://doi.org/10.1137/0222036 __SIAM Journal on Computing. SIAM, 1993.https://doi.org/10.1137/0222036  .

Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.”https://doi.org/10.1137/0913058__SIAM Journal on Scientific Computing. Society for Industrial and Applied Mathematics , 1992.https://doi.org/10.1137/0913058 .

Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.”https://doi.org/10.1137/0220016 __SIAM Journal on Computing. SIAM, 1991.https://doi.org/10.1137/0220016  .

Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.”https://doi.org/10.1137/0218025__SIAM Journal on Computing. SIAM, 1989.https://doi.org/10.1137/0218025 .

Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.”https://doi.org/10.1137/0217054 __SIAM Journal on Computing. SIAM, 1988.https://doi.org/10.1137/0217054  .

Edelsbrunner, Herbert, Joseph O’Rourke, and Raimund Seidel. “Constructing Arrangements of Lines and Hyperplanes with Applications.”https://doi.org/10.1137/0215024__SIAM Journal on Computing. SIAM, 1986.https://doi.org/10.1137/0215024 .

Edelsbrunner, Herbert, Leonidas Guibas, and Jorge Stolfi. “Optimal Point Location in a Monotone Subdivision.”https://doi.org/10.1137/0215023__SIAM Journal on Computing. SIAM, 1986.https://doi.org/10.1137/0215023 .