Lovász, László 1948Overview
Publication Timeline
Most widely held works about
László Lovász
Most widely held works by
László Lovász
Discrete mathematics elementary and beyond
by László Lovász
(
)
17 editions published between 2003 and 2006 in English and held by 1,187 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
Combinatorial problems and exercises
by László Lovász
(
Book
)
34 editions published between 1979 and 2005 in English and held by 748 WorldCat member libraries worldwide
Research trends in combinatorial optimization Bonn 2008
by William Cook
(
)
9 editions published between 2008 and 2009 in English and held by 626 WorldCat member libraries worldwide This book, written by leading experts in combinatorial optimization, features indepth surveys of current research areas in combinatorial optimization in the broad sense, ranging from applied graph theory to mathematical programming. It also contains numerous new results and shows many interesting current research directions. This book will be indispensible for any researcher in combinatorial optimization
Geometric algorithms and combinatorial optimization
by Martin Grötschel
(
Book
)
29 editions published between 1981 and 1994 in English and German and held by 594 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 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. The ellipsoid method was used by Khachiyan to show the polynomial time solvability of linear programming. The basis reduction method yields a polynomial time procedure for certain diophantine approximation problems. A combination of these techniques makes it possible to show the polynomial time solvability of many questions concerning poyhedra  for instance, of linear programming problems having possibly exponentially many inequalities. Utilizing results from polyhedral combinatorics, it provides short proofs of the poynomial time solvability of many combinatiorial optimization problems. For a number of these problems, the geometric algorithms discussed in this book are the only techniques known to derive polynomial time solvability. 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
Matching theory
by László Lovász
(
Book
)
30 editions published between 1986 and 2009 in English and Undetermined and held by 577 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
Handbook of combinatorics
by Ronald L Graham
(
Book
)
9 editions published in 1995 in English and held by 508 WorldCat member libraries worldwide
An algorithmic theory of numbers, graphs, and convexity
by László Lovász
(
Book
)
17 editions published between 1986 and 1989 in English and held by 486 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
Horizons of combinatorics
by Ervin Győri
(
)
8 editions published in 2008 in English and held by 436 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
More sets, graphs, and numbers a salute to Vera Sós and András Hajnal
by Ervin Győri
(
)
7 editions published in 2006 in English and held by 413 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
Greedoids
by B. H Korte
(
Book
)
15 editions published between 1991 and 2013 in English and Undetermined and held by 255 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
)
9 editions published between 2012 and 2013 in English and held by 224 WorldCat member libraries worldwide
Theory of algorithms
(
Book
)
8 editions published between 1985 and 1986 in English and Dutch and held by 218 WorldCat member libraries worldwide
Algebraic methods in graph theory
by Conference on Algebraic Methods in Graph Theory
(
Book
)
13 editions published in 1981 in English and Undetermined and held by 198 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 176 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
)
8 editions published in 1985 in English and Undetermined and held by 175 WorldCat member libraries worldwide
Combinatorial problems and exercises
by László Lovász
(
Book
)
11 editions published in 2007 in English and held by 161 WorldCat member libraries worldwide
Combinatorial optimization : papers from the DIMACS Special Year
by DIMACS Special Year on Combinatorial Optimization
(
Book
)
5 editions published in 1995 in English and held by 140 WorldCat member libraries worldwide
Finite and infinite sets
(
Book
)
7 editions published in 1984 in English and held by 136 WorldCat member libraries worldwide
Diskrete Mathematik
by László Lovász
(
)
6 editions published in 2005 in German and held by 132 WorldCat member libraries worldwide
Combinatorics
by A Hajnal
(
Book
)
7 editions published in 1988 in English and held by 125 WorldCat member libraries worldwide more
fewer
Audience Level
Related Identities
Associated Subjects
Algebra Algebra, Abstract Algorithms Combinatorial analysis Combinatorial geometry Combinatorial optimization Computational complexity Computer programming Computer science Computer scienceMathematics Convex domains Economics Electronic data processing Erdős, Paul, Geometry of numbers Graph theory Greedoids Hoffman, Paul, Hungary Logic, Symbolic and mathematical Machine translating Matching theory Mathematical optimization Mathematical statistics Mathematicians Mathematics MathematicsPhilosophy Matroids Number theory Operations research Programming (Mathematics) Set theory

Alternative Names
Lovász, L.
Lovász, L. 1948
Lovász, L. (László), 1948
Lovász, László
Lovasz, Laszlo, 1948
ロバース, ラスロウ
Languages
Covers
