L. A. Wolsey

1. An analysis of approximations for maximizing submodular set functions—I
   1978/12/01 by George L. Nemhauser, G. L. Nemhauser, L. A. Wolsey +3 · 315 citations
   Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Computational Geometry and Mesh Generation
2. Best Algorithms for Approximating the Maximum of a Submodular Set Function
   1978/08/01 by George L. Nemhauser, G. L. Nemhauser, Laurence A. Wolsey +1 · 25 citations
   Computer Science · #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Cryptography and Data Security
3. Formulations and valid inequalities for the node capacitated graph partitioning problem
   1996/09/01 by C. E. Ferreira, Carlos Eduardo Ferreira, A. Martin +7 · 3 citations
   Engineering · Computer Science · #VLSI and FPGA Design Techniques #Advanced Graph Theory Research #Interconnection Networks and Systems