Budget constrained bidding in keyword auctions and online knapsack problems D Chakrabarty, Y Zhou, R Lukose WWW2007, Workshop on Sponsored Search Auctions 10 (1367497.1367747), 2007 | 305* | 2007 |
Fair algorithms for clustering S Bera, D Chakrabarty, N Flores, M Negahbani Advances in Neural Information Processing Systems 32, 2019 | 275 | 2019 |
On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP D Chakrabarty, G Goel SIAM Journal on Computing 39, 2189, 2010 | 131 | 2010 |
On allocating goods to maximize fairness D Chakrabarty, J Chuzhoy, S Khanna 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 107-116, 2009 | 131 | 2009 |
An o(n) Monotonicity Tester for Boolean Functions over the Hypercube D Chakrabarty, C Seshadhri SIAM Journal on Computing 45 (2), 461-472, 2016 | 109 | 2016 |
Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids D Chakrabarty, C Seshadhri Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 96 | 2013 |
The Non-Uniform k-Center Problem D Chakrabarty, P Goyal, R Krishnaswamy ACM Transactions on Algorithms (TALG) 16 (4), 1-19, 2020 | 87* | 2020 |
Approximability of the firefighter problem: Computing cuts over time E Anshelevich, D Chakrabarty, A Hate, C Swamy Algorithmica 62 (1), 520-536, 2012 | 87* | 2012 |
Dynamic algorithms for graph coloring S Bhattacharya, D Chakrabarty, M Henzinger, D Nanongkai Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 79 | 2018 |
Provable submodular minimization using Wolfe's algorithm D Chakrabarty, P Jain, P Kothari Advances in Neural Information Processing Systems 27, 2014 | 74 | 2014 |
An optimal lower bound for monotonicity testing over hypergrids D Chakrabarty, C Seshadhri Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013 | 71 | 2013 |
G-parking functions, acyclic orientations and spanning trees B Benson, D Chakrabarty, P Tetali Discrete Mathematics 310 (8), 1340-1353, 2010 | 67 | 2010 |
Deterministic dynamic matching in O (1) update time S Bhattacharya, D Chakrabarty, M Henzinger Algorithmica 82 (4), 1057-1080, 2020 | 62* | 2020 |
Fairness and optimality in congestion games D Chakrabarty, A Mehta, V Nagarajan Proceedings of the 6th ACM Conference on Electronic Commerce, 52-57, 2005 | 59 | 2005 |
Social welfare in one-sided matching markets without money A Bhalgat, D Chakrabarty, S Khanna International Workshop on Approximation Algorithms for Combinatorial …, 2011 | 55 | 2011 |
On column-restricted and priority covering integer programs D Chakrabarty, E Grant, J Könemann Integer Programming and Combinatorial Optimization: 14th International …, 2010 | 54 | 2010 |
Better and simpler error analysis of the Sinkhorn–Knopp algorithm for matrix scaling D Chakrabarty, S Khanna Mathematical Programming 188 (1), 395-407, 2021 | 52 | 2021 |
Approximability of sparse integer programs D Pritchard, D Chakrabarty Algorithmica 61, 75-93, 2011 | 48 | 2011 |
On (1, ε)-restricted assignment makespan minimization D Chakrabarty, S Khanna, S Li Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015 | 47* | 2015 |
Subquadratic submodular function minimization D Chakrabarty, YT Lee, A Sidford, SC Wong Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 46 | 2017 |