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

Volume 57, Issue 3

436 -- 461Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis. Boundary Labeling with Octilinear Leaders
462 -- 483Erik D. Demaine, Stefan Langerman, Eric Price. Confluently Persistent Tries for Efficient Version Control
484 -- 498Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan. On Metric Clustering to Minimize the Sum of Radii
499 -- 516Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno. Improved Bounds for Wireless Localization
517 -- 537Yossi Azar, Uriel Feige, Daniel Glasner. A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
538 -- 561Sergey Bereg, Adrian Dumitrescu, Minghui Jiang. On Covering Problems of Rado
562 -- 584Bastian Degener, Joachim Gehweiler, Christiane Lammersen. Kinetic Facility Location

Volume 57, Issue 2

207 -- 216Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi. Computing median and antimedian sets in median graphs
217 -- 231Regant Y. S. Hung, Hing-Fung Ting. Design and Analysis of Online Batching Systems
232 -- 251Mingen Lin, Yang Yang, Jinhui Xu. Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
252 -- 283Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir. On the Planar Piecewise Quadratic 1-Center Problem
284 -- 300Nir Ailon. Aggregation of Partial Rankings, ::::p::::-Ratings and Top-::::m:::: Lists
301 -- 324Angelo Fanelli, Michele Flammini, Luca Moscardelli. On the Convergence of Multicast Games in Directed Networks
325 -- 348Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu. Approximating Tree Edit Distance through String Edit Distance
349 -- 380Eric Anderson, Joseph Hall, Jason D. Hartline, M. Hobbes, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes. Algorithms for Data Migration
381 -- 397Huaming Zhang. Planar Polyline Drawings via Graph Transformations
398 -- 412Liming Cai, Xiuzhen Huang. Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
413 -- 433Annamária Kovács. New Approximation Bounds for Lpt Scheduling

Volume 57, Issue 1

1 -- 21Henrik Blunck, Jan Vahrenhold. In-Place Algorithms for Computing (Layers of) Maxima
22 -- 43Feodor F. Dragan, Chenyu Yan. Collective Tree Spanners in Graphs with Bounded Parameters
44 -- 61Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir. Transactional Contention Management as a Non-Clairvoyant Scheduling Problem
62 -- 73Gopal Pandurangan, Wojciech Szpankowski. A Universal Online Caching Algorithm Based on Pattern Matching
74 -- 81Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu. Deciding ::::k::::-Colorability of ::::P::::::5::-Free Graphs in Polynomial Time
82 -- 96Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni. Secure Overlay Network Design
119 -- 120Benjamin Doerr, Frank Neumann, Ingo Wegener. Editorial
121 -- 146Anne Auger, Olivier Teytaud. Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms
147 -- 169Madeleine Theile, Thomas Jansen. Stability in the Self-Organized Evolution of Networks
170 -- 186Thomas Jansen, Dennis Weyland. Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
187 -- 206Joachim Reichel, Martin Skutella. Evolutionary Algorithms and Matroid Optimization Problems