Sotabase

Career

· Associate Professor, Indian Institute of Science (IISc)2024–
· Assistant Professor, Indian Institute of Science (IISc)2019–2024
· Postdoc, Technische Universität München2017–2018
· Researcher, IDSIA2015–2017
· Research Intern In Theory Group, Microsoft2014–2014
· Research Intern, Microsoft2013–2013
· Visiting Student Researcher, UC Berkeley2013–2013
· Graduate Research Assistant, Georgia Institute of Technology2010–2015
· Blue Scholar, IBM Research2009–2010
· Summer Intern (Undergraduate), Korea University2008–2008
· Summer Intern (Undergraduate), University of Illinois2007–2007

Publications (0)

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science · 2004
138
cited
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
ACM-SIAM Symposium on Discrete Algorithms · 2022
41
cited
Universal and Tight Online Algorithms for Generalized-Mean Welfare
AAAI Conference on Artificial Intelligence · 2021
29
cited
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More
International Symposium on Computational Geometry · 2021
22
cited
Finding Fair Allocations under Budget Constraints
AAAI Conference on Artificial Intelligence · 2022
18
cited
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits
AAAI Conference on Artificial Intelligence · 2022
17
cited
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem
International Symposium on Computational Geometry · 2021
16
cited
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set
International Symposium on Computational Geometry · 2023
15
cited
Discovering Bucket Orders from Data
SDM · 2011
12
cited
Guaranteeing Envy-Freeness under Generalized Assignment Constraints
ACM Conference on Economics and Computation · 2023
12
cited
Peak Demand Minimization via Sliced Strip Packing
Algorithmica · 2021
11
cited
A PTAS for Packing Hypercubes into a Knapsack
International Colloquium on Automata, Languages and Programming · 2022
10
cited
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
Algorithmica · 2021
10
cited
Fair Rank Aggregation
Neural Information Processing Systems · 2023
8
cited
Near-optimal Algorithms for Stochastic Online Bin Packing
International Colloquium on Automata, Languages and Programming · 2022
7
cited
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits
International Joint Conference on Artificial Intelligence · 2022
5
cited
Bin Packing under Random-Order: Breaking the Barrier of 3/2
ACM-SIAM Symposium on Discrete Algorithms · 2024
4
cited
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing
Foundations of Software Technology and Theoretical Computer Science · 2021
4
cited
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing
International Colloquium on Automata, Languages and Programming · 2022
4
cited
Approximation Algorithms for ROUND-UFP and ROUND-SAP
Embedded Systems and Applications · 2022
3
cited
Sotabase