Journals in DBLP
Miklós Ajtai , Nimrod Megiddo , Orli Waarts Improved Algorithms and Analysis for Secretary Problems and Generalizations. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:1-27 [Journal ] John P. Georges , David W. Mauro , Melanie I. Stein Labeling Products of Complete Graphs with a Condition at Distance Two. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:28-35 [Journal ] Mike A. Steel Sufficient Conditions for Two Tree Reconstruction Techniques to Succeed on Sufficiently Long Sequences. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:36-48 [Journal ] David Hartvigsen Compact Representations of Cuts. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:49-66 [Journal ] Leslie Ann Goldberg , Mike Paterson , Aravind Srinivasan , Elizabeth Sweedyk Better Approximation Guarantees for Job-Shop Scheduling. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:67-92 [Journal ] Nicholas Pippenger Enumeration of Equicolorable Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:93-115 [Journal ] Michael Naatz A Note on a Question of C. D. Savage. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:116-120 [Journal ] Hikoe Enomoto , Mirko Hornák , Stanislav Jendrol Cyclic Chromatic Number of 3-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:121-137 [Journal ] Michel X. Goemans Approximate Edge Splitting. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:138-141 [Journal ]