Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Factoring polynomials with rational coefficients

- A. K. Lenstra, H. Lenstra, L. Lovász
- Mathematics
- 1 December 1982

In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into… Expand

Geometric Algorithms and Combinatorial Optimization

- M. Grötschel, L. Lovász, A. Schrijver
- Mathematics
- 1981

0. Mathematical Preliminaries.- 0.1 Linear Algebra and Linear Programming.- Basic Notation.- Hulls, Independence, Dimension.- Eigenvalues, Positive Definite Matrices.- Vector Norms, Balls.- Matrix… Expand

Cones of Matrices and Set-Functions and 0-1 Optimization

- L. Lovász, A. Schrijver
- Computer Science, Mathematics
- SIAM J. Optim.
- 1 May 1991

A system, method, and apparatus for facilitating a self-organizing workforce of one or more workers through payment and recognition incentives, a set of configurable operating rules, and a set of… Expand

The ellipsoid method and its consequences in combinatorial optimization

- M. Grötschel, L. Lovász, A. Schrijver
- Mathematics, Computer Science
- Comb.
- 1 June 1981

L. G. Khachiyan recently published a polynomial algorithm to check feasibility of a system of linear inequalities. The method is an adaptation of an algorithm proposed by Shor for non-linear… Expand

Limits of dense graph sequences

- L. Lovász, Balázs Szegedy
- Mathematics, Computer Science
- J. Comb. Theory, Ser. B
- 12 August 2004

We show that if a sequence of dense graphs G"n has the property that for every fixed graph F, the density of copies of F in G"n tends to a limit, then there is a natural ''limit object,'' namely a… Expand

Combinatorial problems and exercises

- L. Lovász
- Mathematics
- 1979

Problems Hints Solutions Dictionary of the combinatorial phrases and concepts used Notation Index of the abbreviations of textbooks and monographs Subject index Author index Errata.

Kneser's Conjecture, Chromatic Number, and Homotopy

- L. Lovász
- Mathematics, Computer Science
- J. Comb. Theory, Ser. A
- 1 November 1978

Abstract If the simplicial complex formed by the neighborhoods of points of a graph is ( k − 2)-connected then the graph is not k -colorable. As a corollary Kneser's conjecture is proved, asserting… Expand

Large Networks and Graph Limits

- L. Lovász
- Computer Science, Mathematics
- Colloquium Publications
- 12 December 2012

Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. To develop a mathematical theory of very large networks is… Expand

Submodular functions and convexity

- L. Lovász
- Mathematics, Computer Science
- ISMP
- 1982

In “continuous” optimization convex functions play a central role. Besides elementary tools like differentiation, various methods for finding the minimum of a convex function constitute the main body… Expand

On the ratio of optimal integral and fractional covers

- L. Lovász
- Computer Science, Mathematics
- Discret. Math.
- 1975

It is shown that the ratio of optimal integral and fractional covers of a hypergraph does not exceed 1 + log d, where d is the maximum degree. This theorem may replace probabilistic methods in… Expand