"Robust Optimization with Incremental Recourse."

Nasrabadi, Ebrahim, and James B. Orlin, Working Paper. December 2014.

"A Computationally Fast FPTAS for Convex Stochastic Dynamic Programs."

Halman, Nir, Giacamo Nannicini and James B. Orlin. SIAM Journal on Optimization Vol. 25, No. 1 (2013): 317–350.

"Fast Algorithms for Convex Cost Flow Problems on Circles, Lines, and Trees."

Orlin, James B. and Balachandran Vaidyanathan. Networks Vol. 62, No. 4 (2013): 288-296.

"On the hardness of finding subsets with equal average."

Elkind, Edith and James B. Orlin. Information Processing Letters Vol. 113, No. 13 (2013): 477-480.

"Max Flows in O(nm) Time or Better."

James B. Orlin. In STOC '13 Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, New York, NY: June 2013.

"Simplifications and Speedups of the Pseudoflow Algorithm."

Hochbaum, Dorit S. and James B. Orlin. Networks Vol. 61, No. 1 (2013): 40-57.