متابعة
Laszlo Lovasz
Laszlo Lovasz
professor of mathematics, Eotvos University, Budapest
بريد إلكتروني تم التحقق منه على cs.elte.hu - الصفحة الرئيسية
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
Factoring polynomials with rational coefficients‏
AK Lenstra, HW Lenstra, L Lovász‏
Springer Verlag 261, 515-534, 1982‏
63611982
Geometric algorithms and combinatorial optimization‏
M Grotschel, L Lovasz, A Schrijver‏
Algorithms and combinatorics, 564, 1988‏
5596*1988
Matching theory‏
L Lovász, MD Plummer‏
American Mathematical Soc., 2009‏
50082009
Random walks on graphs‏
L Lovász‏
Combinatorics, Paul erdos is eighty 2 (1-46), 4, 1993‏
28031993
The ellipsoid method and its consequences in combinatorial optimization‏
M Grötschel, L Lovász, A Schrijver‏
Combinatorica 1, 169-197, 1981‏
27741981
Combinatorial problems and exercises‏
L Lovász‏
American Mathematical Soc., 2007‏
24782007
On the Shannon capacity of a graph‏
L Lovász‏
IEEE Transactions on Information theory 25 (1), 1-7, 1979‏
21061979
Combinatorial optimization: papers from the DIMACS Special Year‏
W Cook, L Lovász, PD Seymour‏
American Mathematical Soc., 1995‏
19231995
Large networks and graph limits‏
L Lovász‏
American Mathematical Soc., 2012‏
18432012
On the ratio of optimal integral and fractional covers‏
L Lovász‏
Discrete mathematics 13 (4), 383-390, 1975‏
14661975
Submodular functions and convexity‏
L Lovász‏
Mathematical Programming The State of the Art: Bonn 1982, 235-257, 1983‏
14201983
Problems and results on 3-chromatic hypergraphs and some related questions‏
P Erdős‏
(No Title), 609, 1975‏
13631975
Cones of matrices and set-functions and 0–1 optimization‏
L Lovász, A Schrijver‏
SIAM journal on optimization 1 (2), 166-190, 1991‏
12961991
Kneser's conjecture, chromatic number, and homotopy‏
L Lovász‏
Journal of Combinatorial Theory, Series A 25 (3), 319-324, 1978‏
10621978
Limits of dense graph sequences‏
L Lovász, B Szegedy‏
Journal of Combinatorial Theory, Series B 96 (6), 933-957, 2006‏
10552006
Normal hypergraphs and the perfect graph conjecture‏
L Lovász‏
discrete Mathematics 2 (3), 253-267, 1972‏
10441972
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‏
8521979
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‏
7862008
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‏
6321991
Random walks in a convex body and an improved volume algorithm‏
L Lovász, M Simonovits‏
Random structures & algorithms 4 (4), 359-412, 1993‏
5881993
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20