| Improved approximation results for stochastic knapsack problems A Bhalgat, A Goel, S Khanna Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 100 | 2011 |
| An O (mn) Gomory-Hu tree construction algorithm for unweighted graphs R Hariharan, T Kavitha, D Panigrahi, A Bhalgat Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 84 | 2007 |
| Online allocation of display ads with smooth delivery A Bhalgat, J Feldman, V Mirrokni Proceedings of the 18th ACM SIGKDD international conference on Knowledge …, 2012 | 53 | 2012 |
| Social welfare in one-sided matching markets without money A Bhalgat, D Chakrabarty, S Khanna Approximation, randomization, and combinatorial optimization. Algorithms and …, 2011 | 47 | 2011 |
| Approximating pure Nash equilibrium in cut, party affiliation, and satisfiability games A Bhalgat, T Chakraborty, S Khanna Proceedings of the 11th ACM conference on Electronic commerce, 73-82, 2010 | 47 | 2010 |
| Fast edge splitting and edmonds' arborescence construction for unweighted graphs A Bhalgat, R Hariharan, T Kavitha, D Panigrahi Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 42 | 2008 |
| Optimal auctions via the multiplicative weight method A Bhalgat, S Gollapudi, K Munagala Proceedings of the fourteenth ACM conference on Electronic commerce, 73-90, 2013 | 32 | 2013 |
| Mechanism design for a risk averse seller A Bhalgat, T Chakraborty, S Khanna International Workshop on Internet and Network Economics, 198-211, 2012 | 22* | 2012 |
| A (2+ e)-approximation algorithm for the stochastic knapsack problem A Bhalgat Unpublished manuscript, 2011 | 19* | 2011 |
| Mechanisms and allocations with positive network externalities A Bhalgat, S Gollapudi, K Munagala Proceedings of the 13th ACM Conference on Electronic Commerce, 179-196, 2012 | 14 | 2012 |
| Selecting Content for Presentation to Social Networking System Users Based On User Engagement with Content AS Bhalgat, S Li, K Pan, JP Parrella, Y Tang US Patent App. 14/731,565, 2016 | 13 | 2016 |
| Optimal lower bounds for universal and differentially private steiner trees and tsps A Bhalgat, D Chakrabarty, S Khanna Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011 | 12 | 2011 |
| Taking the" dis" out of disability: Attending to pre-service teacher dispositions related to students with special needs CS Bialka | 11* | 2012 |
| Nash dynamics in congestion games with similar resources A Bhalgat, T Chakraborty, S Khanna International Workshop on Internet and Network Economics, 362-373, 2009 | 11 | 2009 |
| Generating data to predict user affinity for a component to be included in a content item optimized for an online system user Z Zhang, H Zhang, J Tang, JT Kleban, AS Gavlovski, H Song, DB Lue, ... US Patent 10,846,751, 2020 | 6 | 2020 |
| Adjusting content item specific bid amounts to bias selection of content items from an ad campaign AS Bhalgat, CD Karande, T Chakraborty US Patent App. 14/678,862, 2016 | 6 | 2016 |
| Predicting latent metrics about user interactions with content based on combination of predicted user interactions with the content ROB Zeldin, NJ Davis, AS Bhalgat, H Doshi, H Song US Patent 11,094,021, 2021 | 5 | 2021 |
| Evaluating performance of content item presentation by modifying parameters determining whether to present content item to users of an online system AS Bhalgat, H Doshi US Patent App. 15/006,897, 2017 | 5 | 2017 |
| Relaxing policy rules for regulating the presentation of sponsored content to a user of an online system AS Bhalgat, T Chakraborty, X Li, K Pan US Patent App. 14/839,885, 2017 | 5 | 2017 |
| Evenly presenting content items from a campaign over a time interval by modifying bid amounts associated with the content items AS Bhalgat, CD Karande, T Chakraborty US Patent App. 14/678,897, 2016 | 5 | 2016 |
