An Algorithm for the Bounded Variable Integer Programming Problem. - Leslie E. Trotter Jr.; C. M. Shetty (J. ACM, 1974)

Properties of vertex packing and independence system polyhedra. - George L. Nemhauser; Leslie E. Trotter Jr. (Math. Program., 1974)

A class of facet producing graphs for vertex packing polyhedra. - Leslie E. Trotter Jr. (Discret. Math., 1975)

When the Greedy Solution Solves a Class of Knapsack Problems. - Michael J. Magazine; George L. Nemhauser; Leslie E. Trotter Jr. (Oper. Res., 1975)

Vertex packings: Structural properties and algorithms. - George L. Nemhauser; Leslie E. Trotter Jr. (Math. Program., 1975)

Line perfect graphs. - Leslie E. Trotter Jr. (Math. Program., 1977)

Graphical properties related to minimal imperfection. - Robert G. Bland; H.-C. Huang; Leslie E. Trotter Jr. (Discret. Math., 1979)

On perfect graphs and polyhedra with (0, 1)-valued extreme points. - Clyde L. Monma; Leslie E. Trotter Jr. (Math. Program., 1979)

Related Necessary Conditions for Completing Partial Latin Squares. - Rick Giles; T. Oyama; Leslie E. Trotter Jr. (J. Comb. Theory A, 1980)

On stable set polyhedra for K1, 3-free graphs. - Rick Giles; Leslie E. Trotter Jr. (J. Comb. Theory B, 1981)

Finite checkability for integer rounding properties in combinatorial programming problems. - Stephen Baum; Leslie E. Trotter Jr. (Math. Program., 1982)

Algorithmic graph theory and perfect graphs, by Martin C. Golumbic, Academic, New York, 284 pp. Price: $34.00. - Leslie E. Trotter Jr. (Networks, 1983)

Two easy duality theorems for product partial orders. - Leslie E. Trotter Jr.; Douglas B. West (Discret. Appl. Math., 1987)

Hermite Normal Form Computation Using Modulo Determinant Arithmetic. - Paul D. Domich; R. Kannan; Leslie E. Trotter Jr. (Math. Oper. Res., 1987)

Packing and covering with integral feasible flows in integral supply-demand networks. - Robert E. Bixby; Odile M.-C. Marcotte; Leslie E. Trotter Jr. (Math. Program., 1987)

On randomized stopping points and perfect graphs. - Robert C. Dalang; Leslie E. Trotter Jr.; Dominique de Werra (J. Comb. Theory B, 1988)

A generalization of Robacker's theorem. - Shailesh K. Tipnis; Leslie E. Trotter Jr. (Discret. Math., 1989)

An Abstract Linear Duality Model. - P. C. P. Carvalho; Leslie E. Trotter Jr. (Math. Oper. Res., 1989)

On Abstract Integral Dependence. - Donna Crystal Llewellyn; Leslie E. Trotter Jr. (Math. Oper. Res., 1989)

Node-Packing Problems with Integer Rounding Properties. - Shailesh K. Tipnis; Leslie E. Trotter Jr. (SIAM J. Discret. Math., 1989)

Stability Critical Graphs and Even Subdivisions of K_4. - Edward C. Sewell; Leslie E. Trotter Jr. (IPCO, 1990)

A topological characterization for closed sets under polar duality in Qn. - Mark Hartmann; Leslie E. Trotter Jr. (Math. Program., 1991)

Stability Critical Graphs and Even Subdivisions of K4. - Edward C. Sewell; Leslie E. Trotter Jr. (J. Comb. Theory B, 1993)

Stability critical graphs and ranks facets of the stable set polytope. - Edward C. Sewell; Leslie E. Trotter Jr. (Discret. Math., 1995)

Cardinality-restricted Chains and Antichains in Partially ordered Sets. - Henry Shum; Leslie E. Trotter Jr. (Discret. Appl. Math., 1996)

Fully Parallel Generic Branch-and-Cut. - Marta Eso; Laszlo Ladányi; Ted K. Ralphs; Leslie E. Trotter Jr. (PP, 1997)

Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. - Edoardo Amaldi; Marc E. Pfetsch; Leslie E. Trotter Jr. (IPCO, 1999)

Branch, Cut, and Price: Sequential and Parallel. - Laszlo Ladányi; Ted K. Ralphs; Leslie E. Trotter Jr. (Computational Combinatorial Optimization, 2001)

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. - Edoardo Amaldi; Marc E. Pfetsch; Leslie E. Trotter Jr. (Math. Program., 2003)

On the capacitated vehicle routing problem. - Ted K. Ralphs; L. Kopman; William R. Pulleyblank; Leslie E. Trotter Jr. (Math. Program., 2003)

Teaching Computational Discrete Optimization at the Undergraduate Level. - Andreas Alpers; Leslie E. Trotter Jr. (INFORMS Trans. Educ., 2009)