Journals in DBLP

ACM Transactions on Algorithms
2005, volume: 1, number: 1

1. Harold N. Gabow
   Editor's foreword. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2005, v:1, n:1, pp:1- [Journal]
   
2. Raphael Yuster, Uri Zwick
   Fast sparse matrix multiplication. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2005, v:1, n:1, pp:2-13 [Journal]
   
3. Jeff Edmonds, Kirk Pruhs
   A maiden analysis of longest wait first. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2005, v:1, n:1, pp:14-32 [Journal]
   
4. 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. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2005, v:1, n:1, pp:33-47 [Journal]
   
5. Micah Adler, Dan Rubenstein
   Pricing multicasting in more flexible network models. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2005, v:1, n:1, pp:48-73 [Journal]
   
6. Guy Even, Guy Kortsarz, Wolfgang Slany
   On network design problems: fixed cost flows and the covering steiner problem. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2005, v:1, n:1, pp:74-101 [Journal]
   
7. Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup
   Black box for constant-time insertion in priority queues (note). [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2005, v:1, n:1, pp:102-106 [Journal]
   
8. Doratha E. Drake Vinkemeier, Stefan Hougardy
   A linear-time approximation algorithm for weighted matchings in graphs. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2005, v:1, n:1, pp:107-122 [Journal]
   
9. Peter J. Grabner, Clemens Heuberger, Helmut Prodinger, Jörg M. Thuswaldner
   Analysis of linear combination algorithms in cryptography. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2005, v:1, n:1, pp:123-142 [Journal]
   
10. Katarína Cechlárová, Tamás Fleiner
    On a generalization of the stable roommates problem. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:143-156 [Journal]
    
11. Samir Khuller
    Problems column. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:157-159 [Journal]
    
12. David S. Johnson
    The NP-completeness column. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:160-176 [Journal]