E. A. Dinic

According to our database, E. A. Dinic authored at least 2 papers between 1977 and 1990.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1990

The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem).

E. A. Dinic

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1977

Nonisomorphic Trees with the Same T-Polynomial.

E. A. Dinic, Alexander K. Kelmans, M. A. Zaitsev

Inf. Process. Lett., 1977