"A Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths."

Orlin, James B., Kamesh Madduri, K. Subramani and M. Williamson. Journal of Discrete Algorithms Vol. 8, No. 2 (2010): 189-198.

"Improved Algorithms for Computing Fisher's Market Clearing Prices."

James B. Orlin. In Proceedings of the 2010 Symposium on the Theory of Computing., New York, NY: June 2010.

"Packing Shelves with Items that Divide the Shelves' Length: A Case of a Universal Number Partition Problem."

Dror, Moshe, James B. Orlin and Michael Zhu. Discrete Mathematics, Algorithms and Applications Vol. 2, No. 2 (2010): 189-198.

"Provably Near-Optimal LP-Based Policies for Revenue Management of Reusable Resources."

Levi, Retsef, and Ana Radovanovic. Operations Research Vol. 58, No. 2 (2010): 503-507. Appendix.

"A Simple Combinatorial Algorithm for Submodular Function Minimization."

Satoru Iwata and James B. Orlin. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Claire Mathieu. Philadelphia, PA: December 2009.

"A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand."

Halman, Nir, Diego Klabjan, Mohamed Mostagir, James B. Orlin and David Simchi-Levi. Mathematics of Operations Research Vol. 34, No. 3 (2009): 674-685.