Lovász, László 1948
Overview
Works:  146 works in 647 publications in 4 languages and 9,452 library holdings 

Genres:  Conference papers and proceedings Handbooks and manuals Documentary films Biography Biographical films Nonfiction films Film adaptations 
Roles:  Author, Editor, Honoree, Other 
Classifications:  QA164, 511.6 
Publication Timeline
.
Most widely held works about
László Lovász
 Building bridges : between mathematics and computer science by Martin Grötschel( Book )
Most widely held works by
László Lovász
Combinatorial problems and exercises by
László Lovász(
Book
)
59 editions published between 1978 and 2014 in English and Dutch and held by 964 WorldCat member libraries worldwide
Basic enumeration; The sieve; Permutations; Two classical enumeration problems in graph theory; Connectivity; Factors of graphs; Extremal problems for graphs; Spectra of graphs; Automorphism of graphs; Hypergraphs; Ramsey theory
59 editions published between 1978 and 2014 in English and Dutch and held by 964 WorldCat member libraries worldwide
Basic enumeration; The sieve; Permutations; Two classical enumeration problems in graph theory; Connectivity; Factors of graphs; Extremal problems for graphs; Spectra of graphs; Automorphism of graphs; Hypergraphs; Ramsey theory
Geometric algorithms and combinatorial optimization by
Martin Grötschel(
Book
)
34 editions published between 1980 and 1994 in English and German and held by 612 WorldCat member libraries worldwide
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a point in a convex set and the basis reduction method for point lattices. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. The first edition of this book was received enthusiastically by the community of discrete mathematicians, combinatorial optimizers, operations researchers, and computer scientists. To quote just from a few reviews: "The book is written in a very grasping way, legible both for people who are interested in the most important results and for people who are interested in technical details and proofs." #manuscripta geodaetica#1
34 editions published between 1980 and 1994 in English and German and held by 612 WorldCat member libraries worldwide
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a point in a convex set and the basis reduction method for point lattices. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. The first edition of this book was received enthusiastically by the community of discrete mathematicians, combinatorial optimizers, operations researchers, and computer scientists. To quote just from a few reviews: "The book is written in a very grasping way, legible both for people who are interested in the most important results and for people who are interested in technical details and proofs." #manuscripta geodaetica#1
Discrete mathematics : elementary and beyond by
László Lovász(
Book
)
33 editions published between 1990 and 2006 in English and German and held by 545 WorldCat member libraries worldwide
"This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number theory, probability, and combinatorial geometry. Wherever possible, the authors use proofs and problem solving to help students understand the solutions to problems. In addition, there are numerous examples, figures, and exercises spread throughout the book."Jacket
33 editions published between 1990 and 2006 in English and German and held by 545 WorldCat member libraries worldwide
"This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number theory, probability, and combinatorial geometry. Wherever possible, the authors use proofs and problem solving to help students understand the solutions to problems. In addition, there are numerous examples, figures, and exercises spread throughout the book."Jacket
Handbook of combinatorics by
Ronald L Graham(
Book
)
13 editions published in 1995 in English and Italian and held by 520 WorldCat member libraries worldwide
13 editions published in 1995 in English and Italian and held by 520 WorldCat member libraries worldwide
Matching theory by
László Lovász(
Book
)
35 editions published between 1986 and 2009 in English and Undetermined and held by 500 WorldCat member libraries worldwide
This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the nonbipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), ffactors and vertex packing
35 editions published between 1986 and 2009 in English and Undetermined and held by 500 WorldCat member libraries worldwide
This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the nonbipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), ffactors and vertex packing
An algorithmic theory of numbers, graphs, and convexity by
László Lovász(
Book
)
16 editions published between 1985 and 1995 in English and German and held by 421 WorldCat member libraries worldwide
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. Two algorithms are studied in detail: the ellipsoid method and the simultaneous diophantine approximation method. Although both were developed to study, on a theoretical level, the feasibility of computing some specialized problems in polynomial time, they appear to have practical applications. The book first describes use of the simultaneous diophantine method to develop sophisticated rounding procedures. Then a model is described to compute upper and lower bounds on various measures of convex bodies. Use of the two algorithms is brought together by the author in a study of polyhedra with rational vertices. The book closes with some applications of the results to combinatorial optimization
16 editions published between 1985 and 1995 in English and German and held by 421 WorldCat member libraries worldwide
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. Two algorithms are studied in detail: the ellipsoid method and the simultaneous diophantine approximation method. Although both were developed to study, on a theoretical level, the feasibility of computing some specialized problems in polynomial time, they appear to have practical applications. The book first describes use of the simultaneous diophantine method to develop sophisticated rounding procedures. Then a model is described to compute upper and lower bounds on various measures of convex bodies. Use of the two algorithms is brought together by the author in a study of polyhedra with rational vertices. The book closes with some applications of the results to combinatorial optimization
Greedoids by
B. H Korte(
Book
)
18 editions published between 1991 and 2013 in English and Undetermined and held by 246 WorldCat member libraries worldwide
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the steepest descent or gradient method) and of discrete algorithms. The discrete structure most closely related to greediness is a matroid; in fact, matroids may be characterized axiomatically as those independence systems for which the greedy solution is optimal for certain optimization problems (e.g. linear objective functions, bottleneck functions). This book is an attempt to unify different approaches and to lead the reader from fundamental results in matroid theory to the current borderline of open research problems. The monograph begins by reviewing classical concepts from matroid theory and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partially ordered sets and greedoid intersections. Emphasis is placed on optimization problems in greedois. An algorithmic characterization of greedoids in terms of the greedy algorithm is derived, the behaviour with respect to linear functions is investigated, the shortest path problem for graphs is extended to a class of greedoids, linear descriptions of antimatroid polyhedra and complexity results are given and the RadoHall theorem on transversals is generalized. The selfcontained volume which assumes only a basic familarity with combinatorial optimization ends with a chapter on topological results in connection with greedoids
18 editions published between 1991 and 2013 in English and Undetermined and held by 246 WorldCat member libraries worldwide
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the steepest descent or gradient method) and of discrete algorithms. The discrete structure most closely related to greediness is a matroid; in fact, matroids may be characterized axiomatically as those independence systems for which the greedy solution is optimal for certain optimization problems (e.g. linear objective functions, bottleneck functions). This book is an attempt to unify different approaches and to lead the reader from fundamental results in matroid theory to the current borderline of open research problems. The monograph begins by reviewing classical concepts from matroid theory and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partially ordered sets and greedoid intersections. Emphasis is placed on optimization problems in greedois. An algorithmic characterization of greedoids in terms of the greedy algorithm is derived, the behaviour with respect to linear functions is investigated, the shortest path problem for graphs is extended to a class of greedoids, linear descriptions of antimatroid polyhedra and complexity results are given and the RadoHall theorem on transversals is generalized. The selfcontained volume which assumes only a basic familarity with combinatorial optimization ends with a chapter on topological results in connection with greedoids
Large networks and graph limits by
László Lovász(
Book
)
3 editions published in 2012 in English and held by 243 WorldCat member libraries worldwide
3 editions published in 2012 in English and held by 243 WorldCat member libraries worldwide
Theory of algorithms(
Book
)
13 editions published between 1985 and 1986 in English and Dutch and held by 235 WorldCat member libraries worldwide
13 editions published between 1985 and 1986 in English and Dutch and held by 235 WorldCat member libraries worldwide
Algebraic methods in graph theory by Colloquium on Algebraic Methods in Graph Theory(
Book
)
16 editions published in 1981 in English and Undetermined and held by 214 WorldCat member libraries worldwide
16 editions published in 1981 in English and Undetermined and held by 214 WorldCat member libraries worldwide
N is a number a portrait of Paul Erdős by
George Paul Csicsery(
Visual
)
1 edition published in 2004 in English and held by 199 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland and the United States over a period of four years presenting mathematician Paul Erdos's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
1 edition published in 2004 in English and held by 199 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland and the United States over a period of four years presenting mathematician Paul Erdos's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
Matroid theory(
Book
)
13 editions published in 1985 in English and Undetermined and held by 177 WorldCat member libraries worldwide
13 editions published in 1985 in English and Undetermined and held by 177 WorldCat member libraries worldwide
Combinatorial optimization : papers from the DIMACS Special Year by DIMACS Special Year on Combinatorial Optimization(
Book
)
9 editions published in 1995 in English and held by 149 WorldCat member libraries worldwide
9 editions published in 1995 in English and held by 149 WorldCat member libraries worldwide
Combinatorics by
Hungarian Colloquium on Combinatorics(
Book
)
13 editions published between 1988 and 2002 in English and held by 138 WorldCat member libraries worldwide
13 editions published between 1988 and 2002 in English and held by 138 WorldCat member libraries worldwide
More sets, graphs, and numbers : a salute to Vera Sós and András Hajnal by
Ervin Győri(
Book
)
15 editions published between 1992 and 2014 in English and Undetermined and held by 117 WorldCat member libraries worldwide
Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and stateoftheart results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research. The volume is recommended to experienced specialists as well as to young researchers and students
15 editions published between 1992 and 2014 in English and Undetermined and held by 117 WorldCat member libraries worldwide
Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and stateoftheart results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research. The volume is recommended to experienced specialists as well as to young researchers and students
Graph theory and combinatorial biology by
László Lovász(
Book
)
9 editions published in 1999 in English and held by 101 WorldCat member libraries worldwide
9 editions published in 1999 in English and held by 101 WorldCat member libraries worldwide
Horizons of combinatorics by
G Fejes Tóth(
Book
)
11 editions published in 2008 in English and held by 90 WorldCat member libraries worldwide
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and combinatorial geometry as well. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference Horizons of Combinatorics held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students
11 editions published in 2008 in English and held by 90 WorldCat member libraries worldwide
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and combinatorial geometry as well. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference Horizons of Combinatorics held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students
Combinatorial optimization : theory and algorithms by
B. H Korte(
Book
)
21 editions published between 1992 and 2009 in English and German and held by 89 WorldCat member libraries worldwide
Abstract: "In this working paper I discuss some issues, with the aim of suggesting research topics for the DIMACS special year "Combinatorial Optimization". I plan to focus on the unorthodox, hoping that at least one of the areas I describe below will gain new momentum as a result of this special year. A companion preprint, written by Martin Grötschel and myself as a chapter of the Handbook of Combinatorics, describes the state of the art, concentrating on the wellestablished methods and models like polyhedral combinatorics, and should be available soon."
21 editions published between 1992 and 2009 in English and German and held by 89 WorldCat member libraries worldwide
Abstract: "In this working paper I discuss some issues, with the aim of suggesting research topics for the DIMACS special year "Combinatorial Optimization". I plan to focus on the unorthodox, hoping that at least one of the areas I describe below will gain new momentum as a result of this special year. A companion preprint, written by Martin Grötschel and myself as a chapter of the Handbook of Combinatorics, describes the state of the art, concentrating on the wellestablished methods and models like polyhedral combinatorics, and should be available soon."
Erdős centennial by
László Lovász(
Book
)
14 editions published between 2013 and 2014 in English and held by 39 WorldCat member libraries worldwide
"Paul Erdős was one of the most influential mathematicians of the twentieth century, whose work in number theory, combinatorics, set theory, analysis, and other branches of mathematics has determined the development of large areas of these fields. In 1999, a conference was organized to survey his work, his contributions to mathematics, and the farreaching impact of his work on many branches of mathematics. On the 100th anniversary of his birth, this volume undertakes the almost impossible task to describe the ways in which problems raised by him and topics initiated by him (indeed, whole branches of mathematics) continue to flourish. Written by outstanding researchers in these areas, these papers include extensive surveys of classical results as well as of new developments."Page [4] of cover
14 editions published between 2013 and 2014 in English and held by 39 WorldCat member libraries worldwide
"Paul Erdős was one of the most influential mathematicians of the twentieth century, whose work in number theory, combinatorics, set theory, analysis, and other branches of mathematics has determined the development of large areas of these fields. In 1999, a conference was organized to survey his work, his contributions to mathematics, and the farreaching impact of his work on many branches of mathematics. On the 100th anniversary of his birth, this volume undertakes the almost impossible task to describe the ways in which problems raised by him and topics initiated by him (indeed, whole branches of mathematics) continue to flourish. Written by outstanding researchers in these areas, these papers include extensive surveys of classical results as well as of new developments."Page [4] of cover
Building bridges : between mathematics and computer science by
Martin Grötschel(
Book
)
1 edition published in 2008 in English and held by 6 WorldCat member libraries worldwide
"Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Laszlo Lovasz, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovasz's 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers."book jacket
1 edition published in 2008 in English and held by 6 WorldCat member libraries worldwide
"Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Laszlo Lovasz, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovasz's 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers."book jacket
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Grötschel, Martin Other Author Editor
 Sós, Vera T. Other Editor
 Pelikán, J. (József)
 Katona, G. Editor
 Vsztergombi, K. (Katalin)
 Győri, Ervin 1954 Author Editor
 Graham, Ronald L. 1935 Other Author Editor
 Hajnal, A. Other Editor
 Korte, B. H. (Bernhard H.) 1938 Author Editor
 Schrijver, A.
Useful Links
Associated Subjects
Algebra Algebra, Abstract Algorithms AlgorithmsDesign Biomathematics Combinations Combinatorial analysis Combinatorial geometry Combinatorial optimization Computational complexity Computer programming Computer science Computer scienceMathematics Convex domains Convex functions Distribution (Probability theory) Economics Electronic data processing Erdős, Paul, Geometry of numbers Graph theory Greedoids Hoffman, Paul, Hungary Influence (Literary, artistic, etc.) Jewish mathematicians Logic, Symbolic and mathematical Machine translating Matching theory Mathematical optimization Mathematical statistics Mathematicians Mathematics MathematicsPhilosophy Matroids Multidisciplinary design optimization Number theory Operations research Programming (Mathematics) Ramsey theory Random graphs Set theory Symmetry (Mathematics) Topological groups
Alternative Names
Lāslo Lovāss
László Lovász
László Lovász Hongaars wiskundige
László Lovász Hungarian mathematician
László Lovász matematico ungherese
László Lovász ungarischer Mathematiker
László Lovász ungersk datavetare och matematiker
Lovász, L.
Lovász, L. 1948
Lovász, L. (László)
Lovász, L. (László), 1948
Lovász, László
Lovasz, Laszlo 1948
Ласло Ловас
Ловас, Ласло
לסלו לובאס
لاسلو لوواس ریاضیدان و دانشمند علوم کامپیوتر اهل مجارستان
লাসলো লোভাশ
로바스 라슬로
ラースロー・ロヴァース
ロバシュ, ラオス
ロバース, ラスロウ
Languages
Covers