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.
16 Publications
2023 | Published | Journal Article | IST-REx-ID: 14043 | 
A combinatorial cut-toggling algorithm for solving Laplacian linear systems
M. Henzinger, B. Jin, R. Peng, D.P. Williamson, Algorithmica 85 (2023) 2680–3716.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
M. Henzinger, B. Jin, R. Peng, D.P. Williamson, Algorithmica 85 (2023) 2680–3716.
2023 | Published | Journal Article | IST-REx-ID: 12086 |
A simple algorithm for higher-order Delaunay mosaics and alpha shapes
H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.
[Published Version]
View
| Files available
| DOI
| WoS
H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.
2022 | Published | Journal Article | IST-REx-ID: 8286 |
Dynamic averaging load balancing on cycles
D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica 84 (2022) 1007–1029.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica 84 (2022) 1007–1029.
2020 | Published | Journal Article | IST-REx-ID: 11674 |
Dynamic clustering to minimize the sum of radii
M. Henzinger, D. Leniowski, C. Mathieu, Algorithmica 82 (2020) 3183–3194.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M. Henzinger, D. Leniowski, C. Mathieu, Algorithmica 82 (2020) 3183–3194.
2020 | Published | Journal Article | IST-REx-ID: 11675 |
Deterministic dynamic matching in O(1) update time
S. Bhattacharya, D. Chakrabarty, M. Henzinger, Algorithmica 82 (2020) 1057–1080.
[Published Version]
View
| DOI
| Download Published Version (ext.)
S. Bhattacharya, D. Chakrabarty, M. Henzinger, Algorithmica 82 (2020) 1057–1080.
2017 | Published | Journal Article | IST-REx-ID: 11676 |
Maximizing a submodular function with viability constraints
W. Dvořák, M. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
W. Dvořák, M. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.
1999 | Published | Journal Article | IST-REx-ID: 11679
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
M. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.
View
| Files available
| DOI
M. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.
1998 | Published | Journal Article | IST-REx-ID: 11680
Average-case analysis of dynamic graph algorithms
D. Alberts, M. Henzinger, Algorithmica 20 (1998) 31–60.
View
| Files available
| DOI
D. Alberts, M. Henzinger, Algorithmica 20 (1998) 31–60.
1998 | Published | Journal Article | IST-REx-ID: 11681
Lower bounds for fully dynamic connectivity problems in graphs
M. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362.
View
| DOI
M. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362.
1996 | Published | Journal Article | IST-REx-ID: 4026
Incremental topological flipping works for regular triangulations
H. Edelsbrunner, N. Shah, Algorithmica 15 (1996) 223–241.
View
| DOI
H. Edelsbrunner, N. Shah, Algorithmica 15 (1996) 223–241.
1996 | Published | Journal Article | IST-REx-ID: 4027
Lines in space: Combinatorics and algorithms
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Stolfi, Algorithmica 15 (1996) 428–447.
View
| DOI
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Stolfi, Algorithmica 15 (1996) 428–447.
1995 | Published | Journal Article | IST-REx-ID: 11677
Fully dynamic biconnectivity in graphs
M. Henzinger, Algorithmica 13 (1995) 503–538.
View
| DOI
M. Henzinger, Algorithmica 13 (1995) 503–538.
1994 | Published | Journal Article | IST-REx-ID: 4038
Algorithms for bichromatic line-segment problems and polyhedral terrains
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Algorithmica 11 (1994) 116–132.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Algorithmica 11 (1994) 116–132.
1994 | Published | Journal Article | IST-REx-ID: 4039
Ray shooting in polygons using geodesic triangulations
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, Algorithmica 12 (1994) 54–68.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, Algorithmica 12 (1994) 54–68.
1990 | Published | Journal Article | IST-REx-ID: 4075
Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
View
| DOI
| Download None (ext.)
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
1986 | Published | Journal Article | IST-REx-ID: 3580
Edge-skeletons in arrangements with applications
H. Edelsbrunner, Algorithmica 1 (1986) 93–109.
View
| DOI
H. Edelsbrunner, Algorithmica 1 (1986) 93–109.