ACM Transactions on Algorithms, Volume 1

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

• Svante Janson:
  Individual displacements for linear probing hashing with different insertion policies. 177-213
  
• Alfredo Viola:
  Exact distribution of individual displacements in linear probing hashing. 214-242
  
• Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
  Maintaining information in fully dynamic trees with top trees. 243-264
  
• Raja Jothi, Balaji Raghavachari:
  Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. 265-282
  
• Michael Elkin:
  Computing almost shortest paths. 283-323
  
• Marcelo H. de Carvalho, Joseph Cheriyan:
  An O(VE) algorithm for ear decompositions of matching-covered graphs. 324-337
  
• Ashish Goel, Adam Meyerson, Serge A. Plotkin:
  Approximate majorization and fair online load balancing. 338-349
  
• Marek Chrobak, Petr Kolman, Jiri Sgall:
  The greedy algorithm for the minimum common string partition problem. 350-366
  

Last update Tue May 21 19:39:32 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page