Journals in DBLP

SIAM J. Discrete Math.
1991, volume: 4, number: 1

1. James Abello
   The Weak Bruhat Order of S_Sigma, Consistent Sets, and Catalan Numbers. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1991, v:4, n:1, pp:1-16 [Journal]
   
2. Daniel Bienstock, Ervin Györi
   An Extremal Problem on Sparse 0-1 Matrices. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1991, v:4, n:1, pp:17-27 [Journal]
   
3. Maurizio A. Bonuccelli
   A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1991, v:4, n:1, pp:28-35 [Journal]
   
4. Benny Chor, Eyal Kushilevitz
   A Zero-One Law for Boolean Privacy. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1991, v:4, n:1, pp:36-47 [Journal]
   
5. Edward G. Coffman Jr., Peter W. Shor
   A Simple Proof of the O(sqrt(n log^3/4 n) Upright Matching Bound. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1991, v:4, n:1, pp:48-57 [Journal]
   
6. Philippe Flajolet, Michèle Soria
   The Cycle Construction. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1991, v:4, n:1, pp:58-60 [Journal]
   
7. Donald K. Friesen, Michael A. Langston
   Analysis of a Compound bin Packing Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1991, v:4, n:1, pp:61-79 [Journal]
   
8. Hortensia Galeana-Sánchez, L. Pastrana Ramírez, H. A. Rincón-Mejía
   Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1991, v:4, n:1, pp:80-83 [Journal]
   
9. Toshihide Ibaraki, Svatopluk Poljak
   Weak Three-Linking in Eulerian Digraphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1991, v:4, n:1, pp:84-98 [Journal]
   
10. Daniel J. Kleitman, Douglas B. West
    Spanning Trees with Many Leaves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:99-106 [Journal]
    
11. Tomasz Luczak, Andrzej Rucinski
    Tree-Matchings in Graph Processes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:107-120 [Journal]
    
12. Nicholas Pippenger
    The Expected Capacity of Concentrators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:121-129 [Journal]
    
13. Alexander Schrijver
    Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:130-138 [Journal]
    
14. Roberto Tamassia, Ioannis G. Tollis
    Representations of Graphs on a Cylinder. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:139-149 [Journal]