Volume 1,
Number 1,
July 2005
- Harold N. Gabow:
Editor's foreword.
1
- Raphael Yuster, Uri Zwick:
Fast sparse matrix multiplication.
2-13
- Jeff Edmonds, Kirk Pruhs:
A maiden analysis of longest wait first.
14-32
- Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs.
33-47
- Micah Adler, Dan Rubenstein:
Pricing multicasting in more flexible network models.
48-73
- Guy Even, Guy Kortsarz, Wolfgang Slany:
On network design problems: fixed cost flows and the covering steiner problem.
74-101
- Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup:
Black box for constant-time insertion in priority queues (note).
102-106
- Doratha E. Drake Vinkemeier, Stefan Hougardy:
A linear-time approximation algorithm for weighted matchings in graphs.
107-122
- Peter J. Grabner, Clemens Heuberger, Helmut Prodinger, Jörg M. Thuswaldner:
Analysis of linear combination algorithms in cryptography.
123-142
- Katarína Cechlárová, Tamás Fleiner:
On a generalization of the stable roommates problem.
143-156
- Samir Khuller:
Problems column.
157-159
- David S. Johnson:
The NP-completeness column.
160-176
Volume 1,
Number 2,
October 2005
Copyright © Sun Nov 15 06:01:33 2009
by Michael Ley (ley@uni-trier.de)
