Journals in DBLP

SIAM J. Discrete Math.
2001, volume: 15, number: 1

1. Miguel Angel Fiol, Ernest Garriga
   An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:1-13 [Journal]
   
2. Tim Blackmore, Graham H. Norton
   Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:14-40 [Journal]
   
3. Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
   On the Distributed Complexity of Computing Maximal Matchings. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:41-57 [Journal]
   
4. Noga Alon, Benny Sudakov, Uri Zwick
   Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:58-72 [Journal]
   
5. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
   Neighborhood Preserving Hashing and Approximate Queries. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:73-85 [Journal]
   
6. Hong Wang
   On Covering a Bipartite Graph with Cycles. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:86-96 [Journal]
   
7. Alexander Zelikovsky, Ion I. Mandoiu
   Practical Approximation Algorithms for Zero- and Bounded-Skew Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:97-111 [Journal]
   
8. Jean-Paul Doignon, Samuel Fiorini
   Facets of the Weak Order Polytope Derived from the Induced Partition Projection. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:112-121 [Journal]
   
9. Josselin Garnier, Leila Kallel
   Efficiency of Local Search with Multiple Local Optima. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:122-141 [Journal]