| 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 | 263* | 2007 |
| Fair algorithms for clustering S Bera, D Chakrabarty, N Flores, M Negahbani Advances in Neural Information Processing Systems 32, 2019 | 151 | 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 | 122 | 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 | 112 | 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 | 94 | 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 | 83 | 2013 |
| Approximability of the firefighter problem E Anshelevich, D Chakrabarty, A Hate, C Swamy Algorithmica 62 (1), 520-536, 2012 | 81* | 2012 |
| Provable submodular minimization using Wolfe's algorithm D Chakrabarty, P Jain, P Kothari Advances in Neural Information Processing Systems 27, 2014 | 65 | 2014 |
| G-parking functions, acyclic orientations and spanning trees B Benson, D Chakrabarty, P Tetali Discrete Mathematics 310 (8), 1340-1353, 2010 | 64 | 2010 |
| An optimal lower bound for monotonicity testing over hypergrids D Chakrabarty, C Seshadhri Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013 | 63 | 2013 |
| The Non-Uniform k-Center Problem D Chakrabarty, P Goyal, R Krishnaswamy ACM Transactions on Algorithms (TALG) 16 (4), 1-19, 2020 | 56* | 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 | 53 | 2005 |
| 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 | 51 | 2018 |
| On column-restricted and priority covering integer programs D Chakrabarty, E Grant, J Könemann International Conference on Integer Programming and Combinatorial …, 2010 | 51 | 2010 |
| Social welfare in one-sided matching markets without money A Bhalgat, D Chakrabarty, S Khanna Approximation, randomization, and combinatorial optimization. Algorithms and …, 2011 | 50 | 2011 |
| Deterministic dynamic matching in O (1) update time S Bhattacharya, D Chakrabarty, M Henzinger Algorithmica 82 (4), 1057-1080, 2020 | 44* | 2020 |
| Better and simpler error analysis of the Sinkhorn–Knopp algorithm for matrix scaling D Chakrabarty, S Khanna Mathematical Programming 188 (1), 395-407, 2021 | 41* | 2021 |
| On (1, ε)-restricted assignment makespan minimization D Chakrabarty, S Khanna, S Li Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015 | 40* | 2015 |
| Rationality and Strongly Polynomial Solvability of Eisenberg-Gale Markets with Two Agents D Chakrabarty, NR Devanur, VV Vazirani SIAM Journal on Discrete Mathematics 24 (3), 1117-1136, 2010 | 39* | 2010 |
| Approximability of capacitated network design D Chakrabarty, C Chekuri, S Khanna, N Korula Algorithmica 72 (2), 493-514, 2015 | 38* | 2015 |
C. SeshadhriUniversity of California, Santa Cruz確認したメール アドレス: ucsc.edu
