Rameesh Paul

Orcid: 0009-0002-5158-0247

According to our database1, Rameesh Paul authored at least 7 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Improved Certificates for Independence Number in Semirandom Hypergraphs.
CoRR, March, 2026

No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs.
Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

2025
Robust Algorithms for Recovering Planted r-Colorable Graphs.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Triangles Improve 0.878 Approximation for Maxcut.
Proceedings of the Approximation, 2025

2024
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2022
Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Independent Sets in Semi-random Hypergraphs.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021


  Loading...