Citation: Amh. Gerards et Fb. Shepherd, THE GRAPHS WITH ALL SUBGRAPHS T-PERFECT, SIAM journal on discrete mathematics (Print), 11(4), 1998, pp. 524-545
Citation: J. Bangjensen et T. Jordan, EDGE-CONNECTIVITY AUGMENTATION PRESERVING SIMPLICITY, SIAM journal on discrete mathematics (Print), 11(4), 1998, pp. 603-623
Citation: Sf. Hwang et Gj. Chang, K-NEIGHBORHOOD-COVERING AND K-NEIGHBORHOOD-INDEPENDENCE PROBLEMS FOR CHORDAL GRAPHS, SIAM journal on discrete mathematics (Print), 11(4), 1998, pp. 633-643
Citation: Y. Caro et al., LOCAL-STRUCTURE WHEN ALL MAXIMAL INDEPENDENT SETS HAVE EQUAL WEIGHT, SIAM journal on discrete mathematics (Print), 11(4), 1998, pp. 644-654
Citation: Ys. Han, A NEW DECODING ALGORITHM FOR COMPLETE DECODING OF LINEAR BLOCK-CODES, SIAM journal on discrete mathematics (Print), 11(4), 1998, pp. 664-671
Citation: Fj. Rispoli et S. Cosares, A BOUND OF 4 FOR THE DIAMETER OF THE SYMMETRICAL TRAVELING SALESMAN POLYTOPE, SIAM journal on discrete mathematics (Print), 11(3), 1998, pp. 373-380
Citation: U. Faigle et W. Kern, APPROXIMATE CORE ALLOCATION FOR BINPACKING GAMES, SIAM journal on discrete mathematics (Print), 11(3), 1998, pp. 387-399
Citation: V. Chepoi, ON DISTANCE-PRESERVING AND DOMINATION ELIMINATION ORDERINGS, SIAM journal on discrete mathematics (Print), 11(3), 1998, pp. 414-436
Citation: M. Kochol, PARTIAL INTERSECTION THEOREM AND FLOWS IN ABSTRACT NETWORKS, SIAM journal on discrete mathematics (Print), 11(3), 1998, pp. 468-486
Citation: M. Ramras, CONGESTION-FREE ROUTINGS OF LINEAR COMPLEMENT PERMUTATIONS, SIAM journal on discrete mathematics (Print), 11(3), 1998, pp. 487-500
Citation: C. Padro et al., FAULT-TOLERANT FIXED ROUTINGS IN SOME FAMILIES OF DIGRAPHS, SIAM journal on discrete mathematics (Print), 11(3), 1998, pp. 501-509
Citation: J. Kleinberg et Mx. Goemans, THE LOVASZ THETA-FUNCTION AND A SEMIDEFINITE PROGRAMMING RELAXATION OF VERTEX COVER, SIAM journal on discrete mathematics, 11(2), 1998, pp. 196-204