Abstract is missing.
- Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk GraphsDing-Zhu Du. 1 [doi]
- Nash Bargaining Via Flexible Budget MarketsVijay V. Vazirani. 2 [doi]
- On the Minimum Hitting Set of Bundles ProblemEric Angel, Evripidis Bampis, Laurent Gourvès. 3-14 [doi]
- Speed Scaling with a Solar CellNikhil Bansal, Ho-Leung Chan, Kirk Pruhs. 15-26 [doi]
- Engineering Label-Constrained Shortest-Path AlgorithmsChristopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner. 27-37 [doi]
- New Upper Bounds on Continuous Tree Edge-Partition ProblemRobert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi. 38-49 [doi]
- A Meeting Scheduling Problem Respecting Time and SpaceFlorian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi. 50-59 [doi]
- Fixed-Parameter Algorithms for Kemeny ScoresNadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond. 60-71 [doi]
- The Distributed Wireless Gathering ProblemVincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie. 72-83 [doi]
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local ImprovementZhi-Zhong Chen, Ruka Tanahashi. 84-96 [doi]
- An Improved Randomized Approximation Algorithm for Maximum Triangle PackingZhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang. 97-108 [doi]
- Line Facility Location in Weighted RegionsYam Ki Cheung, Ovidiu Daescu. 109-119 [doi]
- Algorithms for Temperature-Aware Task Scheduling in Microprocessor SystemsMarek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert. 120-130 [doi]
- Engineering Comparators for Graph ClusteringsDaniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner. 131-142 [doi]
- On the Fast Searching ProblemDanny Dyer, Boting Yang, Öznur Yasar. 143-154 [doi]
- Confidently Cutting a Cake into Approximately Fair PiecesJeff Edmonds, Kirk Pruhs, Jaisingh Solanki. 155-164 [doi]
- Copeland Voting Fully Resists Constructive ControlPiotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe. 165-176 [doi]
- The Complexity of Power-Index ComparisonPiotr Faliszewski, Lane A. Hemaspaandra. 177-187 [doi]
- Facility Location Problems: A Parameterized ViewMichael R. Fellows, Henning Fernau. 188-199 [doi]
- Shortest Path Queries in Polygonal DomainsHua Guo, Anil Maheshwari, Jörg-Rüdiger Sack. 200-211 [doi]
- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network ProblemZeyu Guo, He Sun, Hong Zhu. 212-223 [doi]
- Minimum Cost Homomorphism Dichotomy for Oriented CyclesGregory Gutin, Arash Rafiey, Anders Yeo. 224-234 [doi]
- Minimum Leaf Out-Branching ProblemsGregory Gutin, Igor Razgon, Eun Jung Kim. 235-246 [doi]
- Graphs and Path EquilibriaStéphane Le Roux. 247-258 [doi]
- No lGrid-Points in Spaces of Small DimensionHanno Lefmann. 259-270 [doi]
- The Secret Santa ProblemLeo Liberti, Franco Raimondi. 271-279 [doi]
- Finding Optimal Refueling Policies in Transportation NetworksShieu-Hong Lin. 280-291 [doi]
- Scale Free Interval GraphsNaoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe. 292-303 [doi]
- On Representation of Planar Graphs by SegmentsSadish Sadasivam, Huaming Zhang. 304-315 [doi]
- An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the l::p:: NormTianping Shuai, Donglei Du, Xiaoyue Jiang. 316-327 [doi]
- An Optimal Strategy for Online Non-uniform Length Order SchedulingFeifeng Zheng, E. Zhang, Yinfeng Xu, Xiaoping Wu. 328-336 [doi]
- Large-Scale Parallel Collaborative Filtering for the Netflix PrizeYunhong Zhou, Dennis M. Wilkinson, Robert Schreiber, Rong Pan. 337-348 [doi]