The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Discrete Math.
1992, volume: 5, number: 2

  1. Baruch Awerbuch, David Peleg
    Routing with Polynomial Communication-Space Trade-Off. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:151-162 [Journal]
  2. Endre Boros, Yves Crama, Peter L. Hammer
    Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:163-177 [Journal]
  3. Luisa Gargano, Ugo Vaccaro
    Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:178-198 [Journal]
  4. Grzegorz Stachowiak
    Hamilton Paths in Graphs of Linear Extensions for Unions of Posets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:199-206 [Journal]
  5. Huishan Zhou
    On the Nonmultiplicativity of Oriented Cycles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:207-218 [Journal]
  6. Danièle Gardy
    Normal Limiting Distributions for Projection and Semijoin Sizes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:219-248 [Journal]
  7. Sampath Kannan, Tandy Warnow
    Triangulating 3-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:249-258 [Journal]
  8. Richard M. Karp
    Three-Stage Generalized Connectors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:259-272 [Journal]
  9. Eyal Kushilevitz
    Privacy and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:273-284 [Journal]
  10. Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee
    An Optimal Algorithm for the Maximum Two-Chain Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:285-304 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002