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
 
                             20 results found
no title author magazine year volume issue page(s) type
1 A fast parallel algorithm to recognize P4-sparse graphs Lin, Rong
1998
81 1-3 p. 191-215
25 p.
article
2 A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid Yanpei Liu,
1998
81 1-3 p. 69-91
23 p.
article
3 A strongly polynomial algorithm for the uniform balanced network flow problem Scutellá, Maria Grazia
1998
81 1-3 p. 123-131
9 p.
article
4 Author index 1998
81 1-3 p. 263-
1 p.
article
5 Better approximations of non-Hamiltonian graphs Iwama, Kazuo
1998
81 1-3 p. 239-261
23 p.
article
6 Edge-packing planar graphs by cyclic graphs Heath, Lenwood S.
1998
81 1-3 p. 169-180
12 p.
article
7 Editorial Board 1998
81 1-3 p. 1-
1 p.
article
8 Exact classification with two-layer neural nets inn dimensions Sweatman, Catherine Z.W. Hassell
1998
81 1-3 p. 19-39
21 p.
article
9 Interchange graphs and the Hamiltonian cycle polytope Sierksma, Gerard
1998
81 1-3 p. 217-224
8 p.
article
10 Minimum matrix representation of Sperner systems Bennett, F.E.
1998
81 1-3 p. 9-17
9 p.
article
11 On the number of Abelian square-free words on four letters Carpi, Arturo
1998
81 1-3 p. 155-167
13 p.
article
12 On variations of the subset sum problem Alfonsín, J.L. Ramírez
1998
81 1-3 p. 1-7
7 p.
article
13 Panelling planar graphs Oxley, James
1998
81 1-3 p. 109-122
14 p.
article
14 Performance of Coffman-Graham schedules in the presence of unit communication delays Hanen, C.
1998
81 1-3 p. 93-108
16 p.
article
15 Polyhedral characterizations and perfection of line graphs Cao, Dasong
1998
81 1-3 p. 141-154
14 p.
article
16 Polynomial invariants for trees a statistical mechanics approach Conti, Roberto
1998
81 1-3 p. 225-237
13 p.
article
17 Routing a vehicle of capacity greater than one Guan, D.J.
1998
81 1-3 p. 41-57
17 p.
article
18 Sensitivity analysis for knapsack problems: a negative result Blair, Charles
1998
81 1-3 p. 133-139
7 p.
article
19 Steiner intervals in graphs Kubicka, Ewa
1998
81 1-3 p. 181-190
10 p.
article
20 The maximal clique and colourability of curve contact graphs Hlineˇný, Petr
1998
81 1-3 p. 59-68
10 p.
article
                             20 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands