László Lovász
Impact in
- Discrete Mathematics and Combinatorics top 0.01%
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.01%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 117
- Complexity and Algorithms in Graphs 54
- Graph Labeling and Dimension Problems 37
-
- Limits and Structures in Graph Theory 57
- Co-authors
- Alexander Schrijver (32 shared papers)Martin Grötschel (19 shared papers)A. K. Lenstra (2 shared papers)H. W. Lenstra (2 shared papers)Ronald Graham (2 shared papers)Balázs Szegedy (16 shared papers)Miklós Simonovits (8 shared papers)Uriel Feige (6 shared papers)
- Journals
- Journal of Combinatorial Theory Series B (20 papers)COMBINATORICA (11 papers)European Journal of Combinatorics (10 papers)Discrete Mathematics (7 papers)Combinatorics Probability Computing (6 papers)
- Partner nations
- HungaryUnited StatesGermany
In The Last Decade
László Lovász
301 papers receiving 24.9k citations
László Lovász's Hit Papers
Peers
Comparison fields: 5 of 162
- Discrete Mathematics and Combinatorics 4.6k
- Computational Theory and Mathematics 15.4k
- Computer Graphics and Computer-Aided Design 2.6k
- Geometry and Topology 4.1k
- Numerical Analysis 1.6k
Countries citing papers authored by László Lovász
This map shows the geographic impact of László Lovász's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by László Lovász with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites László Lovász more than expected).
Fields of papers citing papers by László Lovász
This network shows the impact of papers produced by László Lovász. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by László Lovász. The network helps show where László Lovász may publish in the future.
Co-authors
The 25 scholars most cited alongside László Lovász, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 312 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Factoring polynomials with rational coefficients Hit paper breakdown → | 1982 | 2743 |
| 2 | Geometric Algorithms and Combinatorial Optimization Hit paper breakdown → | 1988 | 2442 |
| 3 | The ellipsoid method and its consequences in combinatorial optimization Hit paper breakdown → | 1981 | 1367 |
| 4 | Handbook of Combinatorics Hit paper breakdown → | 1995 | 1173 |
| 5 | Random Walks on Graphs: A Survey Hit paper breakdown → | 2001 | 1009 |
| 6 | On the Shannon capacity of a graph Hit paper breakdown → | 1979 | 989 |
| 7 | On the ratio of optimal integral and fractional covers Hit paper breakdown → | 1975 | 782 |
| 8 | Cones of Matrices and Set-Functions and 0–1 Optimization Hit paper breakdown → | 1991 | 686 |
| 9 | Submodular functions and convexity Hit paper breakdown → | 1983 | 661 |
| 10 | Geometric Algorithms and Combinatorial Optimization Hit paper breakdown → | 1993 | 603 |
| 11 | Large Networks and Graph Limits Hit paper breakdown → | 2012 | 576 |
| 12 | Normal hypergraphs and the perfect graph conjecture Hit paper breakdown → | 1972 | 530 |
| 13 | Random walks, universal traversal sequences, and the complexity of maze problems Hit paper breakdown → | 1979 | 517 |
| 14 | Kneser's conjecture, chromatic number, and homotopy Hit paper breakdown → | 1978 | 433 |
| 15 | Limits of dense graph sequences Hit paper breakdown → | 2006 | 390 |
| 16 | 1996 | 320 | |
| 17 | 1989 | 303 | |
| 18 | 1993 | 268 | |
| 19 | 1986 | 259 | |
| 20 | 1972 | 253 |
About László Lovász
László Lovász is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Electrical and Electronic Engineering and Statistics and Probability, having authored 312 papers that have together received 27.4k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (117 papers), Limits and Structures in Graph Theory (57 papers), Complexity and Algorithms in Graphs (54 papers), Graph theory and applications (46 papers), Graph Labeling and Dimension Problems (37 papers), graph theory and CDMA systems (36 papers), Markov Chains and Monte Carlo Methods (35 papers) and Computational Geometry and Mesh Generation (35 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (4.6k citations), Computational Theory and Mathematics (15.4k citations), Computer Graphics and Computer-Aided Design (2.6k citations), Geometry and Topology (4.1k citations) and Numerical Analysis (1.6k citations). László Lovász has collaborated with scholars based in Hungary, United States and Germany. Frequent co-authors include Alexander Schrijver, Martin Grötschel, A. K. Lenstra, H. W. Lenstra, Ronald Graham, Balázs Szegedy, Miklós Simonovits, Uriel Feige, Santosh Vempala and Ravi Kannan. Their work appears in journals such as Journal of Combinatorial Theory Series B, COMBINATORICA, European Journal of Combinatorics, Discrete Mathematics and Combinatorics Probability Computing.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.