Abstract is missing.
- On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree ProblemsSpyros Angelopoulos. 1-12 [doi]
- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with ApplicationsReuven Bar-Yehuda, Danny Hermelin, Dror Rawitz. 13-24 [doi]
- Price Fluctuations: To Buy or to RentMarcin Bienkowski. 25-36 [doi]
- Approximation Algorithms for Multiple Strip PackingMarin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram. 37-48 [doi]
- Approximating Frequent Items in Asynchronous Data Stream over a Sliding WindowHo-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting. 49-61 [doi]
- Longest Wait First for Broadcast Scheduling [Extended Abstract]Chandra Chekuri, Sungjin Im, Benjamin Moseley. 62-74 [doi]
- The Routing Open Shop Problem: New Approximation AlgorithmsIlya Chernykh, Nikita Dryuck, Alexander Kononov, Sergey Sevastyanov. 75-85 [doi]
- On the Price of Stability for Undirected Network DesignGeorge Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee. 86-97 [doi]
- Finding Dense Subgraphs in ::::G::::(::::n::::, 1/2)Atish Das Sarma, Amit Deshpande, Ravi Kannan. 98-103 [doi]
- Parameterized Analysis of Paging and List Update AlgorithmsReza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz. 104-115 [doi]
- Online Scheduling of Bounded Length Jobs to Maximize ThroughputChristoph Dürr, Lukasz Jez, Nguyen Kim Thang. 116-127 [doi]
- On the Additive Constant of the ::::k::::-Server Work Function AlgorithmYuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén. 128-134 [doi]
- A (4 + ::::epsilon::::)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk GraphsThomas Erlebach, Matús Mihalák. 135-146 [doi]
- Guard Games on Graphs: Keep the Intruder Out!Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov. 147-158 [doi]
- Between a Rock and a Hard Place: The Two-to-One Assignment ProblemDries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger. 159-169 [doi]
- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded WidthElisabeth Günther, Felix G. König, Nicole Megow. 170-181 [doi]
- Online Minimization Knapsack ProblemXin Han, Kazuhisa Makino. 182-193 [doi]
- Optimization Problems in Multiple Subtree GraphsDanny Hermelin, Dror Rawitz. 194-204 [doi]
- Multi-Criteria TSP: Min and Max CombinedBodo Manthey. 205-216 [doi]
- Packet Routing: Complexity and AlgorithmsBritta Peis, Martin Skutella, Andreas Wiese. 217-228 [doi]
- Minimal Cost Reconfiguration of Data Placement in Storage Area NetworkHadas Shachnai, Gal Tamir, Tami Tamir. 229-241 [doi]
- Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin PackingPrudence W. H. Wong, Fencol C. C. Yung. 242-254 [doi]