Journals in DBLP

J. ACM
2002, volume: 49, number: 5

1. Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham
   Truth revelation in approximately efficient combinatorial auctions. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:5, pp:577-602 [Journal]
   
2. Daniel H. Huson, Knut Reinert, Eugene W. Myers
   The greedy path-merging algorithm for contig scaffolding. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:5, pp:603-615 [Journal]
   
3. Jon M. Kleinberg, Éva Tardos
   Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:5, pp:616-639 [Journal]
   
4. Steven S. Seiden
   On the online bin packing problem. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:5, pp:640-671 [Journal]
   
5. Rajeev Alur, Thomas A. Henzinger, Orna Kupferman
   Alternating-time temporal logic. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:5, pp:672-713 [Journal]