Lovász, László 1948
Overview
Works:  158 works in 689 publications in 4 languages and 9,852 library holdings 

Genres:  Conference papers and proceedings Handbooks and manuals Biography Biographical films Documentary 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
)
60 editions published between 1978 and 2014 in English and Dutch and held by 969 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
60 editions published between 1978 and 2014 in English and Dutch and held by 969 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
)
35 editions published between 1980 and 1994 in English and German and held by 615 WorldCat member libraries worldwide
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated DyerFriezeKannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs
35 editions published between 1980 and 1994 in English and German and held by 615 WorldCat member libraries worldwide
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated DyerFriezeKannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs
Discrete mathematics : elementary and beyond by
László Lovász(
Book
)
25 editions published between 1999 and 2006 in English and held by 536 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
25 editions published between 1999 and 2006 in English and held by 536 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
)
14 editions published in 1995 in English and Italian and held by 523 WorldCat member libraries worldwide
14 editions published in 1995 in English and Italian and held by 523 WorldCat member libraries worldwide
Matching theory by
László Lovász(
Book
)
38 editions published between 1986 and 2009 in English and Undetermined and held by 508 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
38 editions published between 1986 and 2009 in English and Undetermined and held by 508 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
)
26 editions published between 1985 and 1995 in English and German and held by 464 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
26 editions published between 1985 and 1995 in English and German and held by 464 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
Large networks and graph limits by
László Lovász(
Book
)
14 editions published in 2012 in English and held by 297 WorldCat member libraries worldwide
Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. Developing a mathematical theory of very large networks is an important challenge. This book describes one recent approach to this theory, the limit theory of graphs, which has emerged over the last decade. The theory has rich connections with other approaches to the study of large networks, such as "property testing" in computer science and regularity partition in graph theory. It has several applications in extremal graph theory, including the exact for
14 editions published in 2012 in English and held by 297 WorldCat member libraries worldwide
Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. Developing a mathematical theory of very large networks is an important challenge. This book describes one recent approach to this theory, the limit theory of graphs, which has emerged over the last decade. The theory has rich connections with other approaches to the study of large networks, such as "property testing" in computer science and regularity partition in graph theory. It has several applications in extremal graph theory, including the exact for
Greedoids by
B. H Korte(
Book
)
18 editions published between 1991 and 2013 in English and held by 262 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 held by 262 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
Algebraic methods in graph theory by Conference on Algebraic Methods in Graph Theory(
Book
)
28 editions published in 1981 in English and Undetermined and held by 247 WorldCat member libraries worldwide
28 editions published in 1981 in English and Undetermined and held by 247 WorldCat member libraries worldwide
Theory of algorithms(
Book
)
11 editions published between 1985 and 1986 in English and Dutch and held by 230 WorldCat member libraries worldwide
11 editions published between 1985 and 1986 in English and Dutch and held by 230 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 207 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 207 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 179 WorldCat member libraries worldwide
13 editions published in 1985 in English and Undetermined and held by 179 WorldCat member libraries worldwide
Combinatorial optimization : papers from the DIMACS Special Year by DIMACS Special Year on Combinatorial Optimization(
Book
)
7 editions published in 1995 in English and held by 147 WorldCat member libraries worldwide
7 editions published in 1995 in English and held by 147 WorldCat member libraries worldwide
Combinatorics by
Bolyai János Matematikai Társulat(
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
Finite and infinite sets(
Book
)
1 edition published in 1984 in English and held by 126 WorldCat member libraries worldwide
1 edition published in 1984 in English and held by 126 WorldCat member libraries worldwide
More sets, graphs, and numbers : a salute to Vera Sós and András Hajnal by
Ervin Győri(
Book
)
12 editions published in 2006 in English and held by 115 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
12 editions published in 2006 in English and held by 115 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
Horizons of combinatorics by
Ervin Győri(
Book
)
10 editions published in 2008 in English and held by 92 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
10 editions published in 2008 in English and held by 92 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
Research trends in combinatorial optimization : Bonn 2008 by
William Cook(
Book
)
16 editions published between 2008 and 2009 in English and held by 79 WorldCat member libraries worldwide
Features surveys of the research areas in combinatorial optimization in the broad sense, ranging from applied graph theory to mathematical programming. This book contains various results and shows many research directions. It is suitable for researchers in combinatorial optimization
16 editions published between 2008 and 2009 in English and held by 79 WorldCat member libraries worldwide
Features surveys of the research areas in combinatorial optimization in the broad sense, ranging from applied graph theory to mathematical programming. This book contains various results and shows many research directions. It is suitable for researchers in combinatorial optimization
Erdős centennial by
László Lovász(
Book
)
14 editions published between 2013 and 2014 in English and held by 41 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 41 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
Diskrete Mathematik by
László Lovász(
Book
)
6 editions published in 2005 in German and held by 10 WorldCat member libraries worldwide
Die diskrete Mathematik ist im Begriff, zu einem der wichtigsten Gebiete der mathematischen Forschung zu werden mit Anwendungen in der Kryptographie, der linearen Programmierung, der Kodierungstheorie und Informatik. Dieses Buch richtet sich an Studenten der Mathematik und Informatik, die ein Gefühl dafür entwickeln möchten, worum es in der Mathematik geht, wobei Mathematik hilfreich sein kann, und mit welcher Art Fragen sich Mathematiker auseinandersetzen. Die Autoren stellen eine Anzahl ausgewählter Ergebnisse und Methoden der diskreten Mathematik vor, hauptsächlich aus den Bereichen Kombinatorik und Graphentheorie, teilweise aber auch aus der Zahlentheorie, der Wahrscheinlichkeitsrechnung und der kombinatorischen Geometrie.Wo immer es möglich war, haben die Autoren Beweise und Problemlösungen verwendet, um den Studenten zu helfen, die Lösungen der Fragestellungen zu verstehen. Zusätzlich ist eine Vielzahl von Beispielen, Bildern und Übungsaufgaben über das Buch verteilt. László Lovász ist einer der Leiter der theoretischen Forschungsabteilung der Microsoft Corporation. Er hat 1999 den WolfPreis sowie den GödelPreis für die beste wissenschaftliche Veröffentlichung in der Informatik erhalten. József Pelikán ist Professor am Institut für Algebra und Zahlentheorie der Eötvös Loránd Universität in Budapest. Katalin Vesztergombi ist Senior Lecturer am Fachbereich Mathematik der Universität von Washington in Seattle
6 editions published in 2005 in German and held by 10 WorldCat member libraries worldwide
Die diskrete Mathematik ist im Begriff, zu einem der wichtigsten Gebiete der mathematischen Forschung zu werden mit Anwendungen in der Kryptographie, der linearen Programmierung, der Kodierungstheorie und Informatik. Dieses Buch richtet sich an Studenten der Mathematik und Informatik, die ein Gefühl dafür entwickeln möchten, worum es in der Mathematik geht, wobei Mathematik hilfreich sein kann, und mit welcher Art Fragen sich Mathematiker auseinandersetzen. Die Autoren stellen eine Anzahl ausgewählter Ergebnisse und Methoden der diskreten Mathematik vor, hauptsächlich aus den Bereichen Kombinatorik und Graphentheorie, teilweise aber auch aus der Zahlentheorie, der Wahrscheinlichkeitsrechnung und der kombinatorischen Geometrie.Wo immer es möglich war, haben die Autoren Beweise und Problemlösungen verwendet, um den Studenten zu helfen, die Lösungen der Fragestellungen zu verstehen. Zusätzlich ist eine Vielzahl von Beispielen, Bildern und Übungsaufgaben über das Buch verteilt. László Lovász ist einer der Leiter der theoretischen Forschungsabteilung der Microsoft Corporation. Er hat 1999 den WolfPreis sowie den GödelPreis für die beste wissenschaftliche Veröffentlichung in der Informatik erhalten. József Pelikán ist Professor am Institut für Algebra und Zahlentheorie der Eötvös Loránd Universität in Budapest. Katalin Vesztergombi ist Senior Lecturer am Fachbereich Mathematik der Universität von Washington in Seattle
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Grötschel, Martin Other Author Editor
 Pelikán, J. (József)
 Katona, G. Editor
 Sós, Vera T. Other Editor
 Vsztergombi, K. (Katalin)
 Győri, Ervin 1954 Author Editor
 Hajnal, A. Other Editor
 Korte, B. H. (Bernhard H.) 1938 Author Editor
 Schrijver, A.
 Graham, Ronald L. 1935 Other Author Editor
Useful Links
Associated Subjects
Algebra Algebra, Abstract Algorithms Combinatorial analysis Combinatorial geometry Combinatorial optimization Computational complexity Computer programming Computer science Computer scienceMathematics Convex domains 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 Lovász, László, Machine translating Matching theory Mathematical optimization Mathematical statistics Mathematicians Mathematics MathematicsPhilosophy Matroids Number theory Operations research Programming (Mathematics) Ramsey theory Random graphs Set theory
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 matemático húngaro
László Lovász matematico ungherese
László Lovász mathématicien hongrois
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