The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorica
2003, volume: 23, number: 2

  1. Guantao Chen, Ronald J. Gould, Xingxing Yu
    Graph Connectivity After Path Removal. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:185-203 [Journal]
  2. Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra
    Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:205-243 [Journal]
  3. Friedrich Eisenbrand, Andreas S. Schulz
    Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:245-261 [Journal]
  4. Kevin Ford
    Maximal Collections of Intersecting Arithmetic Progressions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:263-281 [Journal]
  5. Grigor Gasparyan, Myriam Preissmann, András Sebö
    Imperfect and Nonideal Clutters: A Common Approach. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:283-302 [Journal]
  6. André E. Kézdy, Jenö Lehel, Robert C. Powers
    Heavy Transversals and Indecomposable Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:303-310 [Journal]
  7. Jeong Han Kim, Van H. Vu
    Small Complete Arcs in Projective Planes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:311-363 [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