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.
12 Publications
2023 | Journal Article | IST-REx-ID: 12086 |
Edelsbrunner, H., & Osang, G. F. (2023). A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-022-01027-6
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 14043 |
Henzinger, M. H., Jin, B., Peng, R., & Williamson, D. P. (2023). A combinatorial cut-toggling algorithm for solving Laplacian linear systems. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-023-01154-8
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 8286 |
Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2021). Dynamic averaging load balancing on cycles. Algorithmica. Virtual, Online; Germany: Springer Nature. https://doi.org/10.1007/s00453-021-00905-9
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2020 | Journal Article | IST-REx-ID: 11675 |
Bhattacharya, S., Chakrabarty, D., & Henzinger, M. H. (2020). Deterministic dynamic matching in O(1) update time. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-019-00630-4
[Published Version]
View
| DOI
| Download Published Version (ext.)
2020 | Journal Article | IST-REx-ID: 11674 |
Henzinger, M. H., Leniowski, D., & Mathieu, C. (2020). Dynamic clustering to minimize the sum of radii. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-020-00721-7
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 11676 |
Dvořák, W., Henzinger, M. H., & Williamson, D. P. (2017). Maximizing a submodular function with viability constraints. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-015-0066-y
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1999 | Journal Article | IST-REx-ID: 11679
Henzinger, M. H., King, V., & Warnow, T. (1999). Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009268
View
| Files available
| DOI
1998 | Journal Article | IST-REx-ID: 11681
Henzinger, M. H., & Fredman, M. L. (1998). Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009228
View
| DOI
1998 | Journal Article | IST-REx-ID: 11680
Alberts, D., & Henzinger, M. H. (1998). Average-case analysis of dynamic graph algorithms. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009186
View
| Files available
| DOI
1995 | Journal Article | IST-REx-ID: 11677
Henzinger, M. H. (1995). Fully dynamic biconnectivity in graphs. Algorithmica. Springer Nature. https://doi.org/10.1007/bf01189067
View
| DOI