• S. Arora, B. Bollobás, L. Lovász, I. Tourlakis: Proving integrality gaps without knowing the linear program, Theory of Computing 2 (2006), 19–51. pdf
  • J. Chen,R.D. Kleinberg, L. Lovász, R. Rajaraman, R. Sundaram, A. Vetta: (Almost) tight bounds and existence theorems for confluent flows, Proc. 36th Annual ACM STOC (2004), 529-538. pdf
  • U. Feige, L. Lovász, P. Tetali: Approximating Min-sum Set Cover, Proc. Conf. APPROX (2002), 94--107. pdf
  • L. Lovász: Energy of convex sets, shortest paths, and resistance, J. Comb. Theory A 94 (2001) 363-382. postscript
  • L. Lipták and L. Lovász: Critical Facets of the Stable Set Polytope, Combinatorica 21 (2001) 61-88.postscript
  • L. Lipták and L. Lovász: Facets with fixed defect of the Stable Set Polytope, Math. Programming, Series A 88 (2000), 33-44. postscript
  • L. Lovász: The membership problem in jump systems [J. Comb. Theory (B) 70 (1997), 45-66.] postscript
  • L. Lovász, A. Schrijver: Matrix cones, projection representations, and stable set polyhedra, in: Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science I (1990), 1-17.pdf
  • L. Lovász, A. Schrijver: Cones of matrices and set-functions, and 0-1 optimization, SIAM J. Optim. 1 (1991), 166-190. pdf
  • L. Lovász: Submodular functions and convexity, in: Mathematical Programming: the State of the Art (ed.\ A.Bachem, M.Grötschel, B.Korte), Springer (1983), 235-257.pdf
  • Last modified 15/6/2010.. This page is maintained by its owner.