I am a fourth-year Ph. D. student in the Computer Science and Automation (CSA) department at the Indian Institute of Science (IISc). I am fortunate to be advised by Prof. Arindam Khan. My interests lie in the field of Theoretical Computer Science; in particular, Approximation and Online Algorithms. Additionally, I have also worked in the area of fair division. I am grateful to the Google PhD Fellowship Program for supporting my research.

Before joining Ph. D., I obtained an M. Tech. (Research) degree from the CSA department at IISc under the supervision of Prof. Arindam Khan. Prior to that, I completed my B. Tech. in Computer Science and Engineering (CSE) from IIT Bombay, where I had my first exposure to research through working on the Skolem Problem under the guidance of Prof. S. Akshay and Prof. Supratik Chakraborty.

Contact: venkatanaga@iisc.ac.in

News

Oct-Dec 2025: Visited Prof. Debmalya Panigrahi at Duke University.
Aug-Oct 2025: Visited Prof. Anupam Gupta at New York University.
June 2025: Visited Prof. Amit Kumar at IIT Delhi.
June 2024: Awarded Dr. M. N. S. Swamy Gold Medal for Best M. Tech. (Research) Thesis.

Research

(I go by the name K. V. N. Sreenivas in all publications. Also see dblp. By convention in Theory, all authors are listed in alphabetical order)

Conference Publications

Improved Approximation Algorithms for Three-Dimensional Knapsack (arXiv)
SoCG 2025
with Klaus Jansen, Debajyoti Kar, Arindam Khan, Malte Tutas
Bin Packing under Random-Order: Breaking the Barrier of 3/2 (arXiv)
SODA 2024
with Anish Hebbar, Arindam Khan
Guaranteeing Envy-Freeness under Generalized Assignment Constraints (arXiv)
EC 2023
with Siddharth Barman, Arindam Khan, Sudarshan Shyam
Finding Fair Allocations under Budget Constraints (arXiv)
AAAI 2023
with Siddharth Barman, Arindam Khan, Sudarshan Shyam
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing (arXiv)
FSTTCS 2022
with Arindam Khan, Eklavya Sharma
Near-optimal Algorithms for Stochastic Online Bin Packing (arXiv)
ICALP 2022
with Nikhil Ayyadevara, Rajni Dabas, Arindam Khan
A PTAS for Packing Hypercubes into a Knapsack (arXiv)
ICALP 2022
with Klaus Jansen, Arindam Khan, Marvin Lira

Journal Publications

Near-optimal Algorithms for Stochastic Online Bin Packing (arXiv)
ACM Transactions on Algorithms 2025
with Nikhil Ayyadevara, Rajni Dabas, Arindam Khan

Manuscripts

Approximation Algorithms for Generalized Multidimensional Knapsack (arXiv)
with Arindam Khan, Eklavya Sharma

Master's Thesis

Improved Algorithms for Variants of Bin Packing and Knapsack (pdf)
Advised by Prof. Arindam Khan