"NP-completeness for Minimizing Maximum Edge Length in Grid Embeddings."

Miller, Zevi and James B. Orlin. Journal of Algorithms Vol. 6, No. 1 (1985): 10-16.

"Minimum Convex Cost Dynamic Network Flows."

Orlin, James B. Mathematics of Operations Research Vol. 9, No. 2 (1984): 190-207.

"Algorithms for Problems on Dynamic/Periodic Graphs."

Orlin, James B. In Progress in Combinatorial Optimization, edited by William Pulleyblank , 273-294. Toronto, Canada: Academic Press, 1984.

"Dynamic Matchings and Quasidynamic Fractional Matchings I."

Orlin, James B. Networks Vol. 13, No. 4 (1983): 551-562.

"Dynamic Matchings and Quasidynamic Fractional Matchings II."

Orlin, James B. Networks Vol. 13, No. 4 (1983): 563-580.

"Maximum Throughput Dynamic Network Flows."

Orlin, James B. Mathematical Programming Vol. 27, No. 2 (1983): 214-223.