Laszlo Lovasz

Cited by

	All	Since 2018
Citations	66227	16069
h-index	108	55
i10-index	306	175

3500

1750

875

2625

1984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023271 350 273 259 347 376 408 439 509 642 679 819 763 902 916 965 953 1117 1205 1395 1524 1734 1936 2138 2265 2492 2545 2569 2655 3048 2751 2937 2893 3095 3105 2866 3023 3232 3495 345

Public access

View all

28 articles

3 articles

available

not available

Based on funding mandates

Co-authors

Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaVerified email at cs.ubc.ca
Richard E LadnerUniversity of WashingtonVerified email at cs.washington.edu
Ilan NewmanProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
andras recskiEötvös University, Budapest University of Technology and EconomicsVerified email at cs.bme.hu
Igor PakDepartment of Mathematics, UCLAVerified email at math.ucla.edu
Janos KornerProfessor of Computer Science, Sapienza University of RomeVerified email at di.uniroma1.it
Tamas VicsekEotvos UniversityVerified email at hal.elte.hu
Gergely PallaScientific advisor, MTA-ELTE Statistical and Biological Physics Research Group, EötvösVerified email at hal.elte.hu
Tamas SzonyiDept Computer Science, Eotvos UniversityVerified email at cs.elte.hu
David AldousEmeritus Professor of Statistics, U.C. BerkeleyVerified email at stat.berkeley.edu
Neal E. YoungUniversity of California, RiversideVerified email at ucr.edu
Maurice HerlihyAn Wang Professor of Computer Science, Brown UniversityVerified email at cs.brown.edu

Laszlo Lovasz

professor of mathematics, Eotvos University, Budapest

Verified email at cs.elte.hu - Homepage

discrete mathematics combinatorics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Factoring polynomials with rational coefficients AK Lenstra, HW Lenstra, L Lovász Mathematische annalen 261 (ARTICLE), 515-534, 1982	5708	1982
Geometric algorithms and combinatorial optimization M Grotschel, L Lovasz, A Schrijver Algorithms and combinatorics, 564, 1988	5135*	1988
Matching theory L Lovász, MD Plummer American Mathematical Soc., 2009	4587	2009
The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981	2559	1981
Random walks on graphs L Lovász Combinatorics, Paul erdos is eighty 2 (1-46), 4, 1993	2506	1993
Combinatorial problems and exercises L Lovász American Mathematical Soc., 1993	2247	1993
On the Shannon capacity of a graph L Lovász IEEE Transactions on Information theory 25 (1), 1-7, 1979	1874	1979
Combinatorial optimization: papers from the DIMACS Special Year W Cook, L Lovász, PD Seymour American Mathematical Soc., 1995	1770	1995
On the ratio of optimal integral and fractional covers L Lovász Discrete mathematics 13 (4), 383-390, 1975	1354	1975
Large networks and graph limits L Lovász American Mathematical Soc., 2012	1311	2012
Submodular functions and convexity L Lovász Mathematical Programming The State of the Art: Bonn 1982, 235-257, 1983	1264	1983
Cones of matrices and set-functions and 0–1 optimization L Lovász, A Schrijver SIAM journal on optimization 1 (2), 166-190, 1991	1237	1991
Problems and results on 3-chromatic hypergraphs and some related questions P Erdos, L Lovász Infinite and finite sets 10 (2), 609-627, 1975	1189	1975
Normal hypergraphs and the perfect graph conjecture L Lovász discrete Mathematics 2 (3), 253-267, 1972	973	1972
Kneser's conjecture, chromatic number, and homotopy L Lovász Journal of Combinatorial Theory, Series A 25 (3), 319-324, 1978	919	1978
Limits of dense graph sequences L Lovász, B Szegedy Journal of Combinatorial Theory, Series B 96 (6), 933-957, 2006	878	2006
Random walks, universal traversal sequences, and the complexity of maze problems R Aleliunas, RM Karp, RJ Lipton, L Lovász, C Rackoff 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 218-223, 1979	808	1979
Handbook of Combinatorics Volume 1 RL Graham, M Grötschel, L Lovász, L Lovász Elsevier, 1995	688	1995
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing C Borgs, JT Chayes, L Lovász, VT Sós, K Vesztergombi Advances in Mathematics 219 (6), 1801-1851, 2008	663	2008
Approximating clique is almost NP-complete U Feige, S Goldwasser, L Lovász, S Safra, M Szegedy [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science …, 1991	594	1991

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors