| Maximizing a monotone submodular function subject to a matroid constraint G Calinescu, C Chekuri, M Pal, J Vondrák SIAM Journal on Computing 40 (6), 1740-1766, 2011 | 1345* | 2011 |
| Contextual multi-armed bandits T Lu, D Pál, M Pál Proceedings of the Thirteenth international conference on Artificial …, 2010 | 361 | 2010 |
| A recursive greedy algorithm for walks in directed graphs C Chekuri, M Pal 46th annual IEEE symposium on foundations of computer science (FOCS'05), 245-253, 2005 | 335 | 2005 |
| Proportional fairness in multi-rate wireless LANs L Li, M Pal, YR Yang IEEE INFOCOM 2008-The 27th Conference on Computer Communications, 1004-1012, 2008 | 276 | 2008 |
| Improved algorithms for orienteering and related problems C Chekuri, N Korula, M Pál ACM Transactions on Algorithms (TALG) 8 (3), 1-27, 2012 | 262 | 2012 |
| Online ad assignment with free disposal J Feldman, N Korula, V Mirrokni, S Muthukrishnan, M Pál International workshop on internet and network economics, 374-385, 2009 | 226 | 2009 |
| Budget optimization in search-based advertising auctions J Feldman, S Muthukrishnan, M Pal, C Stein Proceedings of the 8th ACM conference on Electronic commerce, 40-49, 2007 | 221 | 2007 |
| Facility location with nonuniform hard capacities M Pal, T Tardos, T Wexler Proceedings 42nd IEEE symposium on foundations of computer science, 329-338, 2001 | 217 | 2001 |
| Group strategy proof mechanisms via primal-dual algorithms M Pál, É Tardos 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 214 | 2003 |
| Boosted sampling: approximation algorithms for stochastic optimization A Gupta, M Pál, R Ravi, A Sinha Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 213 | 2004 |
| Algorithms for secretary problems on graphs and hypergraphs N Korula, M Pál International Colloquium on Automata, Languages, and Programming, 508-520, 2009 | 203 | 2009 |
| Sponsored search auctions with markovian users G Aggarwal, J Feldman, S Muthukrishnan, M Pál International Workshop on Internet and Network Economics, 621-628, 2008 | 199 | 2008 |
| Universal facility location M Mahdian, M Pál Algorithms-ESA 2003: 11th Annual European Symposium, Budapest, Hungary …, 2003 | 147 | 2003 |
| Approximation algorithms for stochastic inventory control models R Levi, M Pál, RO Roundy, DB Shmoys Mathematics of Operations Research 32 (2), 284-302, 2007 | 145 | 2007 |
| General auction mechanism for search advertising G Aggarwal, S Muthukrishnan, D Pál, M Pál Proceedings of the 18th international conference on World wide web, 241-250, 2009 | 140 | 2009 |
| Sampling bounds for stochastic optimization M Charikar, C Chekuri, M Pál International workshop on approximation algorithms for combinatorial …, 2005 | 98 | 2005 |
| Preferred cost bidding for online advertising J Feldman, GR Kim, JJY Liang, B Narendran, M Pal, R Rao, A Wildavsky US Patent App. 11/734,765, 2008 | 94 | 2008 |
| Approximation via cost sharing: Simpler and better approximation algorithms for network design A Gupta, A Kumar, M P´ al, T Roughgarden Journal of the ACM (JACM) 54 (3), 11-es, 2007 | 90 | 2007 |
| Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem A Gupta, A Kumar, M Pál, T Roughgarden 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 88 | 2003 |
| An online mechanism for ad slot reservations with cancellations F Constantin, J Feldman, S Muthukrishnan, M Pál Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009 | 87* | 2009 |
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignVerified email at illinois.edu
