Journals in DBLP

ACM Transactions on Algorithms
2006, volume: 2, number: 2

1. James F. Korsh, Paul LaFollette
   A loopless Gray code for rooted trees. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:2, pp:135-152 [Journal]
   
2. Noga Alon, Dana Moshkovitz, Shmuel Safra
   Algorithmic construction of sets for k-restrictions. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:2, pp:153-177 [Journal]
   
3. Lap Chi Lau
   Bipartite roots of graphs. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:2, pp:178-208 [Journal]
   
4. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun
   Efficient algorithms for bichromatic separability. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:2, pp:209-227 [Journal]
   
5. Leah Epstein, Rob van Stee
   This side up! [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:2, pp:228-243 [Journal]
   
6. Yumei Huo, Joseph Y.-T. Leung
   Minimizing mean flow time for UET tasks. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:2, pp:244-262 [Journal]
   
7. Refael Hassin, Danny Segev
   Robust subgraphs for trees and paths. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:2, pp:263-281 [Journal]
   
8. Yossi Azar, Yossi Richter
   An improved algorithm for CIOQ switches. [Citation Graph (0, 0)][DBLP]
   ACM Transactions on Algorithms, 2006, v:2, n:2, pp:282-295 [Journal]