Li C.L, McCormick S.T, Simchi-Levi D..  1990.  The Complexity of Finding Two Disjoint Paths with Min Max Objective Function. Discrete Applied Mathematics. 26

Li C.L, Simchi-Levi D..  1990.  Worst-Case Analysis of Heuristics for the Multi-Depot Capacitated Vehicle Routing Problems. ORSA Journal on Computing. 2

Gavish B., Li C.L, Simchi-Levi D..  1992.  Analysis of Heuristics for the Design of Tree Networks. Annals of Operations Research. 36

Li C.L, Simchi-Levi D., Desrochers M..  1992.  On the Distance Constrained Vehicle Routing Problem. Operations Research. 40

Li C.L, McCormick S.T, Simchi-Levi D..  1992.  Finding Disjoint Paths with Different Paths - Costs: Complexity and Algorithms. Networks. 22

Li C.L, McCormick S.T, Simchi-Levi D..  1992.  On the Minimum-Cost-Bounded Diameter and the Fixed-Budget-Minimum-Diameter Edge Addition Problems. Operations Research Letters. 11

Li C.L, McCormick S.T, Simchi-Levi D..  1992.  The Point-to-Point Delivery and Connection Problems: Complexity and Algorithms. Discrete Applied Mathematics. 36

Bramel J., Li C.L, Simchi-Levi D..  1993.  Probabilistic Analysis of Heuristics for the Vehicle Routing with Time Windows. American Journal of Mathematical and Management Sciences. 13

Demir E.K, Leong T, Li C.L, Ng J., Simchi-Levi D..  2001.  Locating Containers in a Mega Terminal. Naval Research Logistics. 48

Caglar D., Li C.L, Simchi-Levi D..  2004.  Two-Echelon Spare Parts Inventory System Subject to a Service Constraint. IIE Transactions. 36

Chen X., Li C.L, Rhee B.D, Simchi-Levi D..  2007.  The Impact of Manufacturer Rebates on Supply Chain Profits. Naval Research Logistics. 54

Halman N., Klabjan D., Li C.L, Orlin J., Simchi-Levi D..  2008.  Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programming Problems. ACM-SIAM SODA 2008 Program.

Halman N., Li C.L, Simchi-Levi D..  2008.  Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Network. Accepted to Approx 2008 Program. Published in Lecture Notes in Computer Science. Springer Berlin. 5171/2008

Halman N., Li C.L, Simchi-Levi D..  2009.  Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks. Operations Research Letters. 37

Halman N., Klabjan D., Li C.L, Orlin J., Simchi-Levi D..  2014.  Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs. SIAM Journal on Discrete Mathematics. 28(4)