Laszlo Lovasz

Citado por

	Todos	Desde 2019
Citações	72104	18818
Índice h	113	59
Índice i10	318	191

3400

1700

850

2550

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024370 281 263 375 422 439 445 534 691 741 825 794 934 910 981 952 1128 1190 1351 1506 1669 1917 2102 2199 2534 2541 2523 2631 3024 2715 2954 2806 3072 3110 2871 2915 3088 3265 3285 3389

Acesso público

Ver todos

36 artigos

2 artigos

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Ilan NewmanProfessor of Computer Science, University of HaifaE-mail confirmado em cs.haifa.ac.il
Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaE-mail confirmado em cs.ubc.ca
Richard E LadnerUniversity of WashingtonE-mail confirmado em cs.washington.edu
andras recskiEötvös University, Budapest University of Technology and EconomicsE-mail confirmado em cs.bme.hu
Igor PakDepartment of Mathematics, UCLAE-mail confirmado em math.ucla.edu
Janos KornerProfessor of Computer Science, Sapienza University of RomeE-mail confirmado em di.uniroma1.it
Tamas VicsekEotvos UniversityE-mail confirmado em hal.elte.hu
Gergely PallaProfessor, Dept. of Biological Physics, Eötvös UniversityE-mail confirmado em hal.elte.hu
Tamas SzonyiDept Computer Science, Eotvos UniversityE-mail confirmado em cs.elte.hu
David AldousEmeritus Professor of Statistics, U.C. BerkeleyE-mail confirmado em stat.berkeley.edu
Neal E. YoungUniversity of California, RiversideE-mail confirmado em ucr.edu
Maurice HerlihyAn Wang Professor of Computer Science, Brown UniversityE-mail confirmado em cs.brown.edu

Seguir

Laszlo Lovasz

professor of mathematics, Eotvos University, Budapest

E-mail confirmado em cs.elte.hu - Página inicial

discrete mathematics combinatorics


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Factoring polynomials with rational coefficients AK Lenstra, HW Lenstra, L Lovász Mathematische annalen 261, 515-534, 1982	6245	1982
Geometric algorithms and combinatorial optimization M Grotschel, L Lovasz, A Schrijver Algorithms and combinatorics, 564, 1988	5548*	1988
Matching theory L Lovász, MD Plummer American Mathematical Soc., 2009	4981	2009
The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981	2760	1981
Random walks on graphs L Lovász Combinatorics, Paul erdos is eighty 2 (1-46), 4, 1993	2684	1993
Combinatorial problems and exercises L Lovász American Mathematical Soc., 2007	2438	2007
On the Shannon capacity of a graph L Lovász IEEE Transactions on Information theory 25 (1), 1-7, 1979	2069	1979
Combinatorial optimization: papers from the DIMACS Special Year W Cook, L Lovász, PD Seymour American Mathematical Soc., 1995	1925	1995
Large networks and graph limits L Lovász American Mathematical Soc., 2012	1699	2012
On the ratio of optimal integral and fractional covers L Lovász Discrete mathematics 13 (4), 383-390, 1975	1450	1975
Submodular functions and convexity L Lovász Mathematical Programming The State of the Art: Bonn 1982, 235-257, 1983	1393	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	1332	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	1282	1991
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	1035	1978
Limits of dense graph sequences L Lovász, B Szegedy Journal of Combinatorial Theory, Series B 96 (6), 933-957, 2006	1032	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	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	766	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	622	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	574	1993

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores