E. A. Dinic

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1990
The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem).
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1977
Nonisomorphic Trees with the Same T-Polynomial.
Inf. Process. Lett., 1977


  Loading...