Czumaj, A., Davies, P., &; Parter, M. (2021). Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/20m1366502 

Henzinger, M. H., Rao, S., &; Wang, D. (2020). Local flow partitioning for faster edge connectivity. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/18m1180335 

Boissonnat, J.-D., Rouxel-Labbé, M., &; Wintraecken, M. (2019). Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics (SIAM).https://doi.org/10.1137/17m1152292 

Achlioptas, D., Iliopoulos, F., &; Kolmogorov, V. (2019). A local lemma for focused stochastical algorithms. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/16m109332x 

Bhattacharya, S., Henzinger, M. H., &; Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/140998925 

Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics (SIAM).https://doi.org/10.1137/16m1093306 

Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2016). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/140957299 

Henzinger, M. H., &; King, V. (2001). Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/s0097539797327209 

Albers, S., &; Henzinger, M. H. (2000). Exploring unknown environments. SIAM Journal on Computing. El Paso, TX, United States: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/s009753979732428x 

Henzinger, M. H. (2000). Improved data structures for fully dynamic biconnectivity. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/s0097539794263907 

Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., &; Sharir, M. (1994). Selecting heavily covered points. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/S0097539790179919  

Edelsbrunner, H., Seidel, R., &; Sharir, M. (1993). On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0222031 

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

Edelsbrunner, H., &; Tan, T. (1993). A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0222036  

Edelsbrunner, H., Tan, T., &; Waupotitsch, R. (1992). An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. Society for Industrial and Applied Mathematics .https://doi.org/10.1137/0913058 

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

Yao, F., Dobkin, D., Edelsbrunner, H., &; Paterson, M. (1989). Partitioning space for range queries. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0218025 

Edelsbrunner, H., &; Skiena, S. (1988). Probing convex polygons with X-Rays. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0217054  

Edelsbrunner, H., O’Rourke, J., &; Seidel, R. (1986). Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215024 

Edelsbrunner, H., Guibas, L., &; Stolfi, J. (1986). Optimal point location in a monotone subdivision. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215023