Citation: Ea. Boyd, ON THE COMPLEXITY OF A CUTTING PLANE ALGORITHM FOR SOLVING COMBINATORIAL LINEAR-PROGRAMS, SIAM journal on discrete mathematics, 9(3), 1996, pp. 365-376
Citation: J. Bierbrauer et al., ORTHOGONAL ARRAYS, RESILIENT FUNCTIONS, ERROR-CORRECTING CODES, AND LINEAR-PROGRAMMING BOUNDS, SIAM journal on discrete mathematics, 9(3), 1996, pp. 424-452
Citation: R. Connelly et W. Whiteley, 2ND-ORDER RIGIDITY AND PRESTRESS STABILITY FOR TENSEGRITY FRAMEWORKS, SIAM journal on discrete mathematics, 9(3), 1996, pp. 453-491
Citation: O. Goldschmidt et al., APPROXIMATION ALGORITHMS FOR THE K-CLIQUE COVERING PROBLEM, SIAM journal on discrete mathematics, 9(3), 1996, pp. 492-509
Citation: Gk. Manacher et Ta. Mankus, FINDING A DOMATIC PARTITION OF AN INTERVAL GRAPH IN TIME O(N), SIAM journal on discrete mathematics, 9(2), 1996, pp. 167-172
Citation: F. Hoffmann et K. Kriegel, GRAPH-COLORING RESULT AND ITS CONSEQUENCES FOR POLYGON-GUARDING PROBLEMS, SIAM journal on discrete mathematics, 9(2), 1996, pp. 210-224
Citation: B. Bhattacharya et al., A LINEAR ALGORITHM FOR MAXIMUM WEIGHT CLIQUES IN PROPER CIRCULAR-ARC GRAPHS, SIAM journal on discrete mathematics, 9(2), 1996, pp. 274-289