Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             15 results found
no title author magazine year volume issue page(s) type
1 A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time Pisaruk, N.N.
2003
131 3 p. 655-663
9 p.
article
2 An augmenting graph approach to the stable set problem in P 5-free graphs Boliac, Rodica
2003
131 3 p. 567-575
9 p.
article
3 A new construction for Z-cyclic whist tournaments Ge, Gennian
2003
131 3 p. 643-650
8 p.
article
4 Author index to volume 2003
131 3 p. 691-693
3 p.
article
5 Contents 2003
131 3 p. viii-ix
nvt p.
article
6 Editorial Board 2003
131 3 p. v-vii
nvt p.
article
7 Erratum to “Intersecting codes and separating codes” Cohen, G.
2003
131 3 p. 689-690
2 p.
article
8 Expansion of layouts of complete binary trees into grids Lin, Y.-B.
2003
131 3 p. 611-642
32 p.
article
9 Facets of linear signed order polytopes Fiorini, Samuel
2003
131 3 p. 597-610
14 p.
article
10 Finding sharper distinctions for conditions of transitivity of the majority method Durand, Sylvain
2003
131 3 p. 577-595
19 p.
article
11 Guide for authors 2003
131 3 p. 694-697
4 p.
article
12 Heredity of the index of convergence of the line digraph Yan, Weigen
2003
131 3 p. 681-688
8 p.
article
13 Lattice hypercube designs Fu, Tung-Shan
2003
131 3 p. 673-680
8 p.
article
14 The commutative closure of a binary slip-language is context-free: a new proof Rigo, Michel
2003
131 3 p. 665-672
8 p.
article
15 The maximum edge biclique problem is NP-complete Peeters, René
2003
131 3 p. 651-654
4 p.
article
                             15 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands