- Home
- Best Scientists - Mathematics
- László Lovász

Mathematics

Hungary

2023

Computer Science

Hungary

2023

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
98
Citations
51,912
389
World Ranking
32
National Ranking
2

Computer Science
D-index
98
Citations
51,831
379
World Ranking
231
National Ranking
1

2023 - Research.com Computer Science in Hungary Leader Award

2023 - Research.com Mathematics in Hungary Leader Award

2022 - Research.com Computer Science in Hungary Leader Award

2022 - Research.com Mathematics in Hungary Leader Award

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 - Royal Netherlands Academy of Arts and Sciences

2006 - INFORMS John von Neumann Theory Prize

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

- Combinatorics
- Discrete mathematics
- Algebra

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

- Heuristic that connect with fields like PCP theorem,
- Chromatic scale together with Corollary, Homotopy and Simplicial complex.

- Geometric Algorithms and Combinatorial Optimization (3230 citations)
- Factoring Polynomials with Rational Coefficients (3103 citations)
- The ellipsoid method and its consequences in combinatorial optimization (1694 citations)

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 (73.85%)
- Discrete mathematics (51.09%)
- Graph (10.65%)

- Combinatorics (73.85%)
- Discrete mathematics (51.09%)
- Graph (10.65%)

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.

- Large Networks and Graph Limits (584 citations)
- Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics (263 citations)
- Nowhere-zero 3-flows and modulo k-orientations (84 citations)

- Combinatorics
- Algebra
- Discrete mathematics

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)**

5605 Citations

Geometric Algorithms and Combinatorial Optimization

Martin Grötschel;László Lovász;Alexander Schrijver.

**(1988)**

4962 Citations

The ellipsoid method and its consequences in combinatorial optimization

Martin Grötschel;Lászlo Lovász;Alexander Schrijver.

Combinatorica **(1981)**

2517 Citations

Random Walks on Graphs: A Survey

L. Lovász.

**(2001)**

2270 Citations

Combinatorial problems and exercises

László Lovász.

**(1979)**

2059 Citations

On the Shannon capacity of a graph

L. Lovasz.

IEEE Transactions on Information Theory **(1979)**

1830 Citations

On the ratio of optimal integral and fractional covers

L. Lovász.

Discrete Mathematics **(1975)**

1346 Citations

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

László Lovász;Alexander Schrijver.

Siam Journal on Optimization **(1991)**

1235 Citations

Submodular functions and convexity

L. Lovász.

Mathematical Programming-The State of the Art **(1983)**

1231 Citations

Large Networks and Graph Limits

László Lovász.

**(2012)**

1157 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

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:

University of Amsterdam

Stanford University

Microsoft (United States)

Georgia Institute of Technology

University of California, Berkeley

Alfréd Rényi Institute of Mathematics

Microsoft (United States)

Dartmouth College

Royal Institute of Technology

Rutgers, The State University of New Jersey

Johns Hopkins University

Brown University

Micron (United States)

Université Catholique de Louvain

University of Technology Sydney

University of Parma

Université de Rennes

The Francis Crick Institute

University of Camerino

Duke University

University of Cambridge

Cleveland Clinic

Max Planck Institute for Chemistry

United States Naval Research Laboratory

University of Maryland, Baltimore County

University of Florida

Something went wrong. Please try again later.