Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

21 Publications


2023 | Published | Journal Article | IST-REx-ID: 12563 | OA
Topology and adjunction in promise constraint satisfaction
A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2023 | Published | Journal Article | IST-REx-ID: 12960 | OA
Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations
J.D. Boissonnat, S. Kachanovich, M. Wintraecken, SIAM Journal on Computing 52 (2023) 452–486.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 

2023 | Published | Journal Article | IST-REx-ID: 14364 | OA
Why extension-based proofs fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, SIAM Journal on Computing 52 (2023) 913–944.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2023 | Published | Journal Article | IST-REx-ID: 14558
Deterministic near-optimal approximation algorithms for dynamic set cover
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, SIAM Journal on Computing 52 (2023) 1132–1192.
View | DOI
 

2021 | Published | Journal Article | IST-REx-ID: 11886 | OA
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
M.H. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 50 (2021) STOC16-98-STOC16-137.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2020 | Published | Journal Article | IST-REx-ID: 11889
Local flow partitioning for faster edge connectivity
M.H. Henzinger, S. Rao, D. Wang, SIAM Journal on Computing 49 (2020) 1–36.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 6672 | OA
Anisotropic triangulations via discrete Riemannian Voronoi diagrams
J.-D. Boissonnat, M. Rouxel-Labbé, M. Wintraecken, SIAM Journal on Computing 48 (2019) 1046–1097.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Published | Journal Article | IST-REx-ID: 7412 | OA
A local lemma for focused stochastical algorithms
D. Achlioptas, F. Iliopoulos, V. Kolmogorov, SIAM Journal on Computing 48 (2019) 1583–1602.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 11890 | OA
Deterministic fully dynamic data structures for vertex cover and matching
S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 5975 | OA
Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2016 | Published | Journal Article | IST-REx-ID: 11891 | OA
Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization
M.H. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 45 (2016) 947–1006.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2001 | Published | Journal Article | IST-REx-ID: 11892
Maintaining minimum spanning forests in dynamic graphs
M.H. Henzinger, V. King, SIAM Journal on Computing 31 (2001) 364–374.
View | DOI
 

2000 | Published | Journal Article | IST-REx-ID: 11694
Exploring unknown environments
S. Albers, M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1164–1188.
View | DOI
 

2000 | Published | Journal Article | IST-REx-ID: 11893
Improved data structures for fully dynamic biconnectivity
M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1761–1815.
View | DOI
 

1992 | Published | Journal Article | IST-REx-ID: 4043
An O(n^2 log n) time algorithm for the MinMax angle triangulation
H. Edelsbrunner, T. Tan, R. Waupotitsch, SIAM Journal on Scientific Computing 13 (1992) 994–1008.
View | DOI | Download None (ext.)
 

1991 | Published | Journal Article | IST-REx-ID: 4051
An O(n log^2 h) time algorithm for the three-dimensional convex hull problem
H. Edelsbrunner, W. Shi, SIAM Journal on Computing 20 (1991) 259–269.
View | DOI | Download None (ext.)
 

1989 | Published | Journal Article | IST-REx-ID: 4083 | OA
Partitioning space for range queries
F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.
[Published Version] View | DOI | Download Published Version (ext.)
 

1988 | Published | Journal Article | IST-REx-ID: 4091
Probing convex polygons with X-Rays
H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.
View | DOI | Download None (ext.)
 

1986 | Published | Journal Article | IST-REx-ID: 4104
Optimal point location in a monotone subdivision
H. Edelsbrunner, L. Guibas, J. Stolfi, SIAM Journal on Computing 15 (1986) 317–340.
View | DOI
 

1986 | Published | Journal Article | IST-REx-ID: 4105
Constructing arrangements of lines and hyperplanes with applications
H. Edelsbrunner, J. O’Rourke, R. Seidel, SIAM Journal on Computing 15 (1986) 341–363.
View | DOI
 

Filters and Search Terms

eissn=1095-7111

Search

Filter Publications

Display / Sort

Export / Embed