Krokhin, A., Oprsal, J., Wrochna, M., &; divný, S. (2023). Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.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, J. D., Kachanovich, S., &; Wintraecken, M. (2023). Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal on Computing. Society for Industrial and Applied Mathematics.https://doi.org/10.1137/21M1412918 
LibreCat: https://research-explorer.ista.ac.at/record/12960
DOI: 10.1137/21M1412918
WoS: 001013183000012

Bhattacharya, S., Henzinger, M. H., Nanongkai, D., &; Wu, X. (2023). Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. Society for Industrial and Applied Mathematics.https://doi.org/10.1137/21M1428649 
LibreCat: https://research-explorer.ista.ac.at/record/14558
DOI: 10.1137/21M1428649

Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., &; Zhu, L. (2023). Why extension-based proofs fail. SIAM Journal on Computing. Society for Industrial and Applied Mathematics.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, M. H., Krinninger, S., &; Nanongkai, D. (2021). A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/16m1097808 
LibreCat: https://research-explorer.ista.ac.at/record/11886
DOI: 10.1137/16m1097808
arXiv: 1504.07056

Czumaj, A., Davies, P., &; Parter, M. (2021). Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/20m1366502 
LibreCat: https://research-explorer.ista.ac.at/record/15271
DOI: 10.1137/20m1366502

Henzinger, M. H., Rao, S., &; Wang, D. (2020). Local flow partitioning for faster edge connectivity. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/18m1180335 
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. Society for Industrial &; Applied Mathematics (SIAM).https://doi.org/10.1137/17m1152292 
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. SIAM.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, S., Henzinger, M. H., &; Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/140998925 
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. Society for Industrial &; Applied Mathematics (SIAM).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, M. H., Krinninger, S., &; Nanongkai, D. (2016). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/140957299 
LibreCat: https://research-explorer.ista.ac.at/record/11891
DOI: 10.1137/140957299
arXiv: 1308.0776

Henzinger, M. H., &; King, V. (2001). Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/s0097539797327209 
LibreCat: https://research-explorer.ista.ac.at/record/11892
DOI: 10.1137/s0097539797327209

Albers, S., &; Henzinger, M. H. (2000). Exploring unknown environments. SIAM Journal on Computing. El Paso, TX, United States: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/s009753979732428x 
LibreCat: https://research-explorer.ista.ac.at/record/11694
DOI: 10.1137/s009753979732428x

Henzinger, M. H. (2000). Improved data structures for fully dynamic biconnectivity. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/s0097539794263907 
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. SIAM.https://doi.org/10.1137/S0097539790179919  
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. SIAM.https://doi.org/10.1137/0222031 
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. SIAM.https://doi.org/10.1137/0222077  
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. SIAM.https://doi.org/10.1137/0222036  
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. Society for Industrial and Applied Mathematics .https://doi.org/10.1137/0913058 
LibreCat: https://research-explorer.ista.ac.at/record/4043
DOI: 10.1137/0913058