Yefim Dinitz
- V.L. Arlazarov,
E.A. Dinic, M.A. Kronrod
and I.A. Faradjev. On economical finding of
transitive closure of a graph. Dokl. Akad. Nauk SSSR 194
(1970), no.3 (in Russian); English transl.: Soviet Math. Dokl. 11 (1970), 1209-1210.
- E.A. Dinic.
An algorithm for the solution of the max-flow problem
with the polynomial estimation. Dokl.
Akad. Nauk SSSR 194
(1970), no.4 (in Russian); English transl.: Soviet Math. Dokl. 11 (1970), 1277-1280.
- E.A. Dinic.
Bitwise residual decreasing method and transportation type problems. In Studies
in Discrete Mathematics ,
A.A. Fridman ed., Nauka,
Moscow,
1973, 46-57 (in Russian).
- E.A. Dinic,
A.V. Karzanov and M.V. Lomonosov.
A structure of the system of all minimum cuts of a graph. In Studies in
Discrete Optimization ,
A.A. Fridman ed., Nauka,
Moscow,
1976, 290-306 (in Russian).
- E.A. Dinic
and M.A. Zajtsev. Algorithms for generating of
all non-isomorphic trees. Avtomatika i telemekhanika 4 (1977)
(in Russian); English transl.: Automatic Remote Control 38 (1977),
554-560.
- E.A. Dinic
and A.V. Karzanov. Boolean optimization problems
with uniform constraints. Reprint, Institute for Control Sci., Moscow,
1978, 42p. (in Russian).
- E.A. Dinic,
G.V. Egorov and N.A. Ivanova.
A high level language for data manipulation. In Design of Data Base
Management Systems with Application Environment , V.L. Arlazarov and N.E. Emelyanov
eds., Institute for System Studies, Moscow, 1983, 48-53 (in Russian).
- E.A. Dinic
and N.A. Ivanova. On an explicit hierarchy super-language
for the text of a program. In Theoretical Foundations for Information Technology ,
V.L. Arlazarov and A.D. Astakhov
eds., Institute for System Studies, Moscow,
1988, 75-86 (in Russian).
- E.A. Dinic.
The fastest algorithm for PERT problem with AND- and OR-vertices (New
technologies - new products problem). In Proc. of Integer
Programming/Combinatorial Optimization Conference, IPCO'90 , Univ. of
Waterloo Press, Waterloo, Ontario, Canada, 1990, 185--187.
- Y. Dinitz.
The 3-edge-components and the structure of the system of all 3-edge-cuts
in a graph. In Proc. of the 18th International Workshop on
Graph-Theoretic Concepts in Computer Science, WG'92 , Lecture Notes in Computer
Science, v. 657, Springer-Verlag, 1993, 145-157.
- Y. Dinitz.
Subset connectivity and edge-disjoint trees, with an application to target
broadcasting. TR CS-0822, Dept. of Comp. Sci., Technion,
1994, 12p.
- Y. Dinitz
and A. Vainshtein. The connectivity carcass of a
vertex subset in a graph and its incremental maintenance. SIAM
J. on Computing 30 (2000), no. 3, 753-808. (See also Proc. of STOC'94,
716-725.)
- Y. Dinitz
and Z. Nutov. A 2-level cactus model for the
minimum and minimum+1 edge-cuts in a graph and
its incremental maintenance. In Proc. of the 27th Symposium on Theory
of Computing, STOC'95 ,
509-518.
- Y. Dinitz.
A compact layout of Butterfly on the square grid. TR CS-0873, Dept. of
Comp. Sci., Technion, 1995, 7p.
- Y. Dinitz
and J. Westbrook. Maintaining the classes of
4-edge-connectivity in a graph on-line. Algorithmica
20 (1998), no.3, 242-276.
- Y. Dinitz
and Z. Nutov. A 3-Approximation Algorithm for
Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs. J. of Algorithms 32 (1999), no. 1,
21-30. (See also TR CS-0886, Dept. of Comp. Sci., Technion,
1996.)
- Y. Dinitz,
A. Itai and M. Rodeh. On an algorithm of Zemlyachenko
for subtree isomorphism. Information
Processing Letters 70 (1999), no. 3, 141-146. (See also TR CS-0945,
Dept. of Comp. Sci., Technion, 1998.)
- Y. Dinitz,
N. Garg and M. Goemans.
On the single-source unsplittable
flow problem. Combinatorica 19
(1999), 17-41. (See also Proc. of FOCS'98.)
- Y. Dinitz,
T. Eilam, S. Moran and S. Zaks.
On the Total_k-Diameter of Connection Networks. Theoretical
Computer Science 247 (2000), no. 1-2, 213-228.
- Y. Dinitz,
S. Rajsbaum and S. Moran. Exact Communication
Costs for Consensus and Leader in a Tree. J. of Discrete Algorithms
1 (2003), 167-183. (See also Proc. of SIROCCO 7, 63-77.)
- Y. Dinitz,
S. Even, and M. Zapolotsky.
A compact layout of the Butterfly. J. of Interconnection Networks 4
(2003), no. 1, 53-75.
- Y. Dinitz.
Dinitz' Algorithm: The Original Version and Even's Version. In: Theoretical Computer Science:
Essays in Memory of Shimon Even, Oded Goldreich, Arnold
L. Rosenberg, and Alan L. Selman Eds. LNCS Festschrift, vol. 3895,
Springer-Verlag, 2006, 218-240.
- Y.
Dinitz and N. Solomon. Two
Absolute Bounds for Distributed Bit Complexity. Theoretical
Computer Science 384 (2007), 168–-183. (See also Proc. SIROCCO'2005, LNCS 3499,
Springer-Verlag, 2005, 115--126.,
63-77.)
- Y. Dinitz,
S. Rajsbaum and S. Moran. Bit
complexity of breaking and achieving symmetry in paths and rings. J.
of ACM, 55 (1), 2008. (See also Proc. of STOC'99.)
- Y. Dinitz
and S. Solomon. Optimality of an Algorithm
Solving the Bottleneck Tower of Hanoi Problem. ACM Transactions on
Algorithms, 4 (3), 2008.
- Y. Dinitz,
M. Elkin and S. Solomon. Low-Light Trees, and
Tight Lower Bounds for Euclidean Spanners. In print in Discrete &
Computational Geometry. (See also Proc. of FOCS'2008.)
Yefim
Dinitz