Journals in DBLP

Discrete Applied Mathematics
2003, volume: 131, number: 3

1. Rodica Boliac, Vadim V. Lozin
   An augmenting graph approach to the stable set problem in P₅-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:3, pp:567-575 [Journal]
   
2. Sylvain Durand
   Finding sharper distinctions for conditions of transitivity of the majority method. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:3, pp:577-595 [Journal]
   
3. Samuel Fiorini, Peter C. Fishburn
   Facets of linear signed order polytopes. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:3, pp:597-610 [Journal]
   
4. Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough
   Expansion of layouts of complete binary trees into grids. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:3, pp:611-642 [Journal]
   
5. Gennian Ge, Alan C. H. Ling
   A new construction for Z-cyclic whist tournaments. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:3, pp:643-650 [Journal]
   
6. René Peeters
   The maximum edge biclique problem is NP-complete. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:3, pp:651-654 [Journal]
   
7. Nicolai N. Pisaruk
   A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:3, pp:655-663 [Journal]
   
8. Michel Rigo
   The commutative closure of a binary slip-language is context-free: a new proof. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:3, pp:665-672 [Journal]
   
9. Tung-Shan Fu, Kwun-Shen Lin
   Lattice hypercube designs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:3, pp:673-680 [Journal]
   
10. Weigen Yan, Fuji Zhang
    Heredity of the index of convergence of the line digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:3, pp:681-688 [Journal]