Journals in DBLP

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

1. Martin Aigner, Eberhard Triesch
   Irregular Assignments of Trees and Forests. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:4, pp:439-449 [Journal]
   
2. David Aldous
   The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:4, pp:450-465 [Journal]
   
3. E. M. Bolger
   A Characterization of an Extension of the Banzhaf Value to Multicandidate Voting Games. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:4, pp:466-477 [Journal]
   
4. Peter C. Fishburn
   Binary Probabilities Induced by Rankings. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:4, pp:478-488 [Journal]
   
5. Peter C. Fishburn
   Thicknesses of Ordered Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:4, pp:489-501 [Journal]
   
6. Martin Grötschel, Clyde L. Monma
   Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:4, pp:502-523 [Journal]
   
7. Yahya Ould Hamidoune, Ralph Tindell
   Vertex Transitivity and Super Line Connectedness. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:4, pp:524-530 [Journal]
   
8. Tung-Lin Lu, Pei-Hsin Ho, Gerard J. Chang
   The Domatic Number Problem in Interval Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:4, pp:531-536 [Journal]
   
9. Yannis Manoussakis, Zsolt Tuza
   Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1990, v:3, n:4, pp:537-543 [Journal]
   
10. Oliver Pretzel, Dale Youngs
    Cycle Lengths and Graph Orientations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:544-0 [Journal]
    
11. Vijaya Ramachandran
    A Minimax Arc Theorem for Reducible Flow Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:554-560 [Journal]
    
12. Carla D. Savage
    Generating Permutations with k-Differences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:561-573 [Journal]
    
13. Lajos Takács
    On the Number of Distinct Forests. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:574-581 [Journal]
    
14. Craig A. Tovey
    A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:582-584 [Journal]
    
15. Tai-Ching Tuan, S. Louis Hakimi
    River Routing with a Small Numer of Jogs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:585-597 [Journal]