Citation: Tm. Kratzke et Db. West, THE TOTAL INTERVAL NUMBER OF A GRAPH .2. TREES AND COMPLEXITY, SIAM journal on discrete mathematics, 9(2), 1996, pp. 339-348
Citation: K. Diks et A. Pelc, EFFICIENT GOSSIPING BY PACKETS IN NETWORKS WITH RANDOM FAULTS, SIAM journal on discrete mathematics, 9(1), 1996, pp. 7-18
Citation: S. Iwata et K. Murota, HORIZONTAL PRINCIPAL STRUCTURE OF LAYERED MIXED MATRICES - DECOMPOSITION OF DISCRETE-SYSTEMS BY DESIGN-VARIABLE SELECTIONS, SIAM journal on discrete mathematics, 9(1), 1996, pp. 71-86
Citation: L. Aleksandrov et H. Djidjev, LINEAR ALGORITHMS FOR PARTITIONING EMBEDDED GRAPHS OF BOUNDED GENUS, SIAM journal on discrete mathematics, 9(1), 1996, pp. 129-150
Citation: Ha. Kierstead et al., ONLINE AND FIRST-FIT COLORING OF GRAPHS THAT DO NOT INDUCE P-5, SIAM journal on discrete mathematics, 8(4), 1995, pp. 485-498
Citation: Fr. Mcmorris et Rc. Powers, THE MEDIAN PROCEDURE IN A FORMAL THEORY OF CONSENSUS, SIAM journal on discrete mathematics, 8(4), 1995, pp. 507-516
Citation: Hj. Bandelt et Ma. Steel, SYMMETRICAL MATRICES REPRESENTABLE BY WEIGHTED TREES OVER A CANCELLATIVE ABELIAN MONOID, SIAM journal on discrete mathematics, 8(4), 1995, pp. 517-525
Citation: I. Althofer et I. Leader, CORRELATION OF BOOLEAN FUNCTIONS AND PATHOLOGY IN RECURSION TREES, SIAM journal on discrete mathematics, 8(4), 1995, pp. 526-535
Citation: I. Newman et A. Wigderson, LOWER BOUNDS ON FORMULA SIZE OF BOOLEAN FUNCTIONS USING HYPERGRAPH ENTROPY, SIAM journal on discrete mathematics, 8(4), 1995, pp. 536-542
Citation: Ri. Greenberg et Jd. Shih, FEASIBLE OFFSET AND OPTIMAL OFFSET FOR GENERAL SINGLE-LAYER CHANNEL ROUTING, SIAM journal on discrete mathematics, 8(4), 1995, pp. 543-554