A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in congested clique and MPC,” SIAM Journal on Computing, vol. 50, no. 5. Society for Industrial &; Applied Mathematics, pp. 1603–1626, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/15271
DOI: 10.1137/20m1366502

M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” SIAM Journal on Computing, vol. 49, no. 1. Society for Industrial &; Applied Mathematics, pp. 1–36, 2020.
LibreCat: https://research-explorer.ista.ac.at/record/11889
DOI: 10.1137/18m1180335
arXiv: 1704.01254

J.-D. Boissonnat, M. Rouxel-Labbé, and M. Wintraecken, “Anisotropic triangulations via discrete Riemannian Voronoi diagrams,” SIAM Journal on Computing, vol. 48, no. 3. Society for Industrial &; Applied Mathematics (SIAM), pp. 1046–1097, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6672
DOI: 10.1137/17m1152292
arXiv: 1703.06487

D. Achlioptas, F. Iliopoulos, and V. Kolmogorov, “A local lemma for focused stochastical algorithms,” SIAM Journal on Computing, vol. 48, no. 5. SIAM, pp. 1583–1602, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/7412
DOI: 10.1137/16m109332x
WoS: 000493900200005
arXiv: 1809.01537

S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” SIAM Journal on Computing, vol. 47, no. 3. Society for Industrial &; Applied Mathematics, pp. 859–887, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/11890
DOI: 10.1137/140998925
arXiv: 1412.1318

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

M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” SIAM Journal on Computing, vol. 45, no. 3. Society for Industrial &; Applied Mathematics, pp. 947–1006, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/11891
DOI: 10.1137/140957299
arXiv: 1308.0776

M. H. Henzinger and V. King, “Maintaining minimum spanning forests in dynamic graphs,” SIAM Journal on Computing, vol. 31, no. 2. Society for Industrial &; Applied Mathematics, pp. 364–374, 2001.
LibreCat: https://research-explorer.ista.ac.at/record/11892
DOI: 10.1137/s0097539797327209

S. Albers and M. H. Henzinger, “Exploring unknown environments,” SIAM Journal on Computing, vol. 29, no. 4. Society for Industrial and Applied Mathematics, pp. 1164–1188, 2000.
LibreCat: https://research-explorer.ista.ac.at/record/11694
DOI: 10.1137/s009753979732428x

M. H. Henzinger, “Improved data structures for fully dynamic biconnectivity,” SIAM Journal on Computing, vol. 29, no. 6. Society for Industrial &; Applied Mathematics, pp. 1761–1815, 2000.
LibreCat: https://research-explorer.ista.ac.at/record/11893
DOI: 10.1137/s0097539794263907

B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Selecting heavily covered points,” SIAM Journal on Computing, vol. 23, no. 6. SIAM, pp. 1138–1151, 1994.
LibreCat: https://research-explorer.ista.ac.at/record/4033
DOI: 10.1137/S0097539790179919 

H. Edelsbrunner, R. Seidel, and M. Sharir, “On the zone theorem for hyperplane arrangements,” SIAM Journal on Computing, vol. 22, no. 2. SIAM, pp. 418–429, 1993.
LibreCat: https://research-explorer.ista.ac.at/record/4041
DOI: 10.1137/0222031

B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing a face in an arrangement of line segments and related problems,” SIAM Journal on Computing, vol. 22, no. 6. SIAM, pp. 1286–1302, 1993.
LibreCat: https://research-explorer.ista.ac.at/record/4036
DOI: 10.1137/0222077 

H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” SIAM Journal on Computing, vol. 22, no. 3. SIAM, pp. 527–551, 1993.
LibreCat: https://research-explorer.ista.ac.at/record/4042
DOI: 10.1137/0222036 

H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2 log n) time algorithm for the MinMax angle triangulation,” SIAM Journal on Scientific Computing, vol. 13, no. 4. Society for Industrial and Applied Mathematics , pp. 994–1008, 1992.
LibreCat: https://research-explorer.ista.ac.at/record/4043
DOI: 10.1137/0913058

H. Edelsbrunner and W. Shi, “An O(n log^2 h) time algorithm for the three-dimensional convex hull problem,” SIAM Journal on Computing, vol. 20, no. 2. SIAM, pp. 259–269, 1991.
LibreCat: https://research-explorer.ista.ac.at/record/4051
DOI: 10.1137/0220016 

F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for range queries,” SIAM Journal on Computing, vol. 18, no. 2. SIAM, pp. 371–384, 1989.
LibreCat: https://research-explorer.ista.ac.at/record/4083
DOI: 10.1137/0218025

H. Edelsbrunner and S. Skiena, “Probing convex polygons with X-Rays,” SIAM Journal on Computing, vol. 17, no. 5. SIAM, pp. 870–882, 1988.
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054 

H. Edelsbrunner, J. O’Rourke, and R. Seidel, “Constructing arrangements of lines and hyperplanes with applications,” SIAM Journal on Computing, vol. 15, no. 2. SIAM, pp. 341–363, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4105
DOI: 10.1137/0215024

H. Edelsbrunner, L. Guibas, and J. Stolfi, “Optimal point location in a monotone subdivision,” SIAM Journal on Computing, vol. 15, no. 2. SIAM, pp. 317–340, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4104
DOI: 10.1137/0215023