Journals in DBLP

SIAM J. Discrete Math.
1990, volume: 3, number: 3

1. Kenneth A. Berman, Mokhtar H. Konsowa
   Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:3, pp:311-319 [Journal]
   
2. Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma
   On the Structure of Minimum-Weight k-Connected Spanning Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:3, pp:320-329 [Journal]
   
3. Nader H. Bshouty, Gadiel Seroussi
   Generalizations of the Normal Basis Theorem of Finite Fields. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:3, pp:330-337 [Journal]
   
4. John Cremona, Susan Landau
   Shrinking Lattice Polyhedra. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:3, pp:338-348 [Journal]
   
5. Ding-Zhu Du, Frank K. Hwang
   Optimal Assembly of an s-Stage k-OUT-OF-n System. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:3, pp:349-354 [Journal]
   
6. Peter Frankl
   Canonical Antichains on the Circle and Applications. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:3, pp:355-363 [Journal]
   
7. Gholamreza B. Khosrovshahi, S. Ajoodani-Namini
   A New Basis for Trades. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:3, pp:364-372 [Journal]
   
8. Daniel J. Kleitman, Rakesh Vohra
   Computing the Bandwidth of Interval Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:3, pp:373-375 [Journal]
   
9. Shlomo Moran, Yaron Wolfstahl
   One-Page Book Embedding Under Vertex-Neighborhood Constraints. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:3, pp:376-390 [Journal]
   
10. Takao Nishizeki, Kenichi Kashiwagi
    On the 1.1 Edge-Coloring of Multigraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:391-0 [Journal]
    
11. Hanif D. Sherali, Warren P. Adams
    A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:411-430 [Journal]
    
12. Cun-Quan Zhang
    Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:431-438 [Journal]