2013 - Fellow of the American Mathematical Society
2012 - Member of the National Academy of Sciences
2010 - Kyoto Prize in Mathematical sciences Outstanding Contributions to Mathematical Sciences Based on Discrete Optimization Algorithms
2006 - INFORMS John von Neumann Theory Prize
2006 - Royal Netherlands Academy of Arts and Sciences
2002 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Mathematics
1999 - Wolf Prize in Mathematics for his outstanding contributions to combinatorics, theoretical computer science and combinatorial optimization.
1993 - Brouwer Medal
1991 - Member of Academia Europaea
1979 - George Pólya Prize
His primary areas of study are Combinatorics, Discrete mathematics, Convex body, Line graph and Conjecture. His is doing research in Null graph, Chordal graph, Matroid, Graph theory and Homomorphism, both of which are found in Combinatorics. Disjoint sets, Hypergraph, Indifference graph, Graph property and Cubic graph are subfields of Discrete mathematics in which his conducts study.
László Lovász has included themes like Algorithm, Computational geometry and Isoperimetric inequality in his Convex body study. László Lovász has researched Algorithm in several fields, including Mixed volume, Convex combination, Rounding and Discrete geometry. His Conjecture study also includes fields such as
His main research concerns Combinatorics, Discrete mathematics, Graph, Line graph and Matroid. His Combinatorics study frequently draws connections between adjacent fields such as Upper and lower bounds. His research links Graph theory with Discrete mathematics.
His work on Line graph deals in particular with Null graph, Distance-hereditary graph, Factor-critical graph and Forbidden graph characterization. His study in Matroid focuses on Graphic matroid in particular. His Indifference graph study combines topics in areas such as 1-planar graph and Pathwidth.
Combinatorics, Discrete mathematics, Graph, Lemma and Homomorphism are his primary areas of study. His research related to Degree, Partition, Conjecture, Chordal graph and Indifference graph might be considered part of Combinatorics. As a part of the same scientific family, László Lovász mostly works in the field of Indifference graph, focusing on 1-planar graph and, on occasion, Pathwidth.
His work deals with themes such as Upper and lower bounds and Combinatorial optimization, which intersect with Discrete mathematics. Uniform boundedness and Metric is closely connected to Convergence in his research, which is encompassed under the umbrella topic of Graph. László Lovász interconnects Logarithm, Exponential function, Arithmetic, Vector space and Polynomial in the investigation of issues within Lemma.
László Lovász spends much of his time researching Combinatorics, Discrete mathematics, Graph, Lemma and Homomorphism. His research on Combinatorics frequently connects to adjacent areas such as Upper and lower bounds. All of his Discrete mathematics and Forbidden graph characterization, Planar graph, Line graph, Voltage graph and Universal graph investigations are sub-components of the entire Discrete mathematics study.
The concepts of his Graph study are interwoven with issues in Convergence, Finite set, Simple, Limit and Element. His studies in Lemma integrate themes in fields like Logarithm, Partition, Exponential function and Prime. His biological study spans a wide range of topics, including Banach space, Multigraph, Limit theory and Graph homomorphism.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Factoring Polynomials with Rational Coefficients
Arjen K. Lenstra;H. W. Lenstra;L. Lovasz.
Mathematische Annalen (1982)
Geometric Algorithms and Combinatorial Optimization
Martin Grötschel;László Lovász;Alexander Schrijver.
The ellipsoid method and its consequences in combinatorial optimization
Martin Grötschel;Lászlo Lovász;Alexander Schrijver.
Random Walks on Graphs: A Survey
Combinatorial problems and exercises
On the Shannon capacity of a graph
IEEE Transactions on Information Theory (1979)
On the ratio of optimal integral and fractional covers
Discrete Mathematics (1975)
Cones of Matrices and Set-Functions and 0–1 Optimization
László Lovász;Alexander Schrijver.
Siam Journal on Optimization (1991)
Submodular functions and convexity
Mathematical Programming-The State of the Art (1983)
Normal hypergraphs and the perfect graph conjecture
Discrete Mathematics (1972)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: