"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.

"A Characterization of Irreducible Infeasible Subsystems in Flow Networks."

Joormann, Imke, James B. Orlin, and Marc E. Pfetsch. Networks Vol. 68, No. 2 (2016): 121-129.

"Robust Monotone Submodular Function Maximization."

Rajan Udwani, Andreas Schulz, and James B. Orlin. In Proceedings of the The 18th Conference on Integer Programming and Combinatorial Optimization (IPCO XVIII), Liège, Belgium: June 2016.

"On the Power of Randomization in Network Interdiction."

Bertsimas, Dimitris, Ebrahim Nasrabadi and James B. Orlin. Operations Research Letters Vol. 44, No. 1 (2016): 114–120.

"Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs."

Halman, Nir, Diego Klabjan, Chung-Lun Li, James Orlin and David Simchi-Levi. SIAM Journal on Discrete Mathematics Vol. 28, No. 4 (2014): 1725–1796.