
Journals in DBLP
 Miguel Angel Fiol, Ernest Garriga
An Algebraic Characterization of Completely Regular Codes in DistanceRegular Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2001, v:15, n:1, pp:113 [Journal]
 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:1440 [Journal]
 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:4157 [Journal]
 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:5872 [Journal]
 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:7385 [Journal]
 Hong Wang
On Covering a Bipartite Graph with Cycles. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2001, v:15, n:1, pp:8696 [Journal]
 Alexander Zelikovsky, Ion I. Mandoiu
Practical Approximation Algorithms for Zero and BoundedSkew Trees. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2001, v:15, n:1, pp:97111 [Journal]
 JeanPaul 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:112121 [Journal]
 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:122141 [Journal]
