Cohen-Addad, V., Saulpic, D., &; Schwiegelshohn, C. (2023). Deterministic clustering in high dimensional spaces: Sketches and approximation. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (pp. 1105–1130). Santa Cruz, CA, United States: IEEE.https://doi.org/10.1109/focs57990.2023.00066 
LibreCat: https://research-explorer.ista.ac.at/record/14768
DOI: 10.1109/focs57990.2023.00066
arXiv: 2310.04076

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

Zheng, D. W., &; Henzinger, M. H. (2023). Multiplicative auction algorithm for approximate maximum weight bipartite matching. In International Conference on Integer Programming and Combinatorial Optimization (Vol. 13904, pp. 453–465). Madison, WI, United States: Springer Nature.https://doi.org/10.1007/978-3-031-32726-1_32 
LibreCat: https://research-explorer.ista.ac.at/record/13236
DOI: 10.1007/978-3-031-32726-1_32
arXiv: 2301.09217

Charikar, M., Hu, L., Henzinger, M. H., Vötsch, M., &; Waingarten, E. (2023). Simple, scalable and effective clustering via one-dimensional projections. In 37th Conference on Neural Information Processing Systems (Vol. 36). New Orleans, LA, United States.
LibreCat: https://research-explorer.ista.ac.at/record/15364
arXiv: 2310.16752