Rameesh Paul

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

Collaborative distances:

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

2026

Improved Certificates for Independence Number in Semirandom Hypergraphs.

Pravesh Kothari, Anand Louis, Rameesh Paul, Prasad Raghavendra

CoRR, March, 2026

No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs.

Anand Louis, Rameesh Paul

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

2025

Robust Algorithms for Recovering Planted r-Colorable Graphs.

Anand Louis, Rameesh Paul, Prasad Raghavendra

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Triangles Improve 0.878 Approximation for Maxcut.

Fredie George, Anand Louis, Rameesh Paul

Proceedings of the Approximation, 2025

2024

Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes.

Anand Louis, Rameesh Paul, Arka Ray

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2022

Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs.

Akash Kumar, Anand Louis, Rameesh Paul

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Independent Sets in Semi-random Hypergraphs.

Yash Khanna, Anand Louis, Rameesh Paul

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021