M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Dynamic maintenance of monotone dynamic programs and applications,” in 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 2023, vol. 254.
LibreCat: https://research-explorer.ista.ac.at/record/12760
DOI: 10.4230/LIPIcs.STACS.2023.36
arXiv: 2301.01744

G. Goranci and M. H. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.
LibreCat: https://research-explorer.ista.ac.at/record/14085
DOI: 10.4230/LIPIcs.ICALP.2023.69

M. H. Henzinger, P. Liu, J. Vondrák, and D. W. Zheng, “Faster submodular maximization for several classes of matroids,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.
LibreCat: https://research-explorer.ista.ac.at/record/14086
DOI: 10.4230/LIPIcs.ICALP.2023.74
arXiv: 2305.00122

H. Fichtenberger, M. H. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.
LibreCat: https://research-explorer.ista.ac.at/record/14462

S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Deterministic near-optimal approximation algorithms for dynamic set cover,” SIAM Journal on Computing, vol. 52, no. 5. Society for Industrial and Applied Mathematics, pp. 1132–1192, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14558
DOI: 10.1137/21M1428649

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

M. H. Henzinger, B. Jin, R. Peng, and D. P. Williamson, “A combinatorial cut-toggling algorithm for solving Laplacian linear systems,” Algorithmica, vol. 85. Springer Nature, pp. 2680–3716, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14043
DOI: 10.1007/s00453-023-01154-8
WoS: 001041254900002
arXiv: 2010.16316

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

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