Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
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).
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 of co-authors of László Lovász
This figure shows the co-authorship network connecting the top 25 collaborators of László Lovász.
A scholar is included among the top collaborators of László Lovász based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with László Lovász. László Lovász is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Lovász, László. (2024). The matroid of a graphing. Journal of Combinatorial Theory Series B. 169. 542–560.1 indexed citations
Lovász, László & Yufei Zhao. (2019). A fast new algorithm for weak graph regularity. DSpace@MIT (Massachusetts Institute of Technology).
4.
Lovász, László. (2012). Large Networks and Graph Limits.523 indexed citations breakdown →
5.
Lovász, László, Martin Grötschel, & Gyula Y. Katona. (2008). Building bridges : between mathematics and computer science. Springer eBooks.23 indexed citations
Graham, Ronald, Martin Grötschel, & László Lovász. (1996). Handbook of combinatorics (vol. 1). MIT Press eBooks.14 indexed citations
11.
Godsil, Chris & László Lovász. (1996). Tools from linear algebra. MIT Press eBooks. 1705–1748.7 indexed citations
12.
Feige, Uriel & László Lovász. (1992). Two-prover one-round proof systems: Their power and their problems.111 indexed citations
13.
Schrijver, Alexander, László Lovász, Bernhard Körte, Hans Jürgen Prömel, & R. L. Graham. (1990). Paths, Flows, and VLSI-Layout. Springer eBooks.187 indexed citations
14.
Lovász, László. (1990). Geometric algorithms and algorithmic geometry.7 indexed citations
15.
Lovász, László. (1989). Faster Algorithms for Hard Problems.. IFIP Congress. 135–141.1 indexed citations
16.
Lovász, László & Alexander Schrijver. (1989). Cones of matrices and setfunctions, and 0-1 optimization. Data Archiving and Networked Services (DANS). 1–35.40 indexed citations
17.
Alon, Noga, Péter Frankl, & László Lovász. (1986). The chromatic number of Kneser hypergraphs. Transactions of the American Mathematical Society. 298(1). 359–370.59 indexed citations
Lovász, László & Alexander Schrijver. (1981). Remarks on a theorem of Redei. Studia Scientiarum Mathematicarum Hungarica. 16. 449–454.47 indexed citations
20.
Lovász, László & Vera T. Sós. (1981). Algebraic methods in graph theory. North-Holland eBooks.144 indexed citations
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.