Citation: Mx. Goemans et Dp. Williamson, PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR FEEDBACK PROBLEMS IN PLANAR GRAPHS, Combinatorica, 18(1), 1998, pp. 37-59
Citation: T. Ibaraki et al., A FAST ALGORITHM FOR FINDING A MAXIMUM FREE MULTIFLOW IN AN INNER EULERIAN NETWORK AND SOME GENERALIZATIONS, Combinatorica, 18(1), 1998, pp. 61-83
Citation: Y. Kohayakawa et al., AN EXTREMAL PROBLEM FOR RANDOM GRAPHS AND THE NUMBER OF GRAPHS WITH LARGE EVEN-GIRTH, Combinatorica, 18(1), 1998, pp. 101-120
Citation: M. Simonovits et Vt. Sos, HEREDITARILY EXTENDED PROPERTIES, QUASI-RANDOM GRAPHS AND NOT NECESSARILY INDUCED SUBGRAPHS, Combinatorica, 17(4), 1997, pp. 577-596