Journal: Algorithmica

Volume 57, Issue 4

585 -- 620Gonzalo Navarro, Rodrigo Paredes. On Sorting, Heaps, and Minimum Spanning Trees
621 -- 640Peter Damaschke. Homogeneous String Segmentation using Trees and Weighted Independent Sets
641 -- 652Amos Korman, David Peleg, Yoav Rodeh. Constructing Labeling Schemes through Universal Matrices
653 -- 667Spyros C. Kontogiannis, Paul G. Spirakis. Well Supported Approximate Equilibria in Bimatrix Games
668 -- 688Jörg Derungs, Riko Jacob, Peter Widmayer. Approximate Shortest Paths Guided by a Small Index
689 -- 724Anne Benoit, Yves Robert. Complexity Results for Throughput and Latency Optimization of Replicated and Data-parallel Workflows
725 -- 746Susanne Albers, Tobias Jacobs. An Experimental Study of New and Known Online Packet Buffering Algorithms
747 -- 768Dániel Marx. Chordal Deletion is Fixed-Parameter Tractable
769 -- 795Hans Kellerer, Vitaly A. Strusevich. Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications
796 -- 818Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta. Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
819 -- 847Joan Boyar, Lene M. Favrholdt. Scheduling Jobs on Grid Processors
848 -- 868Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan. Broadcasting on Networks of Workstations
869 -- 872N. Innami, B.-H. Kim, Y. Mashiko, K. Shiohama. The Steiner Ratio Conjecture of Gilbert-Pollak May Still Be Open
873 -- 892Sung-woo Cho, Ashish Goel. Pricing for Fairness: Distributed Resource Allocation for Multiple Objectives