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.
13 Publications
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 | 
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 |
Henzinger, Monika, et al. “A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.” Algorithmica, vol. 85, Springer Nature, 2023, pp. 2680–3716, doi:10.1007/s00453-023-01154-8.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 12086 |
Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” Algorithmica, vol. 85, Springer Nature, 2023, pp. 277–95, doi:10.1007/s00453-022-01027-6.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2022 | Published | Journal Article | IST-REx-ID: 8286 |
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 |
Henzinger, Monika, et al. “Dynamic Clustering to Minimize the Sum of Radii.” Algorithmica, vol. 82, no. 11, Springer Nature, 2020, pp. 3183–94, doi:10.1007/s00453-020-00721-7.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 11675 |
Bhattacharya, Sayan, et al. “Deterministic Dynamic Matching in O(1) Update Time.” Algorithmica, vol. 82, no. 4, Springer Nature, 2020, pp. 1057–80, doi:10.1007/s00453-019-00630-4.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2017 | Published | Journal Article | IST-REx-ID: 11676 |
Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” Algorithmica, vol. 77, no. 1, Springer Nature, 2017, pp. 152–72, doi:10.1007/s00453-015-0066-y.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1999 | Published | Journal Article | IST-REx-ID: 11679
Henzinger, Monika, et al. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.” Algorithmica, vol. 24, Springer Nature, 1999, pp. 1–13, doi:10.1007/pl00009268.
View
| Files available
| DOI
1998 | Published | Journal Article | IST-REx-ID: 11680
Alberts, D., and Monika Henzinger. “Average-Case Analysis of Dynamic Graph Algorithms.” Algorithmica, vol. 20, Springer Nature, 1998, pp. 31–60, doi:10.1007/pl00009186.
View
| Files available
| DOI
1998 | Published | Journal Article | IST-REx-ID: 11681
Henzinger, Monika, and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.” Algorithmica, vol. 22, no. 3, Springer Nature, 1998, pp. 351–62, doi:10.1007/pl00009228.
View
| DOI
1995 | Published | Journal Article | IST-REx-ID: 11677
Henzinger, Monika. “Fully Dynamic Biconnectivity in Graphs.” Algorithmica, vol. 13, no. 6, Springer Nature, 1995, pp. 503–38, doi:10.1007/bf01189067.
View
| DOI
1990 | Published | Journal Article | IST-REx-ID: 4075
Dobkin, David, et al. “Searching for Empty Convex Polygons.” Algorithmica, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:10.1007/BF01840404.
View
| DOI
| Download None (ext.)
1986 | Published | Journal Article | IST-REx-ID: 3580
Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” Algorithmica, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi:10.1007/BF01840438.
View
| DOI