4. AAIM 2008: Shanghai, China

• Ding-Zhu Du:
  Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. 1
  Electronic Edition (link) BibTeX
• Vijay V. Vazirani:
  Nash Bargaining Via Flexible Budget Markets. 2
  Electronic Edition (link) BibTeX
• Eric Angel, Evripidis Bampis, Laurent Gourvès:
  On the Minimum Hitting Set of Bundles Problem. 3-14
  Electronic Edition (link) BibTeX
• Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
  Speed Scaling with a Solar Cell. 15-26
  Electronic Edition (link) BibTeX
• Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner:
  Engineering Label-Constrained Shortest-Path Algorithms. 27-37
  Electronic Edition (link) BibTeX
• Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi:
  New Upper Bounds on Continuous Tree Edge-Partition Problem. 38-49
  Electronic Edition (link) BibTeX
• Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
  A Meeting Scheduling Problem Respecting Time and Space. 50-59
  Electronic Edition (link) BibTeX
• Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
  Fixed-Parameter Algorithms for Kemeny Scores. 60-71
  Electronic Edition (link) BibTeX
• Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie:
  The Distributed Wireless Gathering Problem. 72-83
  Electronic Edition (link) BibTeX
• Zhi-Zhong Chen, Ruka Tanahashi:
  Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement. 84-96
  Electronic Edition (link) BibTeX
• Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
  An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. 97-108
  Electronic Edition (link) BibTeX
• Yam Ki Cheung, Ovidiu Daescu:
  Line Facility Location in Weighted Regions. 109-119
  Electronic Edition (link) BibTeX
• Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert:
  Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. 120-130
  Electronic Edition (link) BibTeX
• Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner:
  Engineering Comparators for Graph Clusterings. 131-142
  Electronic Edition (link) BibTeX
• Danny Dyer, Boting Yang, Öznur Yasar:
  On the Fast Searching Problem. 143-154
  Electronic Edition (link) BibTeX
• Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki:
  Confidently Cutting a Cake into Approximately Fair Pieces. 155-164
  Electronic Edition (link) BibTeX
• Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
  Copeland Voting Fully Resists Constructive Control. 165-176
  Electronic Edition (link) BibTeX
• Piotr Faliszewski, Lane A. Hemaspaandra:
  The Complexity of Power-Index Comparison. 177-187
  Electronic Edition (link) BibTeX
• Michael R. Fellows, Henning Fernau:
  Facility Location Problems: A Parameterized View. 188-199
  Electronic Edition (link) BibTeX
• Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack:
  Shortest Path Queries in Polygonal Domains. 200-211
  Electronic Edition (link) BibTeX
• Zeyu Guo, He Sun, Hong Zhu:
  A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. 212-223
  Electronic Edition (link) BibTeX
• Gregory Gutin, Arash Rafiey, Anders Yeo:
  Minimum Cost Homomorphism Dichotomy for Oriented Cycles. 224-234
  Electronic Edition (link) BibTeX
• Gregory Gutin, Igor Razgon, Eun Jung Kim:
  Minimum Leaf Out-Branching Problems. 235-246
  Electronic Edition (link) BibTeX
• Stéphane Le Roux:
  Graphs and Path Equilibria. 247-258
  Electronic Edition (link) BibTeX
• Hanno Lefmann:
  No lGrid-Points in Spaces of Small Dimension. 259-270
  Electronic Edition (link) BibTeX
• Leo Liberti, Franco Raimondi:
  The Secret Santa Problem. 271-279
  Electronic Edition (link) BibTeX
• Shieu-Hong Lin:
  Finding Optimal Refueling Policies in Transportation Networks. 280-291
  Electronic Edition (link) BibTeX
• Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe:
  Scale Free Interval Graphs. 292-303
  Electronic Edition (link) BibTeX
• Sadish Sadasivam, Huaming Zhang:
  On Representation of Planar Graphs by Segments. 304-315
  Electronic Edition (link) BibTeX
• Tianping Shuai, Donglei Du, Xiaoyue Jiang:
  An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the l_p Norm. 316-327
  Electronic Edition (link) BibTeX
• Feifeng Zheng, E. Zhang, Yinfeng Xu, Xiaoping Wu:
  An Optimal Strategy for Online Non-uniform Length Order Scheduling. 328-336
  Electronic Edition (link) BibTeX
• Yunhong Zhou, Dennis Wilkinson, Robert Schreiber, Rong Pan:
  Large-Scale Parallel Collaborative Filtering for the Netflix Prize. 337-348
  Electronic Edition (link) BibTeX