Research Papers
- Amaldi, E., M. E. Pfetsch, Leslie Earl Trotter. 2003. "On the maximum feasible subsystem problem, IISs and IIS-hypergraphs." Mathematical Programming 95 (3): 533-554.
- Trotter, Leslie Earl, L. Ladanyi, T Ralphs. 2001. "Branch, cut, and price: sequential and parallel". Computational Combinatorial Optimization. 223-260.
- Sewell, E. C., Leslie Earl Trotter. 1995. "Stability critical graphs and ranks facets of the stable set polytope." Discrete Mathematics 147 (1-3): 247-255.
- Ryan, J., and L. E. Trotter, Jr. 1994. Weyl-Minkowski duality for integral monoids. Optimization28:315-31.
- Liu, J., L. E. Trotter, Jr., and G. Ziegler. 1993. On the height of the minimal Hilbert basis. Results in Mathematics23:374-76.
- Sewell, E. C., and L. E. Trotter, Jr. 1993. "Stability critical graphs and even subdivisions of K4." Journal of Combinatorial Theory (B) 59:74-84.
- Hartmann, M., and L. E. Trotter, Jr. 1991. "A topological characterization for closed sets under polar duality in Qn." Mathematical Programming (A)49:281-83.
- Tipnis, S., and L. E. Trotter, Jr. 1989. "Node-packing problems with integer rounding properties." SIAM Journal on Discrete Mathematics 2:407-12.
- Crystal-Llewellyn, D., and L. E. Trotter, Jr. 1989. "On abstract integral dependence." Mathematics of Operations Research14:626-38.
- Carvalho, P., and L. E. Trotter, Jr. 1989. "An abstract linear duality model." Mathematics of Operations Research 14:639-63.
- Dalang, R., D. deWerra, and L.E. Trotter, Jr. 1988. "On randomized stopping points and perfect graphs." Journal of Combinatorial Theory B 45:320-44.
- Domich, P. D., R. Kannan, Leslie Earl Trotter. 1987. "Hermite Normal-Form Computation Using Modulo Determinant Arithmetic." Mathematics of Operations Research 12 (1): 50-59.
Return to top.