Hanwen Zhang

According to our database, Hanwen Zhang authored at least 8 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation.

Rasmus Pagh, Lukas Retschmeier, Hao Wu, Hanwen Zhang

Proc. ACM Manag. Data, May, 2025

Static to Dynamic Correlation Clustering.

Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang

CoRR, April, 2025

Solving the Correlation Cluster LP in Sublinear Time.

Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Deterministic 3-server on a circle and the limitation of canonical potentials.

Zhiyi Huang, Hanwen Zhang

Theor. Comput. Sci., 2024

Faster Differentially Private Top-<i>k</i> Selection: A Joint Exponential Mechanism with Pruning.

Hao Wu, Hanwen Zhang

CoRR, 2024

Combinatorial Correlation Clustering.

Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Minimum Star Partitions of Simple Polygons in Polynomial Time.

Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Faster Differentially Private Top-k Selection: A Joint Exponential Mechanism with Pruning.

Hao Wu, Hanwen Zhang

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024