László Lovász

Q: What Schools Are Affiliated With László Lovász

László Lovász is affiliated with the following schools: Yale University, Eötvös Loránd University

László Lovász's AcademicInfluence.com Rankings

László Lovász

Mathematics

#44

World Rank

#136

Historical Rank

Graph Theory

World Rank

Historical Rank

Combinatorics

World Rank

Historical Rank

Measure Theory

#119

World Rank

#189

Historical Rank

mathematics Degrees

Download Badge

Mathematics

László Lovász's Degrees

PhD Mathematics Eötvös Loránd University

Why Is László Lovász Influential?

(Suggest an Edit or Addition)

According to Wikipedia, László Lovász is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020.

(See a Problem?)

László Lovász's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Factoring polynomials with rational coefficients (1982) (4126)
Geometric Algorithms and Combinatorial Optimization (1988) (2175)
The ellipsoid method and its consequences in combinatorial optimization (1981) (2072)
Combinatorial problems and exercises (1979) (1659)
On the Shannon capacity of a graph (1979) (1637)
Cones of Matrices and Set-Functions and 0-1 Optimization (1991) (1176)
On the ratio of optimal integral and fractional covers (1975) (1155)
Handbook of Combinatorics (1995) (1141)
Submodular functions and convexity (1982) (1035)
Random Walks on Graphs: A Survey (2001) (913)
Kneser's Conjecture, Chromatic Number, and Homotopy (1978) (818)
Limits of dense graph sequences (2004) (817)
Random walks, universal traversal sequences, and the complexity of maze problems (1979) (688)
Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing (2007) (571)
Approximating clique is almost NP-complete (1991) (468)
Interactive proofs and the hardness of approximating cliques (1996) (465)
Random Walks in a Convex Body and an Improved Volume Algorithm (1993) (454)
Normal hypergraphs and the perfect graph conjecture (1972) (448)
Isoperimetric problems for convex bodies and a localization lemma (1995) (444)
A Characterization of Perfect Graphs (1972) (374)
Polynomial Algorithms for Perfect Graphs (1984) (372)
The geometry of logconcave functions and sampling algorithms (2007) (372)
Algorithmic theory of numbers, graphs and convexity (1986) (369)
Large Networks and Graph Limits (2012) (360)
Matching Theory (North-Holland mathematics studies) (1986) (340)
Chip-firing Games on Graphs (1991) (312)
On determinants, matchings, and random algorithms (1979) (306)
Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics (2012) (288)
Simulated annealing in convex bodies and an O*(n4) volume algorithm (2006) (283)
On Generic Rigidity in the Plane (1982) (274)
Hit-and-run from a corner (2004) (263)
Random walks and an O * ( n 5 ) volume algorithm for convex bodies (1997) (259)
Szemerédi’s Lemma for the Analyst (2007) (255)
Two-prover one-round proof systems: their power and their problems (extended abstract) (1992) (248)
Hit-and-run mixes fast (1999) (247)
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume (1990) (239)
Random walks and an O*(n5) volume algorithm for convex bodies (1997) (231)
Operations with structures (1967) (213)
On the eigenvalues of trees (1973) (212)
Theory of algorithms (1985) (211)
Distance Matrix Polynomials of Trees (1978) (205)
Counting Graph Homomorphisms (2006) (196)
Three short proofs in graph theory (1975) (193)
Graph limits and parameter testing (2006) (188)
Dissection Graphs of Planar Point Sets (1973) (184)
Reflection positivity, rank connectivity, and homomorphism of graphs (2004) (184)
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization (2006) (173)
Paths, Flows, and VLSI-Layout (1990) (167)
Matroid matching and some applications (1980) (166)
Proving integrality gaps without knowing the linear program (2002) (166)
Matching structure and the matching lattice (1987) (165)
Annals of Discrete Mathematics (1986) (159)
Approximating Min Sum Set Cover (2004) (158)
On chromatic number of finite set-systems (1968) (156)
On some connectivity properties of Eulerian graphs (1976) (155)
An on-line graph coloring algorithm with sublinear performance ratio (1989) (155)
Nowhere-zero 3-flows and modulo k-orientations (2013) (144)
Moments of Two-Variable Functions and the Uniqueness of Graph Limits (2008) (143)
On two minimax theorems in graph (1976) (143)
A homology theory for spanning tress of a graph (1977) (143)
Chessboard Complexes and Matching Complexes (1994) (141)
ON GRAPHS OF RAMSEY TYPE (1976) (137)
Semi-matchings for bipartite graphs and load balancing (2003) (134)
Chip-Firing Games on Directed Graphs (1992) (131)
Discrepancy of Set-systems and Matrices (1986) (131)
Subgraphs with prescribed valencies (1970) (131)
Orthogonal representations and connectivity of graphs (1989) (129)
On the number of complete subgraphs of a graph II (1983) (129)
Relaxations of vertex packing (1986) (128)
Semidefinite Programs and Combinatorial Optimization (2003) (127)
Lifting Markov chains to speed up mixing (1999) (125)
Stable sets and polynomials (1994) (124)
On the number of halving planes (1989) (123)
Unextendible Product Bases (2001) (122)
Lattices, mobius functions and communications complexity (1988) (120)
Linear decision trees: volume estimates and topological bounds (1992) (119)
Brick decompositions and the matching rank of graphs (1982) (117)
Faster mixing via average conductance (1999) (110)
Entropy splitting for antiblocking corners and perfect graphs (1990) (109)
The Generalized Basis Reduction Algorithm (1990) (108)
The Colin de Verdière graph parameter (1999) (108)
On the structure of factorizable graphs (1972) (105)
Covering Minima and Lattice Point Free Convex Bodies (1986) (104)
Remarks on a theorem of Redei (1981) (104)
Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers (1984) (102)
Left and right convergence of graphs with bounded degree (2010) (101)
Mathematical Structures Underlying Greedy Algorithms (1981) (99)
Rubber bands, convex embeddings and graph connectivity (1988) (99)
The factorization of graphs. II (1972) (97)
A Monte-Carlo Algorithm for Estimating the Permanent (1993) (96)
Multifractal network generator (2010) (95)
Spectra of graphs with transitive groups (1975) (94)
Mixing of random walks and other diffusions on a graph (1995) (93)
On Conway's Thrackle Conjecture (1995) (92)
Generalized quasirandom graphs (2008) (92)
Khachiyan’s algorithm for linear programming (1981) (91)
A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs (1998) (86)
Mixing times (1997) (86)
Applications of product colouring (1974) (85)
Testing properties of graphs and functions (2008) (84)
Algebraic methods in graph theory (1981) (82)
Singular spaces of matrices and their application in combinatorics (1989) (81)
Very large graphs (2009) (80)
Ear-decompositions of matching-covered graphs (1983) (77)
Linear decision trees, subspace arrangements and Möbius functions (1994) (77)
On the cancellation law among finite relational structures (1971) (76)
A note on the line reconstruction problem (1972) (75)
Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm (2003) (75)
Limits of locally–globally convergent graph sequences (2014) (72)
Combinatorial problems and exercises (2. ed.) (1993) (71)
Disks, balls, and walls: analysis of a combinatorial game (1989) (70)
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding (2005) (70)
Greedoids - A Structural Framework for the Greedy Algorithm (1984) (70)
2-Matchings and 2-covers of hypergraphs (1975) (69)
Covering minima and lattice-point-free convex bodies (1988) (69)
Mengerian theorems for paths of bounded length (1978) (68)
The chromatic number of kneser hypergraphs (1986) (68)
Search problems in the decision tree model (1991) (67)
On the randomized complexity of volume and diameter (1992) (66)
Computing ears and branchings in parallel (1985) (66)
Limits of randomly grown graph sequences (2009) (64)
The Colin de Verdière number and sphere representations of a graph (1997) (64)
The rank and size of graphs (1996) (64)
Mixing times for uniformly ergodic Markov chains (1997) (62)
Geometric representations of graphs (2014) (61)
Finite and infinite sets (1984) (61)
Finitely forcible graphons (2009) (60)
Combinatorics in computer science (1996) (60)
Hit-and-Run is Fast and Fun ∗ (2002) (59)
The rank of connection matrices and the dimension of graph algebras (2004) (59)
Discrete analytic functions: An exposition (2004) (59)
Every directed graph has a semi-kernel (1974) (57)
Normal Hypergraphs and the Weak Perfect Graph Conjecture (1984) (57)
Communication Complexity and Combinatorial Lattice Theory (1993) (56)
Homotopy properties of greedoids (1985) (56)
On a product dimension of graphs (1980) (56)
Graph Theory and Integer Programming (1979) (55)
Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization” (1984) (55)
A forbidden substructure characterization of Gauss codes (1976) (54)
Structural properties of greedoids (1983) (52)
Graph minor theory (2005) (52)
The cover time, the blanket time, and the Matthews bound (2000) (52)
Efficient stopping rules for Markov chains (1995) (51)
Deterministic and randomized polynomial-time approximation of radii (2001) (51)
The Membership Problem in Jump Systems (1997) (51)
A correction: orthogonal representations and connectivity of graphs (2000) (50)
A generalization of Kónig's theorem (1970) (50)
Khachian's Algorithm for Linear Programming. (1979) (49)
Research trends in combinatorial optimization: Bonn 2008 (2009) (49)
A note on perfect graphs (1986) (48)
On a Family of Planar Bicritical Graphs (1975) (48)
Handbook of combinatorics (vol. 1) (1996) (47)
Graphs and Geometry (2019) (46)
On the null space of a Colin de Verdière matrix (1999) (45)
On integer points in polyhedra: A lower bound (1992) (45)
Blocking Conductance and Mixing in Random Walks (2006) (45)
Approximate Counting and Quantum Computation (2005) (45)
Exact Mixing in an Unknown Markov Chain (1995) (44)
Cycles through specified vertices of a graph (1981) (43)
On decomposition of graphs (1966) (43)
Geometric Methods in Combinatorial Optimization (1984) (42)
Lecture Notes on Evasiveness of Graph Properties (2002) (42)
Strong Independence of Graphcopy Functions (1979) (42)
Steinitz Representations of Polyhedra and the Colin de Verdière Number (2001) (40)
Minimax theorems for hypergraphs (1974) (39)
The Shapes of Polyhedra (1990) (38)
On minimal elementary bipartite graphs (1977) (38)
Greedoids and Linear Objective Functions (1984) (37)
On some combinatorial properties of algebraic matroids (1987) (36)
Local versus global properties of metric spaces (2006) (35)
Combinatorial optimization (1996) (35)
Approximation of diameters: randomization doesn't help (1998) (35)
More Sets, Graphs and Numbers (2006) (34)
Lengths of cycles in halin graphs (1985) (34)
Strong independence of graph copy functions (1978) (34)
(Almost) Tight bounds and existence theorems for single-commodity confluent flows (2007) (33)
Some Remarks on Generalized Spectra (1977) (33)
Valencies of graphs with 1-factors (1974) (32)
A tight lower bound for Szemerédi’s regularity lemma (2014) (31)
Contractors and connectors of graph algebras (2005) (30)
Factoring polynomials with rational coefficients : (preprint) (1982) (28)
A tight bound for Green's arithmetic triangle removal lemma in vector spaces (2016) (27)
Harmonic and analytic functions on graphs (2003) (27)
Gastric cytoprotective effects of vitamin A and other carotenoids. (1983) (27)
Critical Facets of the Stable Set Polytope (2001) (26)
Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko Conjecture (2011) (26)
On multiple blocking sets in Galois planes (2007) (26)
The Geometry of Logconcave Functions and an O* (n 3 ) Sampling Algorithm (2003) (25)
A POLYNOMIAL-TIME TEST FOR TOTAL DUAL INTEGRALITY IN FIXED DIMENSION (1984) (25)
Searching in Trees, Series-Parallel and Interval Orders (1986) (25)
On the graph of large distances (1989) (24)
Logconcave functions: geometry and efficient sampling algorithms (2003) (24)
Non-Deterministic Graph Property Testing (2012) (24)
Approximating Min-sum Set Cover (2002) (24)
The Ellipsoid Method (1993) (23)
The Colin de Verdière parameter (1999) (23)
Reversal of Markov Chains and the Forget Time (1998) (23)
Graph limits and testing hereditary graph properties (2005) (22)
A new linear programming algorithm — better or worse than the Simplex Method? (1980) (22)
On the sum of matroids (1973) (22)
Tools from linear algebra (1996) (22)
A note on the last new vertex visited by a random walk (1993) (21)
Random graphons and a weak Positivstellensatz for graphs (2009) (20)
The Number of Values of a Boolean Function (1976) (20)
Measures on the square as sparse graph limits (2016) (19)
Global information from local observation (2002) (18)
Paul Erdős and his mathematics (2002) (18)
Discrete and Continuous: Two Sides of the Same? (2010) (18)
Randomized algorithms in combinatorial optimization (1993) (18)
Submodular Function Minimization and Maximization in Discrete Convex Analysis (2010) (17)
Antifactors of graphs (1973) (17)
Connectivity in digraphs (1973) (17)
A physical interpretation of graph connectivity, and its algorithmic applications (1986) (17)
Bounding the Independence Number of a Graph (1982) (16)
Combinatorics in pure mathematics (1996) (16)
Computational results of an O∗(n4) volume algorithm (2012) (16)
Matrix Cones, Projection Representations, and Stable Set Polyhedra (1990) (16)
Examples and algorithmic properties of Greedoids (1989) (16)
Geometric algorithms and algorithmic geometry (1990) (15)
On Regularity Lemmas and their Algorithmic Applications (2016) (15)
Borsuk's theorem and the number of facets of centrally symmetric polytopes (1982) (15)
Basis graphs of greedoids and two-connectivity (1985) (15)
Certain Duality Principles in Integer Programming (1977) (14)
How to tidy up your set-system? (1988) (14)
Homomorphisms and Ramsey properties of antimatroids (1986) (14)
Polyhedral Results for Antimatroids a (1989) (14)
Connection matrices (2005) (13)
Dot Product Representations of Planar Graphs (2010) (13)
On finite Dirichlet series (1971) (13)
Graph theory and combinatorial biology (1999) (13)
Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency (2005) (13)
The History of the LLL-Algorithm (2010) (13)
Discrete mathematics : elementary and beyond / by L. Lovasz, J. Pelikan, K. Vesztergombi (2004) (12)
Energy of Convex Sets, Shortest Paths, and Resistance (2001) (12)
A lower bound for the k ‐multicolored sum‐free problem in Zmn (2018) (12)
A matching algorithm for regular bipartite graphs (1992) (12)
Graph parameters and semigroup functions (2008) (12)
On the invariance of Colin de Verdière's graph parameter under clique sums (1995) (12)
Building bridges : between mathematics and computer science (2008) (12)
(Almost) tight bounds and existence theorems for confluent flows (2004) (11)
Horizons of combinatorics (2008) (11)
Relations between subclasses of greedoids (1985) (11)
Complexity, Oracles, and Numerical Computation (1988) (11)
Facets with fixed defect of the stable set polytope (2000) (11)
Stable Sets in Graphs (1993) (11)
Connectivity Algorithms Using Rubber-bands (1986) (11)
Non-interval greedoids and the transposition property (1986) (10)
The Cocycle Lattice of Binary Matroids (1993) (10)
Semidefinite Functions on Categories (2009) (10)
Directions in AG(2,p^2) (2008) (10)
Matroids and Sperner's Lemma (1980) (9)
Waiting for a Bat to Fly By (in Polynomial Time) (2003) (9)
A fast new algorithm for weak graph regularity (2018) (9)
Integer sequences and semidefinite programming (2000) (9)
Trends in Mathematics: How They Could Change Education (2013) (9)
More sets, graphs and numbers : a salute to Vera Sós and András Hajnal (2006) (9)
INDEPENDENT SETS IN CRITICAL CHROMATIC GRAPHS (8)
On the structure of factorizable graphs. II (1972) (8)
INFORMATION AND COMPLEXITY ( HOW TO MEASURE THEM ? ) (8)
Where to Start a Geometric Random Walk (2003) (8)
Experimental evidence for cytoprotective effect of atropine on the rat gastric mucosa. (1980) (7)
A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces (2017) (7)
Elusive extremal graphs (2018) (6)
A Note on Selectors and Greedoids (1985) (6)
Positive graphs (2012) (6)
Appendix: Developments in matching theory since this book was first published (2009) (5)
One Mathematics (1998) (5)
A short proof of the equivalence of left and right convergence for sparse graphs (2015) (5)
Finding the Optimum (2003) (5)
The cocycle lattice of binary matroids, II (1995) (5)
A characterization of cancellablek-ary structures (1975) (5)
Euler’s Formula (2003) (5)
GASTRIC MUCOSAL RESISTANCE TO PHYSICAL AND CHEMICAL STRESS (1981) (5)
Dual graph homomorphism functions (2010) (5)
Eigenvalues of graphs (2007) (4)
Exit Frequency Matrices for Finite Markov Chains (2010) (4)
Random walks and the regeneration time (1998) (4)
Extremal Problems for Discrepancy (1989) (4)
Fast Mixing in a Markov Chain (2007) (4)
BIOCHEMICAL ASPECTS OF CYTOPROTECTIVE EFFECT OF PROSTACYCLIN ON THE RATS' GASTRIC MUCOSAL DAMAGE INDUCED BY TOPICAL HCl (1981) (4)
Combinatorial Optimization: A Tour d’Horizon (1993) (4)
Solutions: Solution to problem in number 4, p. 250 (1980) (4)
A tight lower bound for Szemerédi’s regularity lemma (2017) (3)
Cycles of a given length in tournaments (2020) (3)
The Colin de Verdière number of a graph (2007) (3)
The Mathematical Notion of Complexity (1984) (3)
[Neoplasms of the peripheral nerves with special reference to the lemmocytoma]. (1954) (3)
Tibor Gallai (1982) (3)
Some Mathematics Behind Graph Property Testing (2008) (3)
Vertex Packing Algorithms (1985) (3)
Graphs with Given Automorphism Group and Few Edge Orbits (1991) (3)
Local versus Global Properties of Metric Spaces Extended abstract (2005) (3)
A localization inequality for set functions (2006) (3)
Polymatroid greedoids (1985) (3)
Erratum: On Regularity Lemmas and their Algorithmic Applications (2018) (2)
[Neurofibroma of the choledochus causing jaundice]. (1970) (2)
A tight bound for Green's boolean removal lemma (2016) (2)
Binomial Coefficients and Pascal’s Triangle (2003) (2)
A remark on Menger's theorem (1970) (2)
Some Recent Results on Graph Matching a (1989) (2)
Abstract Convexity — Antimatroids (1991) (2)
A novel quantitative method for measuring obstruction in the upper urinary tract: The ‘obstruction coefficient’ (2008) (2)
Approximating Clique is Almost NP-Complete (Preliminary Version) (1991) (2)
Steinitz representations and the Colin de Verdière number (2005) (2)
The Generalized Basis Reduction Algorithm (annotated) (2000) (1)
On regularity lemmas and their applications (2016) (1)
Size and structure of maximum matchings (2009) (1)
Tutte ’ s flow conjectures (2012) (1)
Flows on measurable spaces (2020) (1)
On derivatives of graphon parameters (2015) (1)
Discrete Localization and Correlation Inequalities for Set Functions (2003) (1)
The intersection of matroids and antimatroids (1989) (1)
Matchings in bipartite graphs (2009) (1)
On the Graph of Large Distance (1989) (1)
Representation of integers by norm forms. II. (2022) (1)
ALGORITHM FOR CONVEX BODIES (1999) (1)
Determinants and matchings (2009) (1)
Discrete Quantitative Nodal Theorem (2016) (1)
Determining the Genus of a Map by Local Observation of a Simple Random Process (2002) (1)
COLLOQUIA MATHEMATICA SOCIETATIS JÁNOS BOLYAI 52 . COMBINATORICS , EGER ( HUNGARY (2004) (1)
[Successful resuscitation after postoperative cardiac arrest]. (1966) (1)
Understanding the world through mathematics (2011) (0)
Editors’ foreword (1987) (0)
Abstract Linear Dependence — Matroids (1991) (0)
Inequalities and partition regularity of linear homogenous equations ( mentor (2013) (0)
Matchings in Graphs (2003) (0)
United States Patent ( 19 Ajtai USOO 5737425 A 11 Patent Number : 5 , 737 , 425 45 Date of Patent : 54 CRYPTOSYSTEM EMPLOYING WORST (0)
Kernels and graphons (2012) (0)
Graph homomorphisms : definitions (2008) (0)
Approximating Graphs by Graphs and Functions (Abstract) (2007) (0)
[Sacrococcygeal chordoma based on follow-up studies of 4 surgically treated patients]. (1983) (0)
Further Structural Properties (1991) (0)
UvA-DARE (Digital Academic Graph parameters and semigroup functions (0)
[Successful resuscitation following postoperative heart arrest]. (1966) (0)
Topological Results for Greedoids (1991) (0)
[Modern therapy of congenital megacolon]. (1959) (0)
Chapter 41 COMBINATORICS IN PURE MATHEMATICS (0)
E0 221 DISCRETE STRUCTURES (AUG-DEC 2011) (2011) (0)
UvA-DARE (Digital Academic Repository) Semidefinite functions on categories (2009) (0)
The cut distance (2012) (0)
Very large networks (2012) (0)
Algorithms for large graphs and graphons (2012) (0)
Compact graphings (2019) (0)
Other combinatorial structures (2012) (0)
Bipartite graphs with perfect matchings (2009) (0)
Segment and Strong Segment LLL-Reduction of Lattice Bases (2002) (0)
Algorithms for Convex Bodies (1993) (0)
[Gallbladder torsion]. (1970) (0)
Limits of locally–globally convergent graph sequences (2014) (0)
A ug 2 02 0 Cycles of a given length in tournaments ∗ ( Dedicated to the memory of Robin Thomas ) (2020) (0)
Preface (2011) (0)
Flows on measurable spaces (2021) (0)
Algebraic , Geometric , and Topological Methods in Optimization (2018) (0)
From puzzles to the birth of sciences (2010) (0)
Structural properties (0)
Entropy splitting for antiblocking pairs and perfect graphs by (2007) (0)
Some combinatorial applications of the new linear programming method (1981) (0)
Dating to Marriage (1993) (0)
[On aneurysm of the hepatic artery (in relation to a surgically treated case)]. (1968) (0)
Algorithmic Aspects of Combinatorics , Geometry and Number Theory (2010) (0)
Research problems (1973) (0)
ON MULTIDIMENSIONAL DIOPHANTINE APPROXIMATION OF ALGEBRAIC NUMBERS (2015) (0)
[Acute dilatation of the stomach without surgical intervention]. (1960) (0)
Some graph-theoretical problems related to matchings (2009) (0)
2. How to Round a Convex Body (1986) (0)
Hyperfinite graphings and combinatorial optimization (2020) (0)
General Exchange Structures — Greedoids (1991) (0)
[2 cases of volvulus of the cecum]. (1969) (0)
Notation and terminology (2012) (0)
A Glimpse of Complexity and Cryptography (2003) (0)
Some combinatorial applications of the new linear programming algorithm (1981) (0)
Search Problems in Ordered Sets (1985) (0)
On the Graah of Large Distances (2004) (0)
Local Poset Greedoids (1991) (0)
Convergence of dense graph sequences (2012) (0)
[Tuberculosis of the gall bladder]. (1956) (0)
Perfect graphs split entropies (1988) (0)
Graph algebras and homomorphism functions (2012) (0)
Diophantine Approximation and Basis Reduction (1993) (0)
Coloring Maps and Graphs (2003) (0)
The volume of convex bodies in high dimension (2008) (0)
Energy of Convex Sets, Shortest Paths (2000) (0)
2 Overview of results 2 . 1 Decorated graphs (2010) (0)
Distance Matrices of Trees. (1975) (0)
The -factor problem (2009) (0)
Faster Algorithms for Hard Problems (1989) (0)
Matching and linear programming (2009) (0)
Editors’ foreword (1995) (0)
Note A Note on the Line Reconstruction Problem (1972) (0)
Convergence from the right (2012) (0)
Combinatorial Optimization: Some Basic Examples (1993) (0)
[Stenosis of the cardial segment of the stomach of non-neoplastic origin and its surgical therapy]. (1961) (0)
Let’s Count! (2003) (0)
Large graphs in mathematics and physics (2012) (0)
Optimization in Greedoids (1991) (0)
[Mixed tumor of the thyroid gland in an operated case]. (1959) (0)
A PHYSICAL INTBRPRBTATION OF GRAPH CONNBCTNITY, AND ITS ALGORITHMIC APPLICATIONS (1986) (0)
An Algebraic Upper Bound on the Independence Number of a Graph (1980) (0)
1. How to Round Numbers (1986) (0)
[About actinomycosis, with special regard to the pathogenesis]. (1957) (0)
Greedoids on Partially Ordered Sets (1991) (0)
[Surgery of a case of gastric lemmocytoma in association with prostatic cancer]. (1961) (0)
Innovations in Incidence Geometry (2009) (0)
The Colin de Verdière graph parameter ( Preliminary version , March 1997 ) (1990) (0)
Diszkrét és folytonos: a gráfelmélet, algebra, analízis és geometria találkozási pontjai = Discrete and Continuous: interfaces between graph theory, algebra, analysis and geometry (2012) (0)
Ronald Lewis Graham (1935–2020) (2021) (0)
Intersection, Slimming and Trimming (1991) (0)
Topological Methods in Combinatorics (2013) (0)
[Cases of primary actinomycosis of the omentum]. (1957) (0)
UvA-DARE ( Digital Academic Repository ) Graph parameters and semigroup functions (2017) (0)
Preface (2013) (0)
On the structure of graphons (2012) (0)
Regularity and removal lemmas and their applications (2017) (0)
Graph parameters and connection matrices (2012) (0)
Visual and Logical Beauty in Mathematics (2010) (0)
Vertex packing and covering (2009) (0)
On the structure of graphings (2012) (0)
EUROPEAN JOURNAL OF COMBINATORICS JOURNAL EUROPEEN DE COMBINATOIRE EUROPAISCHE ZEITSCHRIFT FÜR KOMBINATORIK (2000) (0)
Extremal graph theory and finite forcibility (2017) (0)
The Work of A. A. Razborov (1990) (0)
[Early transit disorders after gastric surgery]. (1958) (0)
Right convergence of bounded degree graphs (2012) (0)
[On surgical problems in portal hypertension]. (1962) (0)
Finite Geometries, Codes, Latin Squares, and Other Pretty Creatures (2003) (0)
C O ] 3 0 Ja n 20 14 Positive graphs (2014) (0)
An Attack Bound for Small Multiplicative Inverse of φ ( N ) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques (2018) (0)
General graphs with perfect matchings (2009) (0)
Extremal theory of dense graphs (2012) (0)
Multigraphs and decorated graphs (2012) (0)
Graph Theory Over 45 Years (2011) (0)
Approximating graphs by graphs and functions (2007) (0)
Background material Geometric Graph Theory (2007) (0)
Algorithmic Aspects of Convex Sets: Formulation of the Problems (1993) (0)
Combinatorics in Geometry (2003) (0)
Geometric algorithms and algorithmic geometry : plenary address, International Congress of Mathematicians, Kyoto, Japan, August 1990 (1990) (0)
Convergence of bounded degree graphs (2012) (0)
Conference in Honor of the 70th Birthday of Endre Szemerédi (2010) (0)
Graph parameters and reflection positivity (2004) (0)
Algorithms for Bounded Degree Graphs (2012) (0)
3. Some Applications in Combinatorics (1986) (0)
] 3 J ul 2 01 8 Elusive extremal graphs (2018) (0)
Combinatorics: On a family of planar bicritical graphs (1974) (0)
Features of computer language: communication of computers and its complexity. (1993) (0)
Integers, Divisors, and Primes (2003) (0)
Local Versus Global Properties of Metric Spaces Citation (2012) (0)
Preface (2016) (0)
The space of graphons (2012) (0)

This paper list is powered by the following services:

Other Resources About László Lovász

What Schools Are Affiliated With László Lovász?

László Lovász is affiliated with the following schools:

László Lovász's Academic­Influence.com Rankings

László Lovász's Degrees

Why Is László Lovász Influential?

László Lovász's Published Works

Published Works

Other Resources About László Lovász

What Schools Are Affiliated With László Lovász?

Image Attributions

László Lovász's AcademicInfluence.com Rankings