Authors: Dinitz, Y Eilam, T Moran, S Zaks, S

Citation: Y. Dinitz et al., On the total(k)-diameter of connection networks, THEOR COMP, 247(1-2), 2000, pp. 213-228

Authors: Dinitz, Y Vainshtein, A

Citation: Y. Dinitz et A. Vainshtein, The general structure of edge-connectivity of a vertex subset in a graph and its incremental maintenance. Odd case, SIAM J COMP, 30(3), 2000, pp. 753-808

Authors: Dinitz, Y Garg, N Goemans, MX

Citation: Y. Dinitz et al., On the single-source unsplittable flow problem, COMBINATORI, 19(1), 1999, pp. 17-41

Authors: Auletta, V Dinitz, Y Nutov, Z Parente, D

Citation: V. Auletta et al., A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph, J ALGORITHM, 32(1), 1999, pp. 21-30

Authors: Dinitz, Y Nutov, Z

Citation: Y. Dinitz et Z. Nutov, A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs, J ALGORITHM, 32(1), 1999, pp. 31-40

Authors: Dinitz, Y Itai, A Rodeh, M

Citation: Y. Dinitz et al., On an algorithm of Zemlyachenko for subtree isomorphism, INF PROCESS, 70(3), 1999, pp. 141-146