László Lovász

42.1k citations
255 papers · 20.5k indexed · 13 hit papers · h-index 62

László Lovász

246 papers receiving 18.5k citations

Hit Papers

Large Networks and Gr...523197220261990200850010001.5k

Peers

László Lovász
Comparison fields: 5 of 156
  • Discrete Mathematics and Combinatorics 3.7k
  • Computational Theory and Mathematics 11.2k
  • Computer Graphics and Computer-Aided Design 1.7k
  • Geometry and Topology 3.4k
  • Numerical Analysis 1.2k
Replace Noga Alon with:
Noga Alon Israel
Ronald Graham United States
Alexander Schrijver Netherlands
N. J. A. Sloane United States
Béla Bollobás United States
Fan Chung United States
P. Erdös Hungary
Paul Seymour United States
Charles R. Johnson United States
Robert E. Tarjan United States
László Lovász relative to Noga Alon Israel Noga Alon's profile →
Citations per field
00.5×4.0×
Noga Alon · 1×
Citations per year

Countries citing papers authored by László Lovász

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network

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.

Border = papers with László Lovász Line = papers co-authored together László Lovász links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20241
2 20230
3
A fast new algorithm for weak graph regularity
20190
4
Large Networks and Graph Limitsbreakdown →
2012523
5
Building bridges : between mathematics and computer science
200823
6 20063
7
200657
8 200160
9 200114
10
Handbook of combinatorics (vol. 1)
199614
11
Tools from linear algebra
19967
12
Two-prover one-round proof systems: Their power and their problems
1992111
13
Paths, Flows, and VLSI-Layout
1990187
14
Geometric algorithms and algorithmic geometry
19907
15
Faster Algorithms for Hard Problems.
19891
16
Cones of matrices and setfunctions, and 0-1 optimization
198940
17 198659
18
Matching Theory (North-Holland mathematics studies)
1986178
19
Remarks on a theorem of Redei
198147
20
Algebraic methods in graph theory
1981144

About László Lovász

László Lovász is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Statistics and Probability, having authored 255 papers that have together received 20.5k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (95 papers), Limits and Structures in Graph Theory (52 papers), Complexity and Algorithms in Graphs (42 papers), Graph theory and applications (42 papers), Markov Chains and Monte Carlo Methods (34 papers), Graph Labeling and Dimension Problems (32 papers), graph theory and CDMA systems (29 papers) and Computational Geometry and Mesh Generation (25 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (3.7k citations), Computational Theory and Mathematics (11.2k citations), Computer Graphics and Computer-Aided Design (1.7k citations), Geometry and Topology (3.4k citations) and Numerical Analysis (1.2k citations). László Lovász has collaborated with scholars based in Hungary, United States and Netherlands. Frequent co-authors include Alexander Schrijver, Martin Grötschel, H. W. Lenstra, Ronald Graham, Balázs Szegedy, Miklós Simonovits, Uriel Feige, Santosh Vempala, Anders Björner and Ravi Kannan. Their work appears in journals such as Journal of Combinatorial Theory Series B, COMBINATORICA, European Journal of Combinatorics, Discrete Mathematics and Journal of Graph Theory.

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026