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 | Journal Article | IST-REx-ID: 12086 | OA
Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 85, 277–295.
[Published Version] View | Files available | DOI | WoS
 

2023 | Journal Article | IST-REx-ID: 14043 | OA
Henzinger MH, Jin B, Peng R, Williamson DP. 2023. A combinatorial cut-toggling algorithm for solving Laplacian linear systems. Algorithmica. 85, 2680–3716.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 8286 | OA
Alistarh D-A, Nadiradze G, Sabour A. 2021. Dynamic averaging load balancing on cycles. Algorithmica.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2020 | Journal Article | IST-REx-ID: 11675 | OA
Bhattacharya S, Chakrabarty D, Henzinger MH. 2020. Deterministic dynamic matching in O(1) update time. Algorithmica. 82(4), 1057–1080.
[Published Version] View | DOI | Download Published Version (ext.)
 

2020 | Journal Article | IST-REx-ID: 11674 | OA
Henzinger MH, Leniowski D, Mathieu C. 2020. Dynamic clustering to minimize the sum of radii. Algorithmica. 82(11), 3183–3194.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 11676 | OA
Dvořák W, Henzinger MH, Williamson DP. 2017. Maximizing a submodular function with viability constraints. Algorithmica. 77(1), 152–172.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

1999 | Journal Article | IST-REx-ID: 11679
Henzinger MH, King V, Warnow T. 1999. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica. 24, 1–13.
View | Files available | DOI
 

1998 | Journal Article | IST-REx-ID: 11681
Henzinger MH, Fredman ML. 1998. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. 22(3), 351–362.
View | DOI
 

1998 | Journal Article | IST-REx-ID: 11680
Alberts D, Henzinger MH. 1998. Average-case analysis of dynamic graph algorithms. Algorithmica. 20, 31–60.
View | Files available | DOI
 

1996 | Journal Article | IST-REx-ID: 4027
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. 1996. Lines in space: Combinatorics and algorithms. Algorithmica. 15(5), 428–447.
View | DOI
 

1996 | Journal Article | IST-REx-ID: 4026
Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular triangulations. Algorithmica. 15(3), 223–241.
View | DOI
 

1995 | Journal Article | IST-REx-ID: 11677
Henzinger MH. 1995. Fully dynamic biconnectivity in graphs. Algorithmica. 13(6), 503–538.
View | DOI
 

1994 | Journal Article | IST-REx-ID: 4039
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1994. Ray shooting in polygons using geodesic triangulations. Algorithmica. 12(1), 54–68.
View | DOI | Download None (ext.)
 

1994 | Journal Article | IST-REx-ID: 4038
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1994. Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica. 11(2), 116–132.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4075
Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.
View | DOI | Download None (ext.)
 

1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.
View | DOI
 

Filters and Search Terms

issn=0178-4617

Search

Filter Publications