K. V. N. Sreenivas

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 13

Top Topics

Approximation Algorithms

Packing Problem

Top Venues

Publications

Anish Hebbar, Arindam Khan, K. V. N. Sreenivas
Bin Packing under Random-Order: Breaking the Barrier of 3/2. CoRR (2024)
Anish Hebbar, Arindam Khan, K. V. N. Sreenivas
Bin Packing under Random-Order: Breaking the Barrier of 3/2. SODA (2024)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. EC (2023)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Finding Fair Allocations under Budget Constraints. AAAI (2023)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. CoRR (2023)
Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas
A PTAS for Packing Hypercubes into a Knapsack. CoRR (2022)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Finding Fair Allocations under Budget Constraints. CoRR (2022)
Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas
Near-optimal Algorithms for Stochastic Online Bin Packing. CoRR (2022)
Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas
Near-Optimal Algorithms for Stochastic Online Bin Packing. ICALP (2022)
Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas
A PTAS for Packing Hypercubes into a Knapsack. ICALP (2022)
Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. FSTTCS (2022)
Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas
Approximation Algorithms for Generalized Multidimensional Knapsack. CoRR (2021)
Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. CoRR (2021)