Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing. 2021;50(5):1603-1626. doi:10.1137/20m1366502

Henzinger MH, Rao S, Wang D. Local flow partitioning for faster edge connectivity. SIAM Journal on Computing. 2020;49(1):1-36. doi:10.1137/18m1180335

Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 2019;48(3):1046-1097. doi:10.1137/17m1152292

Achlioptas D, Iliopoulos F, Kolmogorov V. A local lemma for focused stochastical algorithms. SIAM Journal on Computing. 2019;48(5):1583-1602. doi:10.1137/16m109332x

Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 2018;47(3):859-887. doi:10.1137/140998925

Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306

Henzinger MH, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. 2016;45(3):947-1006. doi:10.1137/140957299

Henzinger MH, King V. Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. 2001;31(2):364-374. doi:10.1137/s0097539797327209

Albers S, Henzinger MH. Exploring unknown environments. SIAM Journal on Computing. 2000;29(4):1164-1188. doi:10.1137/s009753979732428x

Henzinger MH. Improved data structures for fully dynamic biconnectivity. SIAM Journal on Computing. 2000;29(6):1761-1815. doi:10.1137/s0097539794263907

Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. Selecting heavily covered points. SIAM Journal on Computing. 1994;23(6):1138-1151. doi:10.1137/S0097539790179919 

Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. 1993;22(2):418-429. doi:10.1137/0222031

Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a face in an arrangement of line segments and related problems. SIAM Journal on Computing. 1993;22(6):1286-1302. doi:10.1137/0222077 

Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. 1993;22(3):527-551. doi:10.1137/0222036 

Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. 1992;13(4):994-1008. doi:10.1137/0913058

Edelsbrunner H, Shi W. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. 1991;20(2):259-269. doi:10.1137/0220016 

Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries. SIAM Journal on Computing. 1989;18(2):371-384. doi:10.1137/0218025

Edelsbrunner H, Skiena S. Probing convex polygons with X-Rays. SIAM Journal on Computing. 1988;17(5):870-882. doi:10.1137/0217054 

Edelsbrunner H, O’Rourke J, Seidel R. Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. 1986;15(2):341-363. doi:10.1137/0215024

Edelsbrunner H, Guibas L, Stolfi J. Optimal point location in a monotone subdivision. SIAM Journal on Computing. 1986;15(2):317-340. doi:10.1137/0215023