The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorica
1986, volume: 6, number: 1

  1. László Babai
    On Lovász' lattice reduction and the nearest lattice point problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:1-13 [Journal]
  2. Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald
    The asymptotic number of acyclic diagraphs I. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:15-22 [Journal]
  3. Mostafa Blidia
    A parity diagraph has a kernel. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:23-27 [Journal]
  4. Ulrich Faigle, Bill Sands
    A size-width inequality for distributive lattices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:29-33 [Journal]
  5. Richard M. Karp, Eli Upfal, Avi Wigderson
    Constructing a perfect matching is in random NC. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:35-48 [Journal]
  6. Nathan Linial
    Legal coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:49-54 [Journal]
  7. Joel Spencer
    Balancing vectors in the max norm. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:55-66 [Journal]
  8. Mario Szegedy
    The solution of Graham's greatest common divisor problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:67-71 [Journal]
  9. Ioan Tomescu
    On the number of paths and cycles for almost all graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:73-79 [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