The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Discrete Math.
2000, volume: 13, number: 3

  1. Michel X. Goemans, David P. Williamson
    Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:281-294 [Journal]
  2. Martín Cera, Ana Diánez, Alberto Márquez
    The Size of a Graph Without Topological Complete Subgraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:295-301 [Journal]
  3. Peter L. Hammer, Alexander Kogan, Uriel G. Rothblum
    Evaluation, Strength, and Relevance of Variables of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:302-312 [Journal]
  4. Till Nierhoff
    A Tight Bound on the Irregularity Strength of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:313-323 [Journal]
  5. Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz
    Computing Functions of a Shared Secret. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:324-345 [Journal]
  6. Ljiljana Brankovic, Peter Horák, Mirka Miller
    An Optimization Problem in Statistical Databases. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:346-353 [Journal]
  7. Michael Naatz
    The Graph of Linear Extensions Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:354-369 [Journal]
  8. Bala Kalyanasundaram, Kirk Pruhs
    The Online Transportation Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:370-383 [Journal]
  9. Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
    Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:384-402 [Journal]
  10. Samir Khuller, Yoram J. Sussmann
    The Capacitated K-Center Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:403-418 [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