Czumaj A, Davies P, Parter M. 2021. Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing. 50(5), 1603–1626.
LibreCat: https://research-explorer.ista.ac.at/record/15271
DOI: 10.1137/20m1366502

Henzinger MH, Rao S, Wang D. 2020. Local flow partitioning for faster edge connectivity. SIAM Journal on Computing. 49(1), 1–36.
LibreCat: https://research-explorer.ista.ac.at/record/11889
DOI: 10.1137/18m1180335
arXiv: 1704.01254

Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. 2019. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 48(3), 1046–1097.
LibreCat: https://research-explorer.ista.ac.at/record/6672
DOI: 10.1137/17m1152292
arXiv: 1703.06487

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

Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887.
LibreCat: https://research-explorer.ista.ac.at/record/11890
DOI: 10.1137/140998925
arXiv: 1412.1318

Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.
LibreCat: https://research-explorer.ista.ac.at/record/5975
DOI: 10.1137/16m1093306
WoS: 000453785100001
arXiv: 1506.08547

Henzinger MH, Krinninger S, Nanongkai D. 2016. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. 45(3), 947–1006.
LibreCat: https://research-explorer.ista.ac.at/record/11891
DOI: 10.1137/140957299
arXiv: 1308.0776

Henzinger MH, King V. 2001. Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. 31(2), 364–374.
LibreCat: https://research-explorer.ista.ac.at/record/11892
DOI: 10.1137/s0097539797327209

Albers S, Henzinger MH. 2000. Exploring unknown environments. SIAM Journal on Computing. 29(4), 1164–1188.
LibreCat: https://research-explorer.ista.ac.at/record/11694
DOI: 10.1137/s009753979732428x

Henzinger MH. 2000. Improved data structures for fully dynamic biconnectivity. SIAM Journal on Computing. 29(6), 1761–1815.
LibreCat: https://research-explorer.ista.ac.at/record/11893
DOI: 10.1137/s0097539794263907

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

Edelsbrunner H, Seidel R, Sharir M. 1993. On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. 22(2), 418–429.
LibreCat: https://research-explorer.ista.ac.at/record/4041
DOI: 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. 22(6), 1286–1302.
LibreCat: https://research-explorer.ista.ac.at/record/4036
DOI: 10.1137/0222077 

Edelsbrunner H, Tan T. 1993. A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. 22(3), 527–551.
LibreCat: https://research-explorer.ista.ac.at/record/4042
DOI: 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. 13(4), 994–1008.
LibreCat: https://research-explorer.ista.ac.at/record/4043
DOI: 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. 20(2), 259–269.
LibreCat: https://research-explorer.ista.ac.at/record/4051
DOI: 10.1137/0220016 

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

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

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

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