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 M, 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
2023 | Published | Journal Article | IST-REx-ID: 12086 |
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
| 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 M, 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
2020 | Published | Journal Article | IST-REx-ID: 11675 |
Bhattacharya S, Chakrabarty D, Henzinger M. 2020. Deterministic dynamic matching in O(1) update time. Algorithmica. 82(4), 1057–1080.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2017 | Published | Journal Article | IST-REx-ID: 11676 |
Dvořák W, Henzinger M, Williamson DP. 2017. Maximizing a submodular function with viability constraints. Algorithmica. 77(1), 152–172.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1999 | Published | Journal Article | IST-REx-ID: 11679
Henzinger M, 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 | Published | Journal Article | IST-REx-ID: 11680
Alberts D, Henzinger M. 1998. Average-case analysis of dynamic graph algorithms. Algorithmica. 20, 31–60.
View
| Files available
| DOI
1990 | Published | 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.)