Martin Pal
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
34 | EE | Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál: An online mechanism for ad slot reservations with cancellations. SODA 2009: 1265-1274 |
33 | EE | Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál: General auction mechanism for search advertising. WWW 2009: 241-250 |
2008 | ||
32 | EE | Erran L. Li, Martin Pal, Yang Richard Yang: Proportional Fairness in Multi-Rate Wireless LANs. INFOCOM 2008: 1004-1012 |
31 | EE | Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál: A Truthful Mechanism for Offline Ad Slot Scheduling. SAGT 2008: 182-193 |
30 | EE | Chandra Chekuri, Nitish Korula, Martin Pál: Improved algorithms for orienteering and related problems. SODA 2008: 661-670 |
29 | EE | Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pál: Sponsored Search Auctions with Markovian Users. WINE 2008: 621-628 |
28 | EE | Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal: A Truthful Mechanism for Offline Ad Slot Scheduling CoRR abs/0801.2931: (2008) |
27 | EE | Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pal: Sponsored Search Auctions with Markovian Users CoRR abs/0805.0766: (2008) |
26 | EE | Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal: Online Ad Slotting With Cancellations CoRR abs/0805.1213: (2008) |
25 | EE | Nitish Korula, Martin Pal: Algorithms for Secretary Problems on Graphs and Hypergraphs CoRR abs/0807.1139: (2008) |
24 | EE | Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál: General Auction Mechanism for Search Advertising CoRR abs/0807.1297: (2008) |
23 | EE | 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: Theory research at Google. SIGACT News 39(2): 10-28 (2008) |
2007 | ||
22 | EE | Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget optimization in search-based advertising auctions. ACM Conference on Electronic Commerce 2007: 40-49 |
21 | EE | Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO 2007: 182-196 |
20 | EE | S. Muthukrishnan, Martin Pál, Zoya Svitkina: Stochastic Models for Budget Optimization in Search-Based Advertising. WINE 2007: 131-142 |
19 | EE | Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál: Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Transactions on Algorithms 3(2): (2007) |
18 | EE | Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54(3): 11 (2007) |
17 | EE | Chandra Chekuri, Martin Pál: An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. Theory of Computing 3(1): 197-209 (2007) |
2006 | ||
16 | EE | Chandra Chekuri, Martin Pál: An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. APPROX-RANDOM 2006: 95-103 |
15 | EE | Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget Optimization in Search-Based Advertising Auctions CoRR abs/cs/0612052: (2006) |
14 | EE | S. Muthukrishnan, Martin Pál, Zoya Svitkina: Stochastic Models for Budget Optimization in Search-Based Advertising CoRR abs/cs/0612072: (2006) |
2005 | ||
13 | EE | Moses Charikar, Chandra Chekuri, Martin Pál: Sampling Bounds for Stochastic Optimization. APPROX-RANDOM 2005: 257-269 |
12 | EE | Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX-RANDOM 2005: 86-98 |
11 | EE | Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina: Unbalanced Graph Cuts. ESA 2005: 191-202 |
10 | EE | Chandra Chekuri, Martin Pál: A Recursive Greedy Algorithm for Walks in Directed Graphs. FOCS 2005: 245-253 |
9 | EE | Anupam Gupta, Martin Pál: Stochastic Steiner Trees Without a Root. ICALP 2005: 1051-1063 |
8 | EE | Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys: Approximation Algorithms for Stochastic Inventory Control Models. IPCO 2005: 306-320 |
7 | EE | Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál: Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. SODA 2005: 375-384 |
2004 | ||
6 | EE | Hubie Chen, Martin Pál: Optimization, Games, and Quantified Constraint Satisfaction. MFCS 2004: 239-250 |
5 | EE | Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: Boosted sampling: approximation algorithms for stochastic optimization. STOC 2004: 417-426 |
2003 | ||
4 | EE | Mohammad Mahdian, Martin Pál: Universal Facility Location. ESA 2003: 409-421 |
3 | EE | Martin Pál, Éva Tardos: Group Strategyproof Mechanisms via Primal-Dual Algorithms. FOCS 2003: 584-593 |
2 | EE | Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS 2003: 606- |
2001 | ||
1 | Martin Pál, Éva Tardos, Tom Wexler: Facility Location with Nonuniform Hard Capacities. FOCS 2001: 329-338 |