5. WAOA 2007: Eilat, Israel

• Robert Krauthgamer, Aranyak Mehta, Atri Rudra:
  Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. 1-14
  Electronic Edition (link) BibTeX
• Iftah Gamzu:
  Improved Lower Bounds for Non-utilitarian Truthfulness. 15-26
  Electronic Edition (link) BibTeX
• Nedialko B. Dimitrov, C. Greg Plaxton:
  Buyer-Supplier Games: Optimization over the Core. 27-40
  Electronic Edition (link) BibTeX
• Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger:
  Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. 41-54
  Electronic Edition (link) BibTeX
• Alexander A. Ageev:
  A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays. 55-66
  Electronic Edition (link) BibTeX
• Johann Hurink, Jacob Jan Paulus:
  Online Algorithm for Parallel Job Scheduling and Strip Packing. 67-74
  Electronic Edition (link) BibTeX
• Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
  Geometric Spanners with Small Chromatic Number. 75-88
  Electronic Edition (link) BibTeX
• Maarten Löffler, Marc J. van Kreveld:
  Approximating Largest Convex Hulls for Imprecise Points. 89-102
  Electronic Edition (link) BibTeX
• Alexander A. Ageev, Artem V. Pyatkin:
  A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. 103-115
  Electronic Edition (link) BibTeX
• Dorit S. Hochbaum, Asaf Levin:
  Covering the Edges of Bipartite Graphs Using K _{2, 2} Graphs. 116-127
  Electronic Edition (link) BibTeX
• Amitai Armon:
  On Min-Max r -Gatherings. 128-141
  Electronic Edition (link) BibTeX
• Leah Epstein, Asaf Levin:
  On the Max Coloring Problem. 142-155
  Electronic Edition (link) BibTeX
• Panagiota N. Panagopoulou, Paul G. Spirakis:
  Full and Local Information in Distributed Decision Making. 156-169
  Electronic Edition (link) BibTeX
• Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
  The Minimum Substring Cover Problem. 170-183
  Electronic Edition (link) BibTeX
• José R. Correa, Cristina G. Fernandes, Martín Matamala, Yoshiko Wakabayashi:
  A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. 184-192
  Electronic Edition (link) BibTeX
• Leah Epstein, Rob van Stee:
  On the Online Unit Clustering Problem. 193-206
  Electronic Edition (link) BibTeX
• Marek Chrobak, Mathilde Hurand:
  Better Bounds for Incremental Medians. 207-217
  Electronic Edition (link) BibTeX
• Leah Epstein, Asaf Levin:
  Minimum Weighted Sum Bin Packing. 218-231
  Electronic Edition (link) BibTeX
• Leah Epstein, Rob van Stee:
  Approximation Schemes for Packing Splittable Items with Cardinality Constraints. 232-245
  Electronic Edition (link) BibTeX
• Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec:
  A Randomized Algorithm for Two Servers in Cross Polytope Spaces. 246-259
  Electronic Edition (link) BibTeX
• Anke van Zuylen, David P. Williamson:
  Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems. 260-273
  Electronic Edition (link) BibTeX
• Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
  Online Rectangle Filling. 274-287
  Electronic Edition (link) BibTeX