Krokhin, Andrei, et al. “Topology and Adjunction in Promise Constraint Satisfaction.”10.1137/20m1378223__SIAM Journal on Computing, vol. 52, no. 1, Society for Industrial &; Applied Mathematics, 2023, pp. 38–79, doi:10.1137/20m1378223.
LibreCat: https://research-explorer.ista.ac.at/record/12563
DOI: 10.1137/20m1378223
WoS: 000955000000001
arXiv: 2003.11351

Boissonnat, Jean Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn Triangulations.”10.1137/21M1412918__SIAM Journal on Computing, vol. 52, no. 2, Society for Industrial and Applied Mathematics, 2023, pp. 452–86, doi:10.1137/21M1412918.
LibreCat: https://research-explorer.ista.ac.at/record/12960
DOI: 10.1137/21M1412918
WoS: 001013183000012

Bhattacharya, Sayan, et al. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.”10.1137/21M1428649__SIAM Journal on Computing, vol. 52, no. 5, Society for Industrial and Applied Mathematics, 2023, pp. 1132–92, doi:10.1137/21M1428649.
LibreCat: https://research-explorer.ista.ac.at/record/14558
DOI: 10.1137/21M1428649

Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.”10.1137/20M1375851__SIAM Journal on Computing, vol. 52, no. 4, Society for Industrial and Applied Mathematics, 2023, pp. 913–44, doi:10.1137/20M1375851.
LibreCat: https://research-explorer.ista.ac.at/record/14364
DOI: 10.1137/20M1375851
WoS: 001082972300004
arXiv: 1811.01421

Henzinger, Monika H., et al. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.”10.1137/16m1097808__SIAM Journal on Computing, vol. 50, no. 3, Society for Industrial &; Applied Mathematics, 2021, pp. STO-98-STO-137, doi:10.1137/16m1097808.
LibreCat: https://research-explorer.ista.ac.at/record/11886
DOI: 10.1137/16m1097808
arXiv: 1504.07056

Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.”10.1137/20m1366502__SIAM Journal on Computing, vol. 50, no. 5, Society for Industrial &; Applied Mathematics, 2021, pp. 1603–26, doi:10.1137/20m1366502.
LibreCat: https://research-explorer.ista.ac.at/record/15271
DOI: 10.1137/20m1366502

Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.”10.1137/18m1180335__SIAM Journal on Computing, vol. 49, no. 1, Society for Industrial &; Applied Mathematics, 2020, pp. 1–36, doi:10.1137/18m1180335.
LibreCat: https://research-explorer.ista.ac.at/record/11889
DOI: 10.1137/18m1180335
arXiv: 1704.01254

Boissonnat, Jean-Daniel, et al. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.”10.1137/17m1152292__SIAM Journal on Computing, vol. 48, no. 3, Society for Industrial &; Applied Mathematics (SIAM), 2019, pp. 1046–97, doi:10.1137/17m1152292.
LibreCat: https://research-explorer.ista.ac.at/record/6672
DOI: 10.1137/17m1152292
arXiv: 1703.06487

Achlioptas, Dimitris, et al. “A Local Lemma for Focused Stochastical Algorithms.”10.1137/16m109332x__SIAM Journal on Computing, vol. 48, no. 5, SIAM, 2019, pp. 1583–602, doi:10.1137/16m109332x.
LibreCat: https://research-explorer.ista.ac.at/record/7412
DOI: 10.1137/16m109332x
WoS: 000493900200005
arXiv: 1809.01537

Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.”10.1137/140998925__SIAM Journal on Computing, vol. 47, no. 3, Society for Industrial &; Applied Mathematics, 2018, pp. 859–87, doi: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.”10.1137/16m1093306__SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial &; Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
LibreCat: https://research-explorer.ista.ac.at/record/5975
DOI: 10.1137/16m1093306
WoS: 000453785100001
arXiv: 1506.08547

Henzinger, Monika H., et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.”10.1137/140957299__SIAM Journal on Computing, vol. 45, no. 3, Society for Industrial &; Applied Mathematics, 2016, pp. 947–1006, doi: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.”10.1137/s0097539797327209__SIAM Journal on Computing, vol. 31, no. 2, Society for Industrial &; Applied Mathematics, 2001, pp. 364–74, doi: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.”10.1137/s009753979732428x__SIAM Journal on Computing, vol. 29, no. 4, Society for Industrial and Applied Mathematics, 2000, pp. 1164–88, doi: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.”10.1137/s0097539794263907__SIAM Journal on Computing, vol. 29, no. 6, Society for Industrial &; Applied Mathematics, 2000, pp. 1761–815, doi:10.1137/s0097539794263907.
LibreCat: https://research-explorer.ista.ac.at/record/11893
DOI: 10.1137/s0097539794263907

Edelsbrunner, Herbert, et al. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.”10.1137/0913058__SIAM Journal on Scientific Computing, vol. 13, no. 4, Society for Industrial and Applied Mathematics , 1992, pp. 994–1008, doi: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.”10.1137/0220016 __SIAM Journal on Computing, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi:10.1137/0220016 .
LibreCat: https://research-explorer.ista.ac.at/record/4051
DOI: 10.1137/0220016 

Yao, F., et al. “Partitioning Space for Range Queries.”10.1137/0218025__SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi: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.”10.1137/0217054 __SIAM Journal on Computing, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:10.1137/0217054 .
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054 

Edelsbrunner, Herbert, et al. “Constructing Arrangements of Lines and Hyperplanes with Applications.”10.1137/0215024__SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 341–63, doi:10.1137/0215024.
LibreCat: https://research-explorer.ista.ac.at/record/4105
DOI: 10.1137/0215024