"Minimum Cost Flows."

Orlin, James B., and Ravindra K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 769-778. Boca Raton, FL: CRC Press, 2018.

"Minimum Spanning Trees."

Orlin, James B, and Ravindra K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 726-732. Boca Raton, FL: CRC Press, 2018.

"Shortest Paths."

Orlin, James B., and Ravindra K. Ahuja. In Handbook of Discrete and Combinatorial Mathematics, edited by Kenneth H. Rosen, 748-758. Boca Raton, FL: CRC Press, 2018.

"On the Complexity of Energy Storage Problems."

Halman, Nir, Giacomo Nannicini, and James B. Orlin. Discrete Optimization Vol. 28, (2018): 31-53.

"Randomized Algorithms for Finding the Shortest Negative Cost Cycle in Networks."

Orlin, James B., K.Subramani, and Piotr Wojciechowki. Discrete Applied Mathematics Vol. 236, (2018): 387-394.

"An O(nm) Time Algorithm for Finding the Min Length Directed Cycle in a Graph."

James B. Orlin and Antonio Sedeño-Noda. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Philip N. Klein. Barcelona, Spain: January 2017.