The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2001, volume: 237, number: 1-3

  1. Gill Barequet
    A duality between small-face problems in arrangements of lines and Heilbronn-type problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:1-12 [Journal]
  2. Bostjan Bresar
    Partial Hamming graphs and expansion procedures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:13-27 [Journal]
  3. Shiow-yun Chang, Donna Crystal Llewellyn, John H. Vande Vate
    Matching 2-lattice polyhedra: finding a maximum vector. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:29-61 [Journal]
  4. Shiow-yun Chang, Donna Crystal Llewellyn, John H. Vande Vate
    Two-lattice polyhedra: duality and extreme points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:63-95 [Journal]
  5. Charles J. Colbourn, Feliu Sagols
    Triangulations and a generalization of Bose's method. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:97-107 [Journal]
  6. Dean Crnkovic, Mario-Osvin Pavcevic
    Some new symmetric designs with parameters (64, 28, 12). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:109-118 [Journal]
  7. Charles Delorme, Oscar Ordaz, Domingo Quiroz
    Some remarks on Davenport constant. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:119-128 [Journal]
  8. Zoltán Füredi, André Kündgen
    Covering a graph with cuts of minimum total size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:129-148 [Journal]
  9. Terry Gannon
    The cyclic structure of unimodal permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:149-161 [Journal]
  10. Xiang-dong Hou
    The eigenmatrix of the linear association scheme on R(2, m). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:163-184 [Journal]
  11. Yeow Meng Chee
    An improved finiteness theorem for graphical t-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:185-186 [Journal]
  12. Andrei Kotlov
    Tree width and regular triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:187-191 [Journal]
  13. Chunxiang Wang, Jingzhong Mao
    Some more remarks on domination in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:193-197 [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