Mohammad Roghani

Orcid: 0000-0001-8247-3773

According to our database1, Mohammad Roghani authored at least 16 papers between 2020 and 2025.

Collaborative distances:

Timeline

2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
7
1
1
1
1
2
5
3
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Stable Matching with Interviews.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy.
Math. Oper. Res., 2024

Approximating Maximum Matching Requires Almost Quadratic Time.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Fully Dynamic Matching: -Approximation in Polylog Update Time.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Sublinear Algorithms for TSP via Path Covers.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time.
CoRR, 2023

Sublinear Time Algorithms and Complexity of Approximate Maximum Matching.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Beating Greedy Matching in Sublinear Time.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Local Computation Algorithms for Maximum Matching: New Lower Bounds.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Some Results on Dominating Induced Matchings.
Graphs Comb., 2022

Beating the Folklore Algorithm for Dynamic Matching.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Sequential importance sampling for estimating expectations over the space of perfect matchings.
CoRR, 2021

2020
Complexity of Computing the Anti-Ramsey Numbers for Paths.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020


  Loading...