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 
LibreCat: https://research-explorer.ista.ac.at/record/12086
DOI: 10.1007/s00453-022-01027-6
WoS: 000846967100001

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 
LibreCat: https://research-explorer.ista.ac.at/record/14043
DOI: 10.1007/s00453-023-01154-8
WoS: 001041254900002
arXiv: 2010.16316

Alistarh, D.-A., Nadiradze, G., &; Sabour, A. (2022). Dynamic averaging load balancing on cycles. Algorithmica. Virtual, Online; Germany: Springer Nature.https://doi.org/10.1007/s00453-021-00905-9 
LibreCat: https://research-explorer.ista.ac.at/record/8286
DOI: 10.1007/s00453-021-00905-9
WoS: 000734004600001
arXiv: 2003.09297

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 
LibreCat: https://research-explorer.ista.ac.at/record/11675
DOI: 10.1007/s00453-019-00630-4

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 
LibreCat: https://research-explorer.ista.ac.at/record/11674
DOI: 10.1007/s00453-020-00721-7
arXiv: 1707.02577

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 
LibreCat: https://research-explorer.ista.ac.at/record/11676
DOI: 10.1007/s00453-015-0066-y
arXiv: 1611.05753

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 
LibreCat: https://research-explorer.ista.ac.at/record/11679
DOI: 10.1007/pl00009268

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 
LibreCat: https://research-explorer.ista.ac.at/record/11681
DOI: 10.1007/pl00009228

Alberts, D., &; Henzinger, M. H. (1998). Average-case analysis of dynamic graph algorithms. Algorithmica. Springer Nature.https://doi.org/10.1007/pl00009186 
LibreCat: https://research-explorer.ista.ac.at/record/11680
DOI: 10.1007/pl00009186

Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &; Stolfi, J. (1996). Lines in space: Combinatorics and algorithms. Algorithmica. Springer.https://doi.org/10.1007/BF01955043 
LibreCat: https://research-explorer.ista.ac.at/record/4027
DOI: 10.1007/BF01955043

Edelsbrunner, H., &; Shah, N. (1996). Incremental topological flipping works for regular triangulations. Algorithmica. Springer.https://doi.org/10.1007/BF01975867 
LibreCat: https://research-explorer.ista.ac.at/record/4026
DOI: 10.1007/BF01975867

Henzinger, M. H. (1995). Fully dynamic biconnectivity in graphs. Algorithmica. Springer Nature.https://doi.org/10.1007/bf01189067 
LibreCat: https://research-explorer.ista.ac.at/record/11677
DOI: 10.1007/bf01189067

Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., &; Snoeyink, J. (1994). Ray shooting in polygons using geodesic triangulations. Algorithmica. Springer.https://doi.org/10.1007/BF01377183 
LibreCat: https://research-explorer.ista.ac.at/record/4039
DOI: 10.1007/BF01377183

Chazelle, B., Edelsbrunner, H., Guibas, L., &; Sharir, M. (1994). Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica. Springer.https://doi.org/10.1007/BF01182771 
LibreCat: https://research-explorer.ista.ac.at/record/4038
DOI: 10.1007/BF01182771

Dobkin, D., Edelsbrunner, H., &; Overmars, M. (1990). Searching for empty convex polygons. Algorithmica. Springer.https://doi.org/10.1007/BF01840404 
LibreCat: https://research-explorer.ista.ac.at/record/4075
DOI: 10.1007/BF01840404

Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. Algorithmica. Springer.https://doi.org/10.1007/BF01840438 
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438