Laszlo Lovasz

Cited by

	All	Since 2019
Citations	71611	18400
h-index	112	58
i10-index	318	189

3400

1700

850

2550

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024370 281 262 375 422 439 443 532 689 738 821 793 933 909 983 951 1123 1189 1348 1505 1669 1915 2102 2197 2534 2542 2523 2628 3019 2712 2954 2806 3061 3104 2868 2917 3086 3268 3307 2949

Public access

View all

35 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Ilan NewmanProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
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
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 PallaProfessor, Dept. of Biological Physics, Eötvös UniversityVerified 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, 515-534, 1982	6202	1982
Geometric algorithms and combinatorial optimization M Grotschel, L Lovasz, A Schrijver Algorithms and combinatorics, 564, 1988	5521*	1988
Matching theory L Lovász, MD Plummer American Mathematical Soc., 2009	4949	2009
The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981	2743	1981
Random walks on graphs L Lovász Combinatorics, Paul erdos is eighty 2 (1-46), 4, 1993	2672	1993
Combinatorial problems and exercises L Lovász American Mathematical Soc., 2007	2428	2007
On the Shannon capacity of a graph L Lovász IEEE Transactions on Information theory 25 (1), 1-7, 1979	2048	1979
Combinatorial optimization: papers from the DIMACS Special Year W Cook, L Lovász, PD Seymour American Mathematical Soc., 1995	1920	1995
Large networks and graph limits L Lovász American Mathematical Soc., 2012	1661	2012
On the ratio of optimal integral and fractional covers L Lovász Discrete mathematics 13 (4), 383-390, 1975	1442	1975
Submodular functions and convexity L Lovász Mathematical Programming The State of the Art: Bonn 1982, 235-257, 1983	1383	1983
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	1317	1975
Cones of matrices and set-functions and 0–1 optimization L Lovász, A Schrijver SIAM journal on optimization 1 (2), 166-190, 1991	1279	1991
Normal hypergraphs and the perfect graph conjecture L Lovász discrete Mathematics 2 (3), 253-267, 1972	1034	1972
Kneser's conjecture, chromatic number, and homotopy L Lovász Journal of Combinatorial Theory, Series A 25 (3), 319-324, 1978	1025	1978
Limits of dense graph sequences L Lovász, B Szegedy Journal of Combinatorial Theory, Series B 96 (6), 933-957, 2006	1021	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	835	1979
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	756	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	623	1991
Random walks in a convex body and an improved volume algorithm L Lovász, M Simonovits Random structures & algorithms 4 (4), 359-412, 1993	569	1993

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