Krokhin, Andrei, Jakub Oprsal, Marcin Wrochna, and Stanislav divný. “Topology and Adjunction in Promise Constraint Satisfaction.”https://doi.org/10.1137/20m1378223__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics, 2023.https://doi.org/10.1137/20m1378223 .
LibreCat: https://research-explorer.ista.ac.at/record/12563
DOI: 10.1137/20m1378223
WoS: 000955000000001
arXiv: 2003.11351

Boissonnat, Jean Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn Triangulations.”https://doi.org/10.1137/21M1412918__SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023.https://doi.org/10.1137/21M1412918 .
LibreCat: https://research-explorer.ista.ac.at/record/12960
DOI: 10.1137/21M1412918
WoS: 001013183000012

Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Xiaowei Wu. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.”https://doi.org/10.1137/21M1428649__SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023.https://doi.org/10.1137/21M1428649 .
LibreCat: https://research-explorer.ista.ac.at/record/14558
DOI: 10.1137/21M1428649

Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Why Extension-Based Proofs Fail.”https://doi.org/10.1137/20M1375851__SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023.https://doi.org/10.1137/20M1375851 .
LibreCat: https://research-explorer.ista.ac.at/record/14364
DOI: 10.1137/20M1375851
WoS: 001082972300004
arXiv: 1811.01421

Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.”https://doi.org/10.1137/16m1097808__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics, 2021.https://doi.org/10.1137/16m1097808 .
LibreCat: https://research-explorer.ista.ac.at/record/11886
DOI: 10.1137/16m1097808
arXiv: 1504.07056

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

Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Selecting Heavily Covered Points.”https://doi.org/10.1137/S0097539790179919 __SIAM Journal on Computing. SIAM, 1994.https://doi.org/10.1137/S0097539790179919  .
LibreCat: https://research-explorer.ista.ac.at/record/4033
DOI: 10.1137/S0097539790179919 

Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements.”https://doi.org/10.1137/0222031__SIAM Journal on Computing. SIAM, 1993.https://doi.org/10.1137/0222031 .
LibreCat: https://research-explorer.ista.ac.at/record/4041
DOI: 10.1137/0222031

Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments and Related Problems.”https://doi.org/10.1137/0222077 __SIAM Journal on Computing. SIAM, 1993.https://doi.org/10.1137/0222077  .
LibreCat: https://research-explorer.ista.ac.at/record/4036
DOI: 10.1137/0222077 

Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.”https://doi.org/10.1137/0222036 __SIAM Journal on Computing. SIAM, 1993.https://doi.org/10.1137/0222036  .
LibreCat: https://research-explorer.ista.ac.at/record/4042
DOI: 10.1137/0222036 

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