3. WAOA 2005: Palma de Mallorca, Spain

• David J. Abraham, Péter Biró, David Manlove:
  "Almost Stable" Matchings in the Roommates Problem. 1-14
  
• Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav:
  On the Minimum Load Coloring Problem. 15-26
  
• Adi Avidor, Ido Berkovitch, Uri Zwick:
  Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. 27-40
  
• Yossi Azar, Amir Epstein:
  The Hardness of Network Design for Unsplittable Flow with Selfish Users. 41-54
  
• Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz:
  Improved Approximation Algorithm for Convex Recoloring of Trees. 55-68
  
• Reuven Bar-Yehuda, Jonathan Laserson:
  Exploiting Locality: Approximating Sorting Buffers. 69-81
  
• Markus Bläser, L. Shankar Ram:
  Approximate Fair Cost Allocation in Metric Traveling Salesman Games. 82-95
  
• Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
  Rounding of Sequences and Matrices, with Applications. 96-109
  
• Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger:
  A Note on Semi-online Machine Covering. 110-118
  
• Leah Epstein, Asaf Levin:
  SONET ADMs Minimization with Divisible Paths. 119-132
  
• Leah Epstein, Asaf Levin:
  The Conference Call Search Problem in Wireless Networks. 133-146
  
• Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre:
  Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents. 147-160
  
• Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
  Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. 161-175
  
• Toshihiro Fujito, Hidekazu Kurahashi:
  A Better-Than-Greedy Algorithm for k-Set Multicover. 176-189
  
• Elisabeth Gassner, Sven Oliver Krumke:
  Deterministic Online Optical Call Admission Revisited. 190-202
  
• Alexander Grigoriev, Marc Uetz:
  Scheduling Parallel Jobs with Linear Speedup. 203-215
  
• Xin Han, Kazuo Iwama, Guochuan Zhang:
  Online Removable Square Packing. 216-229
  
• Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld:
  The Online Target Date Assignment Problem. 230-243
  
• Ronald Koch, Martin Skutella, Ines Spenke:
  Approximation and Complexity of k-Splittable Flows. 244-257
  
• Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Leen Stougie:
  On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem. 258-269
  
• Zvi Gotthilf, Moshe Lewenstein:
  Tighter Approximations for Maximum Induced Matchings in Regular Graphs. 270-281
  
• Bodo Manthey:
  On Approximating Restricted Cycle Covers. 282-295
  
• Tim Nieberg, Johann Hurink:
  A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. 296-306
  
• Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
  Speed Scaling of Tasks with Precedence Constraints. 307-319
  
• Asaf Levin, Danny Segev:
  Partial Multicuts in Trees. 320-333
  
• Hadas Shachnai, Tami Tamir, Omer Yehezkely:
  Approximation Schemes for Packing with Item Fragmentation. 334-347