Journal: Algorithmica

Volume 40, Issue 4

217 -- 0Stefano Leonardi. Preface
219 -- 234Uriel Feige, László Lovász, Prasad Tetali. Approximating Min Sum Set Cover
235 -- 244Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale. Sum Coloring of Bipartite Graphs with Bounded Degree
245 -- 269Chaitanya Swamy, Amit Kumar. Primal-Dual Algorithms for Connected Facility Location Problems
271 -- 291Spyros Angelopoulos, Allan Borodin. The Power of Priority Algorithms for Facility Location and Set Cover
293 -- 304Liane Lewin-Eytan, Joseph Naor, Ariel Orda. Admission Control in Networks with Advance Reservations
305 -- 318Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha. Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
319 -- 329Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie. On-Line Dial-a-Ride Problems Under a Restricted Information Model

Volume 40, Issue 3

147 -- 160Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian. Pattern Matching for Sets of Segments
161 -- 172Jianbo Qian, Cao An Wang. A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons
173 -- 187Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi. Multidimensional Cube Packing
189 -- 210Sanjeev Arora, Kevin L. Chang. Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems
211 -- 215Erik D. Demaine, Mohammad Taghi Hajiaghayi. Diameter and Treewidth in Minor-Closed Graph Families, Revisited

Volume 40, Issue 2

63 -- 82Evanthia Papadopoulou. The Hausdorff Voronoi Diagram of Point Clusters in the Plane
83 -- 97Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj. Using Nondeterminism to Design Efficient Deterministic Algorithms
99 -- 117Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa. A Conjecture on Wiener Indices in Combinatorial Chemistry
119 -- 132Enrico Nardelli, Guido Proietti, Peter Widmayer. Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures
133 -- 145Marcin Peczarski. New Results in Minimum-Comparison Sorting

Volume 40, Issue 1

1 -- 14Mirela Damian, Sriram V. Pemmaraju. Computing Optimal Diameter-Bounded Polygon Partitions
15 -- 31Vida Dujmovic, Sue Whitesides. An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
33 -- 50Giovanni Manzini, Paolo Ferragina. Engineering a Lightweight Suffix Array Construction Algorithm
51 -- 62Franziska Berger, Peter Gritzmann, Sven de Vries. Minimum Cycle Bases for Network Graphs