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.

17 Publications


2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 | OA
Lill, Jonas, Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. 2025
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2023 | Published | Journal Article | IST-REx-ID: 14043 | OA
M. Henzinger, B. Jin, R. Peng, and D. P. Williamson, “A combinatorial cut-toggling algorithm for solving Laplacian linear systems,” Algorithmica, vol. 85. Springer Nature, pp. 2680–3716, 2023.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2023 | Published | Journal Article | IST-REx-ID: 12086 | OA
H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay mosaics and alpha shapes,” Algorithmica, vol. 85. Springer Nature, pp. 277–295, 2023.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2022 | Published | Journal Article | IST-REx-ID: 8286 | OA
Alistarh, Dan-Adrian, Dynamic averaging load balancing on cycles. Algorithmica 84 (4). 2022
[Published Version] View | Files available | DOI | WoS | arXiv
 

2020 | Published | Journal Article | IST-REx-ID: 11674 | OA
M. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” Algorithmica, vol. 82, no. 11. Springer Nature, pp. 3183–3194, 2020.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

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

2017 | Published | Journal Article | IST-REx-ID: 11676 | OA
W. Dvořák, M. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” Algorithmica, vol. 77, no. 1. Springer Nature, pp. 152–172, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

1999 | Published | Journal Article | IST-REx-ID: 11679
M. Henzinger, V. King, and T. Warnow, “Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology,” Algorithmica, vol. 24. Springer Nature, pp. 1–13, 1999.
View | Files available | DOI
 

1998 | Published | Journal Article | IST-REx-ID: 11680
D. Alberts and M. Henzinger, “Average-case analysis of dynamic graph algorithms,” Algorithmica, vol. 20. Springer Nature, pp. 31–60, 1998.
View | Files available | DOI
 

1998 | Published | Journal Article | IST-REx-ID: 11681
M. Henzinger and M. L. Fredman, “Lower bounds for fully dynamic connectivity problems in graphs,” Algorithmica, vol. 22, no. 3. Springer Nature, pp. 351–362, 1998.
View | DOI
 

1996 | Published | Journal Article | IST-REx-ID: 4026
H. Edelsbrunner and N. Shah, “Incremental topological flipping works for regular triangulations,” Algorithmica, vol. 15, no. 3. Springer, pp. 223–241, 1996.
View | DOI
 

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

1995 | Published | Journal Article | IST-REx-ID: 11677
M. Henzinger, “Fully dynamic biconnectivity in graphs,” Algorithmica, vol. 13, no. 6. Springer Nature, pp. 503–538, 1995.
View | DOI
 

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

1994 | Published | Journal Article | IST-REx-ID: 4039
B. Chazelle et al., “Ray shooting in polygons using geodesic triangulations,” Algorithmica, vol. 12, no. 1. Springer, pp. 54–68, 1994.
View | DOI | Download None (ext.)
 

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

1986 | Published | Journal Article | IST-REx-ID: 3580
H. Edelsbrunner, “Edge-skeletons in arrangements with applications,” Algorithmica, vol. 1, no. 1–4. Springer, pp. 93–109, 1986.
View | DOI
 

Filters and Search Terms

issn=0178-4617

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed