Abstract is missing.
- Distributed Decision Problems: The Locality AngleShay Kutten. 1-5 [doi]
- Managing Power HeterogeneityKirk Pruhs. 6-7 [doi]
- The Mathematics of MobilityPaolo Santi. 8 [doi]
- Speed Scaling to Manage TemperatureLeon Atkins, Guillaume Aupy, Daniel Cole, Kirk Pruhs. 9-20 [doi]
- Alternative Route Graphs in Road NetworksRoland Bader, Jonathan Dees, Robert Geisberger, Peter Sanders. 21-32 [doi]
- Robust Line Planning in Case of Multiple Pools and DisruptionsApostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis. 33-44 [doi]
- Exact Algorithms for Intervalizing Colored GraphsHans L. Bodlaender, Johan M. M. van Rooij. 45-56 [doi]
- ::::L::::(2, 1)-Labeling of Unigraphs - (Extended Abstract)Tiziana Calamoneri, Rossella Petreschi. 57-68 [doi]
- Energy-Efficient Due Date SchedulingHo-Leung Chan, Tak Wah Lam, Rongbin Li. 69-80 [doi]
- Go with the Flow: The Direction-Based Fréchet Distance of Polygonal CurvesMark de Berg, Atlas F. Cook. 81-91 [doi]
- A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World GraphsPierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino. 92-103 [doi]
- Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect PairsBritta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann. 104-115 [doi]
- On Greedy and Submodular MatricesUlrich Faigle, Walter Kern, Britta Peis. 116-126 [doi]
- MIP Formulations for Flowshop Scheduling with Limited BuffersJanick V. Frasch, Sven Oliver Krumke, Stephan Westphal. 127-138 [doi]
- A Scenario-Based Approach for Robust Linear OptimizationMarc Goerigk, Anita Schöbel. 139-150 [doi]
- Conflict Propagation and Component Recursion for Canonical LabelingTommi A. Junttila, Petteri Kaski. 151-162 [doi]
- 3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel SizeIyad A. Kanj, Fenghui Zhang. 163-174 [doi]
- Improved Taxation Rate for Bin Packing GamesWalter Kern, Xian Qiu. 175-180 [doi]
- Multi-channel Assignment for Communication in Radio NetworksDariusz R. Kowalski, Mariusz A. Rokicki. 181-192 [doi]
- Computing Strongly Connected Components in the Streaming ModelLuigi Laura, Federico Santaroni. 193-205 [doi]
- Improved Approximation Algorithms for the Max-Edge Coloring ProblemGiorgio Lucarelli, Ioannis Milis. 206-216 [doi]
- New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths ApproachesUlrich Meyer, Andrei Negoescu, Volker Weichert. 217-228 [doi]
- An Approximative Criterion for the Potential of Energetic ReasoningTimo Berthold, Stefan Heinz, Jens Schulz. 229-239 [doi]
- Speed Scaling for Energy and Performance with Instantaneous ParallelismHongyang Sun, Yuxiong He, Wen-Jing Hsu. 240-251 [doi]
- Algorithms for Scheduling with Power Control in Wireless NetworksTigran Tonoyan. 252-263 [doi]