
Journals in DBLP
 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:135152 [Journal]
 Noga Alon, Dana Moshkovitz, Shmuel Safra
Algorithmic construction of sets for krestrictions. [Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:2, pp:153177 [Journal]
 Lap Chi Lau
Bipartite roots of graphs. [Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:2, pp:178208 [Journal]
 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:209227 [Journal]
 Leah Epstein, Rob van Stee
This side up! [Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:2, pp:228243 [Journal]
 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:244262 [Journal]
 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:263281 [Journal]
 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:282295 [Journal]
