Laszlo Lovasz

Citeret af

	Alle	Siden 2020
Henvisninger	72915	16707
h-index	113	57
i10-indeks	322	183

3800

1900

950

2850

1986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025282 263 375 418 446 444 536 705 744 834 793 937 911 981 953 1124 1192 1351 1509 1671 1915 2103 2201 2547 2541 2527 2628 3019 2724 2957 2811 3077 3112 2874 2913 3080 3258 3243 3790 419

Offentlig adgang

Se alle

36 artikler

3 artikler

tilgængelige

ikke tilgængelige

Baseret på krav i forbindelse med finansiering

Medforfattere

Ilan NewmanProfessor of Computer Science, University of HaifaVerificeret mail på cs.haifa.ac.il
Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaVerificeret mail på cs.ubc.ca
Richard E LadnerUniversity of WashingtonVerificeret mail på cs.washington.edu
andras recskiEötvös University, Budapest University of Technology and EconomicsVerificeret mail på cs.bme.hu
Igor PakUniversity of California, Los AngelesVerificeret mail på math.ucla.edu
Janos KornerProfessor of Computer Science, Sapienza University of RomeVerificeret mail på di.uniroma1.it
Tamas VicsekEotvos UniversityVerificeret mail på hal.elte.hu
Gergely PallaProfessor, Dept. of Biological Physics, Eötvös UniversityVerificeret mail på hal.elte.hu
Tamas SzonyiDept Computer Science, Eotvos UniversityVerificeret mail på cs.elte.hu
David AldousEmeritus Professor of Statistics, U.C. BerkeleyVerificeret mail på stat.berkeley.edu
Neal E. YoungUniversity of California, RiversideVerificeret mail på ucr.edu
Maurice HerlihyAn Wang Professor of Computer Science, Brown UniversityVerificeret mail på cs.brown.edu

Følg

Laszlo Lovasz

professor of mathematics, Eotvos University, Budapest

Verificeret mail på cs.elte.hu - Startside

discrete mathematics combinatorics


Titel Sortér efter henvisninger Sortér efter årstal Sortér efter titel	Citeret af Citeret af	År
Factoring polynomials with rational coefficients AK Lenstra, HW Lenstra, L Lovász Mathematische annalen 261, 515-534, 1982	6314	1982
Geometric algorithms and combinatorial optimization M Grotschel, L Lovasz, A Schrijver Algorithms and combinatorics, 564, 1988	5588*	1988
Matching theory L Lovász, MD Plummer American Mathematical Soc., 2009	5024	2009
The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981	2778	1981
Random walks on graphs L Lovász Combinatorics, Paul erdos is eighty 2 (1-46), 4, 1993	2718	1993
Combinatorial problems and exercises L Lovász American Mathematical Soc., 2007	2458	2007
On the Shannon capacity of a graph L Lovász IEEE Transactions on Information theory 25 (1), 1-7, 1979	2099	1979
Combinatorial optimization: papers from the DIMACS Special Year W Cook, L Lovász, PD Seymour American Mathematical Soc., 1995	1932	1995
Large networks and graph limits L Lovász American Mathematical Soc., 2012	1741	2012
On the ratio of optimal integral and fractional covers L Lovász Discrete mathematics 13 (4), 383-390, 1975	1463	1975
Submodular functions and convexity L Lovász Mathematical Programming The State of the Art: Bonn 1982, 235-257, 1983	1404	1983
Problems and results on 3-chromatic hypergraphs and some related questions P Erdős (No Title), 609, 1975	1351	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	1287	1991
Limits of dense graph sequences L Lovász, B Szegedy Journal of Combinatorial Theory, Series B 96 (6), 933-957, 2006	1054	2006
Kneser's conjecture, chromatic number, and homotopy L Lovász Journal of Combinatorial Theory, Series A 25 (3), 319-324, 1978	1052	1978
Normal hypergraphs and the perfect graph conjecture L Lovász discrete Mathematics 2 (3), 253-267, 1972	1048	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	782	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	624	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	586	1993

Systemet kan ikke foretage handlingen nu. Prøv igen senere.

Artikler 1–20

Henvisninger pr. år

Dublerede henvisninger

Flettede henvisninger

Tilføj medforfattereMedforfattere

Følg

Citeret af

Medforfattere