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 .
LibreCat: https://research-explorer.ista.ac.at/record/15271
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11889
DOI: 10.1137/18m1180335
arXiv: 1704.01254

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 .
LibreCat: https://research-explorer.ista.ac.at/record/6672
DOI: 10.1137/17m1152292
arXiv: 1703.06487

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 .
LibreCat: https://research-explorer.ista.ac.at/record/7412
DOI: 10.1137/16m109332x
WoS: 000493900200005
arXiv: 1809.01537

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 .
LibreCat: https://research-explorer.ista.ac.at/record/11890
DOI: 10.1137/140998925
arXiv: 1412.1318

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 .
LibreCat: https://research-explorer.ista.ac.at/record/5975
DOI: 10.1137/16m1093306
WoS: 000453785100001
arXiv: 1506.08547

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 .
LibreCat: https://research-explorer.ista.ac.at/record/11891
DOI: 10.1137/140957299
arXiv: 1308.0776

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 .
LibreCat: https://research-explorer.ista.ac.at/record/11892
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11694
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11893
DOI: 10.1137/s0097539794263907

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 .
LibreCat: https://research-explorer.ista.ac.at/record/4043
DOI: 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  .
LibreCat: https://research-explorer.ista.ac.at/record/4051
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/4083
DOI: 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  .
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/4105
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/4104
DOI: 10.1137/0215023

Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.”https://doi.org/10.1137/0215019__SIAM Journal on Computing. SIAM, 1986.https://doi.org/10.1137/0215019 .
LibreCat: https://research-explorer.ista.ac.at/record/4110
DOI: 10.1137/0215019