The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Discrete Math.
1999, volume: 12, number: 4

  1. Anders Björner, Volkmar Welker
    Complexes of Directed Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:413-424 [Journal]
  2. Balaji Raghavachari, Jeyakesavan Veerasamy
    A 3/2-Approximation Algorithm for the Mixed Postman Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:425-433 [Journal]
  3. Bernhard Gittenberger
    On the Contour of Random Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:434-458 [Journal]
  4. Cyril Gavoille, David Peleg
    The Compactness of Interval Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:459-473 [Journal]
  5. Meena Mahajan, V. Vinay
    Determinant: Old Algorithms, New Insights. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:474-490 [Journal]
  6. Ko-Wei Lih, Daphne Der-Fen Liu, Xuding Zhu
    Star Extremal Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:491-499 [Journal]
  7. William W. Hager, Yaroslav Krylyuk
    Graph Partitioning and Continuous Quadratic Programming. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:500-523 [Journal]
  8. Samit Dasgupta
    On the Size of Minimum Super Arrovian Domains. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:524-534 [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