Laszlo Lovasz

Navedeno

	Vse	Od leta 2019
Navedbe	72365	19036
indeks h	113	59
indeks i10	321	192

3700

1850

925

2775

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024370 281 263 375 422 439 445 533 693 742 825 794 934 910 981 952 1129 1190 1351 1503 1673 1918 2101 2198 2533 2543 2524 2630 3024 2715 2958 2808 3075 3108 2872 2922 3082 3256 3283 3615

Javni dostop

Prikaži vse

36 člankov

2 članka

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Ilan NewmanProfessor of Computer Science, University of HaifaPreverjeni e-poštni naslov na cs.haifa.ac.il
Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaPreverjeni e-poštni naslov na cs.ubc.ca
Richard E LadnerUniversity of WashingtonPreverjeni e-poštni naslov na cs.washington.edu
andras recskiEötvös University, Budapest University of Technology and EconomicsPreverjeni e-poštni naslov na cs.bme.hu
Igor PakUniversity of California, Los AngelesPreverjeni e-poštni naslov na math.ucla.edu
Janos KornerProfessor of Computer Science, Sapienza University of RomePreverjeni e-poštni naslov na di.uniroma1.it
Tamas VicsekEotvos UniversityPreverjeni e-poštni naslov na hal.elte.hu
Gergely PallaProfessor, Dept. of Biological Physics, Eötvös UniversityPreverjeni e-poštni naslov na hal.elte.hu
Tamas SzonyiDept Computer Science, Eotvos UniversityPreverjeni e-poštni naslov na cs.elte.hu
David AldousEmeritus Professor of Statistics, U.C. BerkeleyPreverjeni e-poštni naslov na stat.berkeley.edu
Neal E. YoungUniversity of California, RiversidePreverjeni e-poštni naslov na ucr.edu
Maurice HerlihyAn Wang Professor of Computer Science, Brown UniversityPreverjeni e-poštni naslov na cs.brown.edu

Spremljaj

Laszlo Lovasz

professor of mathematics, Eotvos University, Budapest

Preverjeni e-poštni naslov na cs.elte.hu - Domača stran

discrete mathematics combinatorics


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Factoring polynomials with rational coefficients AK Lenstra, HW Lenstra, L Lovász Mathematische annalen 261, 515-534, 1982	6275	1982
Geometric algorithms and combinatorial optimization M Grotschel, L Lovasz, A Schrijver Algorithms and combinatorics, 564, 1988	5574*	1988
Matching theory L Lovász, MD Plummer American Mathematical Soc., 2009	4987	2009
The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981	2762	1981
Random walks on graphs L Lovász Combinatorics, Paul erdos is eighty 2 (1-46), 4, 1993	2694	1993
Combinatorial problems and exercises L Lovász American Mathematical Soc., 2007	2447	2007
On the Shannon capacity of a graph L Lovász IEEE Transactions on Information theory 25 (1), 1-7, 1979	2076	1979
Combinatorial optimization: papers from the DIMACS Special Year W Cook, L Lovász, PD Seymour American Mathematical Soc., 1995	1924	1995
Large networks and graph limits L Lovász American Mathematical Soc., 2012	1710	2012
On the ratio of optimal integral and fractional covers L Lovász Discrete mathematics 13 (4), 383-390, 1975	1452	1975
Submodular functions and convexity L Lovász Mathematical Programming The State of the Art: Bonn 1982, 235-257, 1983	1395	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	1338	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	1283	1991
Limits of dense graph sequences L Lovász, B Szegedy Journal of Combinatorial Theory, Series B 96 (6), 933-957, 2006	1040	2006
Normal hypergraphs and the perfect graph conjecture L Lovász discrete Mathematics 2 (3), 253-267, 1972	1038	1972
Kneser's conjecture, chromatic number, and homotopy L Lovász Journal of Combinatorial Theory, Series A 25 (3), 319-324, 1978	1037	1978
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	841	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	770	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	576	1993

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji