| 2010 |
|---|
| 30 | Stochastic Models for Budget Optimization in Search-Based Advertising. S. Muthukrishnan, Martin Pál, Zoya Svitkina. Algorithmica (58): 1022-1044 (2010). Cited by 13Web SearchBibTeXDownload |
| 29 | Iterated Allocations with Delayed Feedback. Sudipto Guha, Kamesh Munagala, Martin Pal. CoRR (abs/1011.1161) (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 28 | An online mechanism for ad slot reservations with cancellations. Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál. SODA 2009, 1265-1274. Cited by 6Web SearchBibTeXDownload |
| 27 | Online Ad Assignment with Free Disposal. Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál. WINE 2009, 374-385. Web SearchBibTeXDownload |
| 26 | General auction mechanism for search advertising. Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál. WWW 2009, 241-250. Cited by 14Web SearchBibTeXDownload |
| 2008 |
|---|
| 25 | Sponsored Search Auctions with Markovian Users. Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pal. CoRR (abs/0805.0766) (2008). Cited by 13Web SearchBibTeXDownload |
| 24 | General Auction Mechanism for Search Advertising. Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál. CoRR (abs/0807.1297) (2008). Web SearchBibTeXDownload |
| 23 | Online Ad Slotting With Cancellations. Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal. CoRR (abs/0805.1213) (2008). Cited by 5Web SearchBibTeXDownload |
| 22 | A Truthful Mechanism for Offline Ad Slot Scheduling. Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál. CoRR (abs/0801.2931) (2008). Cited by 7Web SearchBibTeXDownload |
| 21 | A Truthful Mechanism for Offline Ad Slot Scheduling. Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál. SAGT 2008, 182-193. Cited by 7Web SearchBibTeXDownload |
| 20 | Theory research at Google. Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos. SIGACT News (39): 10-28 (2008). Cited by 3Web SearchBibTeXDownload |
| 19 | Improved algorithms for orienteering and related problems. Chandra Chekuri, Nitish Korula, Martin Pál. SODA 2008, 661-670. Web SearchBibTeXDownload |
| 18 | Sponsored Search Auctions with Markovian Users. Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pal. WINE 2008, 621-628. Cited by 13Web SearchBibTeXDownload |
| 2007 |
|---|
| 17 | Budget optimization in search-based advertising auctions. Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein. ACM Conference on Electronic Commerce 2007, 40-49. Cited by 26Web SearchBibTeXDownload |
| 16 | Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload |
| 15 | Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák. IPCO 2007, 182-196. Web SearchBibTeXDownload |
| 14 | Approximation via cost sharing: Simpler and better approximation algorithms for network design. Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden. J. ACM (54): 11 (2007). Web SearchBibTeXDownload |
| 13 | An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. Chandra Chekuri, Martin Pál. Theory of Computing (3): 197-209 (2007). Web SearchBibTeXDownload |
| 12 | Stochastic Models for Budget Optimization in Search-Based Advertising. S. Muthukrishnan, Martin Pál, Zoya Svitkina. WINE 2007, 131-142. Cited by 13Web SearchBibTeXDownload |
| 2006 |
|---|
| 11 | An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. Chandra Chekuri, Martin Pál. APPROX-RANDOM 2006, 95-103. Web SearchBibTeXDownload |
| 10 | Stochastic Models for Budget Optimization in Search-Based Advertising. S. Muthukrishnan, Martin Pál, Zoya Svitkina. CoRR (abs/cs/0612072) (2006). Cited by 13Web SearchBibTeXDownload |
| 9 | Budget Optimization in Search-Based Advertising Auctions. Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein. CoRR (abs/cs/0612052) (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 8 | Sampling Bounds for Stochastic Optimization. Moses Charikar, Chandra Chekuri, Martin Pál. APPROX-RANDOM 2005, 257-269. Web SearchBibTeXDownload |
| 7 | Unbalanced Graph Cuts. Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina. ESA 2005, 191-202. Web SearchBibTeXDownload |
| 6 | A Recursive Greedy Algorithm for Walks in Directed Graphs. Chandra Chekuri, Martin Pál. FOCS 2005, 245-253. Web SearchBibTeXDownload |
| 5 | Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál. SODA 2005, 375-384. Web SearchBibTeXDownload |
| 2003 |
|---|
| 4 | Universal Facility Location. Mohammad Mahdian, Martin Pál. ESA 2003, 409-421. Web SearchBibTeXDownload |
| 3 | Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden. FOCS 2003, 606-615. Web SearchBibTeXDownload |
| 2 | Group Strategyproof Mechanisms via Primal-Dual Algorithms. Martin Pál, Éva Tardos. FOCS 2003, 584-593. Web SearchBibTeXDownload |
| 2001 |
|---|
| 1 | Facility Location with Nonuniform Hard Capacities. Martin Pál, Éva Tardos, Tom Wexler. FOCS 2001, 329-338. Web SearchBibTeXDownload |
