Arka Ray

Arka Ray PhD Candidate Department of Computer Science and Automation Indian Institute of Science, Bengaluru, India Email: arkaray@iisc.ac.in

Hi! I am Arka Ray. I am a computer scientist. I am currently doing my PhD from Computer Science and Automation department of IISc, Bengaluru (CSA @ IISc), advised by Anand Louis. I also did my masters from IISc and did my B. Tech from University of Calcutta.

Research Interests: I am broadly interested in Theoretical Computer Science. These days I am trying to learn more about Boolean (valued) functions and high dimensional expanders. I also want to continue exploring LP and SDP based algorithms, and hardness of approximation (especially “PCP-style” reductions).

Publications, Pre-Prints, etc.

• Improved linearly ordered colorings of hypergraphs via SDP rounding.
  Anand Louis, Alantha Newman, and Arka Ray. FSTTCS 2024.

• Improved Hardness of Approximation for Geometric Bin Packing.
  Arka Ray, and Sai Sandeep. Inf. Process. Lett., March 2025.

• Sparse Cuts in Hypergraph from Random Walks on Simplicial Complexes.
  Anand Louis, Rameesh Paul, and Arka Ray. SWAT 2024.

• There is no APTAS for 2-dimensional vector bin packing: Revisited.
  Arka Ray. Inf. Process. Lett., January 2024.

• MTech Thesis.

I have served as a subreviewer for FSTTCS 24, APPROX 24, WAOA 23 and as a reviewer for Theory of Computation.

I have also TA-ed for a bunch of course: Introduction to Randomized Algorithms (Spring 2025), Approximation Algorithms (Spring 2024), Design and Analysis of Algorithms (Winter 2023), Approximation Algorithms (Spring 2022), Theorist's Toolkit (Winter 2021), and Design and Analysis of Algorithms (Winter 2020).

I co-organized the Theory CS Winter School 2024.

You can also find me at Google Scholar, dblp, arXiv, CSA@IISc, twitter, LinkedIn.