Arka Ray |
Hi! I am Arka Ray. I am currently doing my PhD from Computer Science and Automation department of IISc, Bengaluru (visit CSA @ IISc), under Anand Louis. I also did my masters from IISc and did my B. Tech from University of Calcutta. I am broadly interested in Theoretical Computer Science. I currently work on Approximation Algorithms. I am specially interested in learning more about LP/SDPs. Arindam Khan and I worked on showing inapproximability results for various packing and covering problems as part of my MTech Project.
Improved Hardness of Approximation for Geometric Bin Packing
Arka Ray, and Sai Sandeep. CoRR, January 2023.
Sparse Cuts in Hypergraph from Random Walks on Simplicial Complexes
Anand Louis, Rameesh Paul, and Arka Ray. SWAT 2024 (to appear).
There is no APTAS for 2-dimensional vector bin packing: Revisited.
Arka Ray. Inf. Process. Lett., January 2024.
I have also TA-ed for a bunch of course (as follows).
Design and Analysis of Algorithms (Winter 2020).
Approximation Algorithms (Spring 2024).
I have served as a subreviewer for WAOA 23.
You can also find me at Google Scholar, dblp, arXiv, CSA@IISc, twitter, LinkedIn.