Laszlo Lovasz

Получаване на мой собствен потребителски профил

Позовавания

	Всички	От 2019
Позовавания	72294	18975
h-индекс	113	59
i10-индекс	321	192

3600

1800

900

2700

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024370 281 262 375 422 439 445 533 693 742 825 793 934 910 986 952 1129 1190 1351 1502 1673 1917 2101 2199 2533 2542 2524 2630 3024 2715 2956 2807 3074 3110 2874 2915 3084 3260 3285 3551

Публичен достъп

Преглед на всички

36 статии

2 статии

налични

неналични

Въз основа на изисквания при финансирането

Съавтори

Ilan NewmanProfessor of Computer Science, University of HaifaПотвърден имейл адрес: cs.haifa.ac.il
Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaПотвърден имейл адрес: cs.ubc.ca
Richard E LadnerUniversity of WashingtonПотвърден имейл адрес: cs.washington.edu
andras recskiEötvös University, Budapest University of Technology and EconomicsПотвърден имейл адрес: cs.bme.hu
Igor PakUniversity of California, Los AngelesПотвърден имейл адрес: math.ucla.edu
Janos KornerProfessor of Computer Science, Sapienza University of RomeПотвърден имейл адрес: di.uniroma1.it
Tamas VicsekEotvos UniversityПотвърден имейл адрес: hal.elte.hu
Gergely PallaProfessor, Dept. of Biological Physics, Eötvös UniversityПотвърден имейл адрес: hal.elte.hu
Tamas SzonyiDept Computer Science, Eotvos UniversityПотвърден имейл адрес: cs.elte.hu
David AldousEmeritus Professor of Statistics, U.C. BerkeleyПотвърден имейл адрес: stat.berkeley.edu
Neal E. YoungUniversity of California, RiversideПотвърден имейл адрес: ucr.edu
Maurice HerlihyAn Wang Professor of Computer Science, Brown UniversityПотвърден имейл адрес: cs.brown.edu

Следене

Laszlo Lovasz

professor of mathematics, Eotvos University, Budapest

Потвърден имейл адрес: cs.elte.hu - Начална страница

discrete mathematics combinatorics


Заглавие Сортиране по цитати Сортиране по година Сортиране по заглавие	Позовавания Позовавания	Година
Factoring polynomials with rational coefficients AK Lenstra, HW Lenstra, L Lovász Mathematische annalen 261, 515-534, 1982	6263	1982
Geometric algorithms and combinatorial optimization M Grotschel, L Lovasz, A Schrijver Algorithms and combinatorics, 564, 1988	5570*	1988
Matching theory L Lovász, MD Plummer American Mathematical Soc., 2009	4986	2009
The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981	2763	1981
Random walks on graphs L Lovász Combinatorics, Paul erdos is eighty 2 (1-46), 4, 1993	2691	1993
Combinatorial problems and exercises L Lovász American Mathematical Soc., 2007	2445	2007
On the Shannon capacity of a graph L Lovász IEEE Transactions on Information theory 25 (1), 1-7, 1979	2073	1979
Combinatorial optimization: papers from the DIMACS Special Year W Cook, L Lovász, PD Seymour American Mathematical Soc., 1995	1926	1995
Large networks and graph limits L Lovász American Mathematical Soc., 2012	1708	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	1337	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	1039	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	769	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	625	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	575	1993

Системата не може да изпълни операцията сега. Опитайте отново по-късно.

Статии 1–20

Позовавания годишно

Дублирани описания

Обединени библиографски описания

Добавяне на съавториСъавтори

Следене

Позовавания

Съавтори