Journals in DBLP

SIAM J. Discrete Math.
1988, volume: 1, number: 3

1. Noga Alon, Yossi Azar
   Sorting, Approximate Sorting, and Searching in Rounds. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:3, pp:269-280 [Journal]
   
2. Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray
   The Complexity of Colouring by Semicomplete Digraphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:3, pp:281-298 [Journal]
   
3. Earl R. Barnes, Anthony Vannelli, James Q. Walker
   A New Heuristic for Partitioning the Nodes of a Graph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:3, pp:299-305 [Journal]
   
4. Paola Bertolazzi, Antonio Sassano
   A Class of Polynomially Solvable Set-Covering Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:3, pp:306-316 [Journal]
   
5. Alan A. Bertossi, Allessandro Gori
   Total Domination and Irredundance in Weighted Interval Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:3, pp:317-327 [Journal]
   
6. Béla Bollobás, Fan R. K. Chung
   The Diameter of a Cycle Plus a Random Matching. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:3, pp:328-333 [Journal]
   
7. Peter C. Fishburn, Helen M. Marcus-Roberts, Fred S. Roberts
   Unique Finite Difference Measurement. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:3, pp:334-354 [Journal]
   
8. János Körner, Gábor Simonyi
   Separating Partition System and Locally Different Sequences. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:3, pp:355-359 [Journal]
   
9. Carl Langenhop, William E. Wright
   Certain Occupancy Numbers via an Algorithm for Computing Their Ratios. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:3, pp:360-371 [Journal]
   
10. Svatopluk Poljak, Vojtech Rödl, Joel Spencer
    Tournament Ranking with Expected Profit in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:372-376 [Journal]
    
11. Arie Tamir
    Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:377-396 [Journal]
    
12. Gábor Tardos
    Polynomial Bound for a Chip Firing Game on Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:397-398 [Journal]
    
13. Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson
    The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:399-410 [Journal]