H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Mathematics H-index 100 Citations 51,917 281 World Ranking 15 National Ranking 1
Computer Science H-index 94 Citations 47,832 257 World Ranking 205 National Ranking 1

Research.com Recognitions

Awards & Achievements

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

Overview

What is he best known for?

The fields of study he is best known for:

  • 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.

His most cited work include:

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

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

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

What were the highlights of his more recent work (between 2010-2021)?

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

In recent papers he was focusing on the following fields of study:

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.

Between 2010 and 2021, his most popular works were:

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

In his most recent research, the most cited papers focused on:

  • 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.

Top Publications

Factoring Polynomials with Rational Coefficients

Arjen K. Lenstra;H. W. Lenstra;L. Lovasz.
Mathematische Annalen (1982)

5085 Citations

Geometric Algorithms and Combinatorial Optimization

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

4586 Citations

The ellipsoid method and its consequences in combinatorial optimization

Martin Grötschel;Lászlo Lovász;Alexander Schrijver.
Combinatorica (1981)

2295 Citations

Random Walks on Graphs: A Survey

L. Lovász.
(2001)

2096 Citations

Combinatorial problems and exercises

László Lovász.
(1979)

1918 Citations

On the Shannon capacity of a graph

L. Lovasz.
IEEE Transactions on Information Theory (1979)

1646 Citations

On the ratio of optimal integral and fractional covers

L. Lovász.
Discrete Mathematics (1975)

1249 Citations

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

László Lovász;Alexander Schrijver.
Siam Journal on Optimization (1991)

1165 Citations

Submodular functions and convexity

L. Lovász.
Mathematical Programming-The State of the Art (1983)

1065 Citations

Normal hypergraphs and the perfect graph conjecture

L. Lovász.
Discrete Mathematics (1972)

903 Citations

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.

Contact us

Top Scientists Citing László Lovász

Noga Alon

Noga Alon

Tel Aviv University

Publications: 128

Santosh Vempala

Santosh Vempala

Georgia Institute of Technology

Publications: 110

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 79

Jin-Yi Cai

Jin-Yi Cai

University of Wisconsin–Madison

Publications: 77

Madhu Sudan

Madhu Sudan

Harvard University

Publications: 71

Alan Frieze

Alan Frieze

Carnegie Mellon University

Publications: 67

Jaroslav Nešetřil

Jaroslav Nešetřil

Charles University

Publications: 63

János Pach

János Pach

Alfréd Rényi Institute of Mathematics

Publications: 62

Uriel Feige

Uriel Feige

Weizmann Institute of Science

Publications: 57

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 57

Jacob Fox

Jacob Fox

Stanford University

Publications: 54

Avi Wigderson

Avi Wigderson

Institute for Advanced Study

Publications: 51

Subhash Khot

Subhash Khot

New York University

Publications: 50

Svante Janson

Svante Janson

Uppsala University

Publications: 49

Monique Laurent

Monique Laurent

Centrum Wiskunde & Informatica

Publications: 48

Something went wrong. Please try again later.