| 2026 | SODA | From Incremental Transitive Cover to Strongly Polynomial Maximum Flow. | Daniel Dadush, James B. Orlin, Aaron Sidford, Lszl A. Vgh |
| 2021 | SODA | Directed Shortest Paths via Approximate Cost Balancing. | James B. Orlin, Lszl A. Vgh |
| 2021 | WG | Linearizable Special Cases of the Quadratic Shortest Path Problem. | Eranda ela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf |
| 2020 | SODA | Distributionally Robust Max Flows. | Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi |
| 2017 | SODA | An | James B. Orlin, Antonio Sedeo-Noda |
| 2016 | IPCO | Robust Monotone Submodular Function Maximization. | James B. Orlin, Andreas S. Schulz, Rajan Udwani |
| 2013 | ESA | A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. | Nir Halman, Giacomo Nannicini, James B. Orlin |
| 2013 | STOC | Max flows in O(nm) time, or better. | James B. Orlin |
| 2010 | STOC | Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices. | James B. Orlin |
| 2009 | SODA | A simple combinatorial algorithm for submodular function minimization. | Satoru Iwata, James B. Orlin |
| 2009 | WADS | Integer Programming: Optimization and Evaluation Are Equivalent. | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
| 2008 | IPCO | A Fast, Simpler Algorithm for the Matroid Parity Problem. | James B. Orlin |
| 2008 | SODA | Fully polynomial time approximation schemes for stochastic dynamic programs. | Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi |
| 2007 | IPCO | A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization. | James B. Orlin |
| 2006 | INFOCOM | A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones. | Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta |
| 2006 | INFOCOM | Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic. | Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta |
| 2006 | PATAT | Very Large-Scale Neighborhood Search Techniques in Timetabling Problems. | Carol Meyers, James B. Orlin |
| 2005 | IPCO | Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems. | Agustn Bompadre, James B. Orlin |
| 2004 | SODA | Approximate local search in combinatorial optimization. | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
| 2002 | ESA | Branch-and-Bound Algorithms for the Test Cover Problem. | Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie |
| 2000 | STOC | On the sum-of-squares algorithm for bin packing. | Jnos Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber |
| 2000 | STOC | epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). | James B. Orlin, Andreas S. Schulz, Sudipta Sengupta |
| 1999 | IPCO | Solving the Convex Cost Integer Dual Network Flow Problem. | Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin |
| 1996 | SODA | A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract). | James B. Orlin |
| 1992 | IPCO | A Technique for Speeding up the Solution of the Lagrangian Dual. | Dimitris Bertsimas, James B. Orlin |
| 1992 | SODA | A Faster Algorithm for Finding the Minimum Cut in a Graph. | Jianxiu Hao, James B. Orlin |
| 1991 | SODA | Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming. | Murali S. Kodialam, James B. Orlin |
| 1988 | STOC | A Faster Strongly Polynominal Minimum Cost Flow Algorithm | James B. Orlin |
| 1981 | STOC | The Complexity of Dynamic Languages and Dynamic Optimization Problems | James B. Orlin |