Michael D. Grigoriadis

	1996
6		Michael D. Grigoriadis, Leonid G. Khachiyan: Approximate minimum-cost multicommodity flows in Õ(epsilon-2KNM) time. Math. Program. 75: 477-482 (1996)
	1991
5		Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan: Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Program. 50: 277-290 (1991)
	1989
4		Giorgio Gallo, Michael D. Grigoriadis, Robert Endre Tarjan: A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. Comput. 18(1): 30-55 (1989)
	1988
3		Michael D. Grigoriadis, B. Kalantari: A new class of heuristic algorithms for weighted perfect matching. J. ACM 35(4): 769-776 (1988)
	1986
2		Michael D. Grigoriadis, B. Kalantari: A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms. Inf. Process. Lett. 22(2): 73-76 (1986)
	1969
1		Michael D. Grigoriadis, Klaus Ritter: A Decomposition Method for Structured Linear and Nonlinear Programs. J. Comput. Syst. Sci. 3(4): 335-360 (1969)

Coauthor Index

1	Giorgio Gallo	[4]
2	Andrew V. Goldberg	[5]
3	B. Kalantari	[2] [3]
4	Leonid Khachiyan (Leonid G. Khachiyan)	[6]
5	Klaus Ritter	[1]
6	Robert Endre Tarjan	[4] [5]

Colors in the list of coauthors