Ron Mosenzon

According to our database, Ron Mosenzon authored at least 5 papers between 2023 and 2026.

Collaborative distances:

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

2026

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs.

Ron Mosenzon

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs.

Julia Chuzhoy, Ron Mosenzon, Ohad Trabelsi

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Hardness of Approximation for Shortest Path with Vector Costs.

Charlie Carlson, Yury Makarychev, Ron Mosenzon

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2024

Scalable Algorithms for Individual Preference Stable Clustering.

Ron Mosenzon, Ali Vakilian

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Exact Flow Sparsification Requires Unbounded Size.

Robert Krauthgamer, Ron Mosenzon

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023