Laszlo Lovasz

Citirano

	Sve	Od 2019.
Citati	71274	18102
H-indeks	112	58
i10-indeks	318	187

3400

1700

850

2550

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024370 281 262 373 421 438 443 532 687 738 817 794 933 909 983 951 1123 1188 1352 1500 1667 1918 2101 2199 2536 2541 2517 2623 3023 2711 2950 2805 3062 3101 2860 2921 3092 3266 3348 2610

Javni pristup

Prikaži sve

35 članaka

2 članka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Ilan NewmanProfessor of Computer Science, University of HaifaPotvrđena adresa e-pošte na cs.haifa.ac.il
Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaPotvrđena adresa e-pošte na cs.ubc.ca
Richard E LadnerUniversity of WashingtonPotvrđena adresa e-pošte na cs.washington.edu
andras recskiEötvös University, Budapest University of Technology and EconomicsPotvrđena adresa e-pošte na cs.bme.hu
Igor PakDepartment of Mathematics, UCLAPotvrđena adresa e-pošte na math.ucla.edu
Janos KornerProfessor of Computer Science, Sapienza University of RomePotvrđena adresa e-pošte na di.uniroma1.it
Tamas VicsekEotvos UniversityPotvrđena adresa e-pošte na hal.elte.hu
Gergely PallaProfessor, Dept. of Biological Physics, Eötvös UniversityPotvrđena adresa e-pošte na hal.elte.hu
Tamas SzonyiDept Computer Science, Eotvos UniversityPotvrđena adresa e-pošte na cs.elte.hu
David AldousEmeritus Professor of Statistics, U.C. BerkeleyPotvrđena adresa e-pošte na stat.berkeley.edu
Neal E. YoungUniversity of California, RiversidePotvrđena adresa e-pošte na ucr.edu
Maurice HerlihyAn Wang Professor of Computer Science, Brown UniversityPotvrđena adresa e-pošte na cs.brown.edu

Prati

Laszlo Lovasz

professor of mathematics, Eotvos University, Budapest

Potvrđena adresa e-pošte na cs.elte.hu - Početna stranica

discrete mathematics combinatorics


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Factoring polynomials with rational coefficients AK Lenstra, HW Lenstra, L Lovász Mathematische annalen 261, 515-534, 1982	6169	1982
Geometric algorithms and combinatorial optimization M Grotschel, L Lovasz, A Schrijver Algorithms and combinatorics, 564, 1988	5505*	1988
Matching theory L Lovász, MD Plummer American Mathematical Soc., 2009	4924	2009
The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981	2733	1981
Random walks on graphs L Lovász Combinatorics, Paul erdos is eighty 2 (1-46), 4, 1993	2656	1993
Combinatorial problems and exercises L Lovász American Mathematical Soc., 2007	2418	2007
On the Shannon capacity of a graph L Lovász IEEE Transactions on Information theory 25 (1), 1-7, 1979	2039	1979
Combinatorial optimization: papers from the DIMACS Special Year W Cook, L Lovász, PD Seymour American Mathematical Soc., 1995	1916	1995
Large networks and graph limits L Lovász American Mathematical Soc., 2012	1643	2012
On the ratio of optimal integral and fractional covers L Lovász Discrete mathematics 13 (4), 383-390, 1975	1440	1975
Submodular functions and convexity L Lovász Mathematical Programming The State of the Art: Bonn 1982, 235-257, 1983	1378	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	1309	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	1031	1972
Kneser's conjecture, chromatic number, and homotopy L Lovász Journal of Combinatorial Theory, Series A 25 (3), 319-324, 1978	1019	1978
Limits of dense graph sequences L Lovász, B Szegedy Journal of Combinatorial Theory, Series B 96 (6), 933-957, 2006	1012	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	834	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	752	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	563	1993

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori