Laszlo Lovasz

Citata da

	Tutte	Dal 2020
Citazioni	72761	16565
Indice H	113	57
i10-index	322	183

3800

1900

950

2850

1986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025282 262 375 418 444 443 536 704 744 832 792 937 910 981 952 1125 1190 1349 1509 1671 1917 2102 2198 2531 2551 2524 2630 3026 2717 2957 2810 3075 3114 2876 2915 3084 3251 3241 3795 275

Accesso pubblico

Visualizza tutto

36 articoli

2 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Ilan NewmanProfessor of Computer Science, University of HaifaEmail verificata su cs.haifa.ac.il
Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaEmail verificata su cs.ubc.ca
Richard E LadnerUniversity of WashingtonEmail verificata su cs.washington.edu
andras recskiEötvös University, Budapest University of Technology and EconomicsEmail verificata su cs.bme.hu
Igor PakUniversity of California, Los AngelesEmail verificata su math.ucla.edu
Janos KornerProfessor of Computer Science, Sapienza University of RomeEmail verificata su di.uniroma1.it
Tamas VicsekEotvos UniversityEmail verificata su hal.elte.hu
Gergely PallaProfessor, Dept. of Biological Physics, Eötvös UniversityEmail verificata su hal.elte.hu
Tamas SzonyiDept Computer Science, Eotvos UniversityEmail verificata su cs.elte.hu
David AldousEmeritus Professor of Statistics, U.C. BerkeleyEmail verificata su stat.berkeley.edu
Neal E. YoungUniversity of California, RiversideEmail verificata su ucr.edu
Maurice HerlihyAn Wang Professor of Computer Science, Brown UniversityEmail verificata su cs.brown.edu

Segui

Laszlo Lovasz

professor of mathematics, Eotvos University, Budapest

Email verificata su cs.elte.hu - Home page

discrete mathematics combinatorics


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Factoring polynomials with rational coefficients AK Lenstra, HW Lenstra, L Lovász Mathematische annalen 261, 515-534, 1982	6301	1982
Geometric algorithms and combinatorial optimization M Grotschel, L Lovasz, A Schrijver Algorithms and combinatorics, 564, 1988	5585*	1988
Matching theory L Lovász, MD Plummer American Mathematical Soc., 2009	5015	2009
The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981	2774	1981
Random walks on graphs L Lovász Combinatorics, Paul erdos is eighty 2 (1-46), 4, 1993	2711	1993
Combinatorial problems and exercises L Lovász American Mathematical Soc., 2007	2453	2007
On the Shannon capacity of a graph L Lovász IEEE Transactions on Information theory 25 (1), 1-7, 1979	2094	1979
Combinatorial optimization: papers from the DIMACS Special Year W Cook, L Lovász, PD Seymour American Mathematical Soc., 1995	1929	1995
Large networks and graph limits L Lovász American Mathematical Soc., 2012	1731	2012
On the ratio of optimal integral and fractional covers L Lovász Discrete mathematics 13 (4), 383-390, 1975	1461	1975
Submodular functions and convexity L Lovász Mathematical Programming The State of the Art: Bonn 1982, 235-257, 1983	1401	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	1350	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	1288	1991
Limits of dense graph sequences L Lovász, B Szegedy Journal of Combinatorial Theory, Series B 96 (6), 933-957, 2006	1049	2006
Kneser's conjecture, chromatic number, and homotopy L Lovász Journal of Combinatorial Theory, Series A 25 (3), 319-324, 1978	1046	1978
Normal hypergraphs and the perfect graph conjecture L Lovász discrete Mathematics 2 (3), 253-267, 1972	1046	1972
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	845	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	778	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	626	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	583	1993

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori