Journals in DBLP

J. ACM
2006, volume: 53, number: 5

1. Julia Chuzhoy, Joseph Naor
   New hardness results for congestion minimization and machine scheduling. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2006, v:53, n:5, pp:707-721 [Journal]
   
2. Benny Chor, Tamir Tuller
   Finding a maximum likelihood tree is hard. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2006, v:53, n:5, pp:722-744 [Journal]
   
3. Matthew Andrews, Lisa Zhang
   Logarithmic hardness of the undirected edge-disjoint paths problem. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2006, v:53, n:5, pp:745-761 [Journal]
   
4. Daniela Pucci de Farias, Nimrod Megiddo
   Combining expert advice in reactive environments. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2006, v:53, n:5, pp:762-799 [Journal]
   
5. Harold N. Gabow
   Using expander graphs to find vertex connectivity. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2006, v:53, n:5, pp:800-844 [Journal]
   
6. Avrim Blum, Tuomas Sandholm, Martin Zinkevich
   Online algorithms for market clearing. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2006, v:53, n:5, pp:845-879 [Journal]