Journal: Algorithmica

Volume 61, Issue 1

1 -- 2Amos Fiat. Special Issue: European Symposium on Algorithms, Design and Analysis
3 -- 35Markus Bläser, Christian Hoffmann. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
36 -- 50Andrzej Lingas. A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
51 -- 74Paolo Ferragina, Igor Nitto, Rossano Venturini. On Optimally Partitioning a Text to Improve Its Compression
94 -- 115Adrian Dumitrescu, Minghui Jiang. Piercing Translates and Homothets of a Convex Body
116 -- 140George Christodoulou, Elias Koutsoupias, Paul G. Spirakis. On the Performance of Approximate Equilibria in Congestion Games
141 -- 160Yuval Emek. ::::k::::-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
161 -- 173Navin Goyal, Neil Olver, F. Bruce Shepherd. Dynamic vs. Oblivious Routing in Network Design
174 -- 189Haim Kaplan, Yahav Nussbaum. Maximum Flow in Directed Planar Graphs with Vertex Capacities
190 -- 206Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff. Improved Approximation Algorithms for Label Cover Problems
207 -- 225Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid. Geometric Spanners for Weighted Point Sets