E. A. Dinic

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

1990

2 E. A. Dinic: The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem). IPCO 1990: 185-187

1977

1 E. A. Dinic, Alexander K. Kelmans, M. A. Zaitsev: Nonisomorphic Trees with the Same T-Polynomial. Inf. Process. Lett. 6(3): 73-76 (1977)

	1990
2		E. A. Dinic: The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem). IPCO 1990: 185-187
	1977
1		E. A. Dinic, Alexander K. Kelmans, M. A. Zaitsev: Nonisomorphic Trees with the Same T-Polynomial. Inf. Process. Lett. 6(3): 73-76 (1977)

Coauthor Index

1 Alexander K. Kelmans [1]

2 M. A. Zaitsev [1]

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page