| 2009 | ||
|---|---|---|
| 45 | Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson, Alan Roytman: On the price of mediation. ACM Conference on Electronic Commerce 2009: 315-324 | |
| 44 | Adam Meyerson, Brian Tagiku: Minimizing Average Shortest Path Distances via Shortcut Edge Addition. APPROX-RANDOM 2009: 272-285 | |
| 43 | Douglas E. Carroll, Adam Meyerson, Brian Tagiku: Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs. APPROX-RANDOM 2009: 29-41 | |
| 42 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: A Constant Factor Approximation for the Single Sink Edge Installation Problem. SIAM J. Comput. 38(6): 2426-2442 (2009) | |
| 2008 | ||
| 41 | Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson: Frugal Routing on Wireless Ad-Hoc Networks. SAGT 2008: 133-144 | |
| 40 | Aaron Cote, Adam Meyerson, Laura J. Poplawski: Randomized k-server on hierarchical binary trees. STOC 2008: 227-234 | |
| 39 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin: Cost-Distance: Two Metric Network Design. SIAM J. Comput. 38(4): 1648-1659 (2008) | |
| 2007 | ||
| 38 | David Kempe, Adam Meyerson, Nainesh Solanki, Ramnath Chellappa: Pricing of partially compatible products. ACM Conference on Electronic Commerce 2007: 218-226 | |
| 37 | Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff: Approximation Algorithms for Orienteering and Discounted-Reward TSP. SIAM J. Comput. 37(2): 653-670 (2007) | |
| 2006 | ||
| 36 | Sven Koenig, Craig A. Tovey, Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Adam Meyerson, Sonal Jain: The Power of Sequential Single-Item Auctions for Agent Coordination. AAAI 2006 | |
| 35 | Douglas E. Carroll, Ashish Goel, Adam Meyerson: Embedding Bounded Bandwidth Graphs into l1. ICALP (1) 2006: 27-37 | |
| 34 | Adam Meyerson, Akash Nanavati, Laura J. Poplawski: Randomized online algorithms for minimum metric bipartite matching. SODA 2006: 954-959 | |
| 33 | Ashish Goel, Adam Meyerson: Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs. Algorithmica 44(4): 301-323 (2006) | |
| 32 | Mohit Lad, Daniel Massey, Adam Meyerson, Akash Nanavati, Lixia Zhang: Minimum failure explanations for path vector routing changes. J. Comb. Optim. 12(1-2): 5-16 (2006) | |
| 2005 | ||
| 31 | Adam Meyerson: The Parking Permit Problem. FOCS 2005: 274-284 | |
| 30 | Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Sven Koenig, Craig A. Tovey, Adam Meyerson, Sonal Jain: Auction-Based Multi-Robot Routing. Robotics: Science and Systems 2005: 343-350 | |
| 29 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Approximate majorization and fair online load balancing. ACM Transactions on Algorithms 1(2): 338-349 (2005) | |
| 2004 | ||
| 28 | Konstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson: Simultaneous Source Location. APPROX-RANDOM 2004: 13-26 | |
| 27 | Adam Meyerson, Ryan Williams: On the Complexity of Optimal K-Anonymity. PODS 2004: 223-228 | |
| 26 | Adam Meyerson: Online algorithms for network design. SPAA 2004: 275-280 | |
| 25 | Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. STOC 2004: 166-174 | |
| 24 | Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin: A k-Median Algorithm with Running Time Independent of Data Size. Machine Learning 56(1-3): 61-87 (2004) | |
| 23 | Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit: Local Search Heuristics for k-Median and Facility Location Problems. SIAM J. Comput. 33(3): 544-562 (2004) | |
| 2003 | ||
| 22 | Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff: Approximation Algorithms for Orienteering and Discounted-Reward TSP. FOCS 2003: 46-55 | |
| 21 | Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman: Designing overlay multicast networks for streaming. SPAA 2003: 149-158 | |
| 20 | Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson: Online oblivious routing. SPAA 2003: 44-49 | |
| 19 | Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy: Representing Graph Metrics with Fewest Edges. STACS 2003: 355-366 | |
| 18 | Baruch Awerbuch, Yossi Azar, Adam Meyerson: Reducing truth-telling online mechanisms to online optimization. STOC 2003: 503-510 | |
| 17 | Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan: Clustering Data Streams: Theory and Practice. IEEE Trans. Knowl. Data Eng. 15(3): 515-528 (2003) | |
| 16 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms 48(2): 429-440 (2003) | |
| 2002 | ||
| 15 | Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani, Nina Mishra, Sudipto Guha: Streaming-Data Algorithms for High-Quality Clustering. ICDE 2002: 685- | |
| 2001 | ||
| 14 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin: Designing Networks Incrementally. FOCS 2001: 406-415 | |
| 13 | Adam Meyerson: Online Facility Location. FOCS 2001: 426-431 | |
| 12 | Rishi Bhargava, Ashish Goel, Adam Meyerson: Using approximate majorization to characterize protocol fairness. SIGMETRICS/Performance 2001: 330-331 | |
| 11 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin: Web caching using access statistics. SODA 2001: 354-363 | |
| 10 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Approximate majorization and fair online load balancing. SODA 2001: 384-390 | |
| 9 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Distributed admission control, scheduling, and routing with stale information. SODA 2001: 611-619 | |
| 8 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: Improved algorithms for fault tolerant facility location. SODA 2001: 636-641 | |
| 7 | Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit: Local search heuristic for k-median and facility location problems. STOC 2001: 21-29 | |
| 6 | Adam Meyerson: Profit-earning facility location. STOC 2001: 30-36 | |
| 5 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: A constant factor approximation for the single sink edge installation problems. STOC 2001: 383-388 | |
| 4 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Combining Fairness with Throughput: Online Routing with Multiple Objectives. J. Comput. Syst. Sci. 63(1): 62-79 (2001) | |
| 2000 | ||
| 3 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: Hierarchical Placement and Network Design Problems. FOCS 2000: 603-612 | |
| 2 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin: Cost-Distance: Two Metric Network Design. FOCS 2000: 624-630 | |
| 1 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Combining fairness with throughput: online routing with multiple objectives. STOC 2000: 670-679 | |