Citation: I. Peer et R. Shamir, REALIZING INTERVAL-GRAPHS WITH SIZE AND DISTANCE CONSTRAINTS, SIAM journal on discrete mathematics, 10(4), 1997, pp. 662-687
Citation: Am. Hamel et Ma. Steel, THE LENGTH OF A LEAF COLORATION ON A RANDOM BINARY-TREE, SIAM journal on discrete mathematics, 10(3), 1997, pp. 359-372
Citation: A. Sarangarajan, A LOWER-BOUND FOR ADJACENCIES ON THE TRAVELING SALESMAN POLYTOPE, SIAM journal on discrete mathematics, 10(3), 1997, pp. 431-435
Citation: Js. Provan et Mk. Chari, COUNTING PROBLEMS ASSOCIATED WITH STEINER TREES IN GRAPHS, SIAM journal on discrete mathematics, 10(3), 1997, pp. 436-446
Citation: Jp. Tillich et G. Zemor, OPTIMAL CYCLE CODES CONSTRUCTED FROM RAMANUJAN GRAPHS, SIAM journal on discrete mathematics, 10(3), 1997, pp. 447-459
Citation: M. Baiou et Ar. Mahjoub, STEINER 2-EDGE CONNECTED SUBGRAPH POLYTOPES ON SERIES-PARALLEL GRAPHS, SIAM journal on discrete mathematics, 10(3), 1997, pp. 505-514
Citation: L. Tassiulas, WORST-CASE LENGTH OF NEAREST-NEIGHBOR TOURS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM, SIAM journal on discrete mathematics, 10(2), 1997, pp. 171-179