K. V. N. Sreenivas

According to our database, K. V. N. Sreenivas authored at least 8 papers between 2021 and 2025.

Collaborative distances:

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

2025

Improved Approximation Algorithms for Three-Dimensional Knapsack.

Klaus Jansen, Debajyoti Kar, Arindam Khan, K. V. N. Sreenivas, Malte Tutas

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

Bin Packing under Random-Order: Breaking the Barrier of 3/2.

Anish Hebbar, Arindam Khan, K. V. N. Sreenivas

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Guaranteeing Envy-Freeness under Generalized Assignment Constraints.

Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Finding Fair Allocations under Budget Constraints.

Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

A PTAS for Packing Hypercubes into a Knapsack.

Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas

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

Near-Optimal Algorithms for Stochastic Online Bin Packing.

Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas

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

Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing.

Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Approximation Algorithms for Generalized Multidimensional Knapsack.

Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas

CoRR, 2021