Volume 61, Issue 1

Search all Algorithmica articles

September 2011

Special Issue: European Symposium on Algorithms, Design and Analysis

Issue Editor:

Amos Fiat

12 articles in this issue

Special Issue: European Symposium on Algorithms, Design and Analysis
Amos Fiat
EditorialNotes 15 May 2011 Pages: 1 - 2
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Markus Bläser
Christian Hoffmann
OriginalPaper 06 August 2010 Pages: 3 - 35
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
Andrzej Lingas
OriginalPaper 14 September 2010 Pages: 36 - 50
On Optimally Partitioning a Text to Improve Its Compression
Paolo Ferragina
Igor Nitto
Rossano Venturini
OriginalPaper 07 August 2010 Pages: 51 - 74
Approximability of Sparse Integer Programs
David Pritchard
Deeparnab Chakrabarty
OriginalPaper 21 July 2010 Pages: 75 - 93
Piercing Translates and Homothets of a Convex Body
Adrian Dumitrescu
Minghui Jiang
OriginalPaper 27 April 2010 Pages: 94 - 115
On the Performance of Approximate Equilibria in Congestion Games
George Christodoulou
Elias Koutsoupias
Paul G. Spirakis
OriginalPaper 15 September 2010 Pages: 116 - 140
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
Yuval Emek
OriginalPaper 25 June 2010 Pages: 141 - 160
Dynamic vs. Oblivious Routing in Network Design
Navin Goyal
Neil Olver
F. Bruce Shepherd
OriginalPaper 28 September 2010 Pages: 161 - 173
Maximum Flow in Directed Planar Graphs with Vertex Capacities
Haim Kaplan
Yahav Nussbaum
OriginalPaper 03 August 2010 Pages: 174 - 189
Improved Approximation Algorithms for Label Cover Problems
Moses Charikar
MohammadTaghi Hajiaghayi
Howard Karloff
OriginalPaper 03 February 2011 Pages: 190 - 206
Geometric Spanners for Weighted Point Sets
Mohammad Ali Abam
Mark de Berg
Michiel Smid
OriginalPaper Open access 04 November 2010 Pages: 207 - 225

Volume 61, Issue 1

Search

Navigation