Ron Mosenzon

Orcid: 0009-0006-7775-0653

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

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Hardness of Approximation for Shortest Path with Vector Costs.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs.
CoRR, December, 2025

2024
Scalable Algorithms for Individual Preference Stable Clustering.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Exact Flow Sparsification Requires Unbounded Size.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023


  Loading...