László Lovász

According to our database1, László Lovász authored at least 135 papers between 1976 and 2016.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
Positive graphs.
Electronic Notes in Discrete Mathematics, 2016

Preface.
Eur. J. Comb., 2016

Positive graphs.
Eur. J. Comb., 2016

2013
Left and right convergence of graphs with bounded degree.
Random Struct. Algorithms, 2013

Preface.
Electronic Notes in Discrete Mathematics, 2013

Non-Deterministic Graph Property Testing.
Combinatorics, Probability & Computing, 2013

2012
Random graphons and a weak Positivstellensatz for graphs.
Journal of Graph Theory, 2012

Computational results of an O(n4) volume algorithm.
European Journal of Operational Research, 2012

Large Networks and Graph Limits.
Colloquium Publications 60, American Mathematical Society, ISBN: 978-0-8218-9085-1, 2012

2011
Finitely forcible graphons.
J. Comb. Theory, Ser. B, 2011

Preface.
Eur. J. Comb., 2011

Limits of randomly grown graph sequences.
Eur. J. Comb., 2011

Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko Conjecture.
Electr. J. Comb., 2011

Dot Product Representations of Planar Graphs.
Electr. J. Comb., 2011

2010
The History of the LLL-Algorithm.
Proceedings of the LLL Algorithm - Survey and Applications, 2010

Dual graph homomorphism functions.
J. Comb. Theory, Ser. A, 2010

Exit Frequency Matrices for Finite Markov Chains.
Combinatorics, Probability & Computing, 2010

2009
Contractors and connectors of graph algebras.
Journal of Graph Theory, 2009

Semidefinite Functions on Categories.
Electr. J. Comb., 2009

2008
Generalized quasirandom graphs.
J. Comb. Theory, Ser. B, 2008

Graph parameters and semigroup functions.
Eur. J. Comb., 2008

Some Mathematics Behind Graph Property Testing.
Proceedings of the Discovery Science, 11th International Conference, 2008

Some Mathematics behind Graph Property Testing.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007
The geometry of logconcave functions and sampling algorithms.
Random Struct. Algorithms, 2007

(Almost) Tight bounds and existence theorems for single-commodity confluent flows.
J. ACM, 2007

Approximating Graphs by Graphs and Functions (Abstract).
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006
Proving Integrality Gaps without Knowing the Linear Program.
Theory of Computing, 2006

Limits of dense graph sequences.
J. Comb. Theory, Ser. B, 2006

A localization inequality for set functions.
J. Comb. Theory, Ser. A, 2006

Simulated annealing in convex bodies and an O*(n4) volume algorithm.
J. Comput. Syst. Sci., 2006

The rank of connection matrices and the dimension of graph algebras.
Eur. J. Comb., 2006

Normal hypergraphs and the perfect graph conjecture.
Discrete Mathematics, 2006

Blocking Conductance and Mixing in Random Walks.
Combinatorics, Probability & Computing, 2006

Waiting for a Bat to Fly By (in Polynomial Time).
Combinatorics, Probability & Computing, 2006

Graph limits and parameter testing.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Local versus global properties of metric spaces.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency.
Oper. Res. Lett., 2005

Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004
Hit-and-run from a corner.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

(Almost) tight bounds and existence theorems for confluent flows.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003
Semi-matchings for Bipartite Graphs and Load Balancing.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Logconcave Functions: Geometry and Efficient Sampling Algorithms
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Global Information from Local Observation.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Proving Integrality Gaps without Knowing the Linear Program.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Approximating Min-sum Set Cover.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Steinitz Representations of Polyhedra and the Colin de Verdière Number.
J. Comb. Theory, Ser. B, 2001

Energy of Convex Sets, Shortest Paths, and Resistance.
J. Comb. Theory, Ser. A, 2001

Unextendible Product Bases.
J. Comb. Theory, Ser. A, 2001

Critical Facets of the Stable Set Polytope.
Combinatorica, 2001

2000
Facets with fixed defect of the stable set polytope.
Math. Program., 2000

The Cover Time, the Blanket Time, and the Matthews Bound.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Hit-and-run mixes fast.
Math. Program., 1999

Faster Mixing via Average Conductance.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Lifting Markov Chains to Speed up Mixing.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998
Random walks and the regeneration time.
Journal of Graph Theory, 1998

Reversal of Markov Chains and the Forget Time.
Combinatorics, Probability & Computing, 1998

Approximation of Diameters: Randomization Doesn't Help.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Random walks and an O*(n5) volume algorithm for convex bodies.
Random Struct. Algorithms, 1997

The Membership Problem in Jump Systems.
J. Comb. Theory, Ser. B, 1997

The Colin de Verdière Number and Sphere Representations of a Graph.
Combinatorica, 1997

Mixing times.
Proceedings of the Microsurveys in Discrete Probability, 1997

1996
The rank and size of graphs.
Journal of Graph Theory, 1996

Interactive Proofs and the Hardness of Approximating Cliques.
J. ACM, 1996

1995
Search Problems in the Decision Tree Model.
SIAM J. Discrete Math., 1995

Isoperimetric Problems for Convex Bodies and a Localization Lemama.
Discrete & Computational Geometry, 1995

Exact Mixing in an Unknown Markov Chain.
Electr. J. Comb., 1995

Efficient stopping rules for Markov chains.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On Conway's Thrackle Conjecture.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Stable sets and polynomials.
Discrete Mathematics, 1994

1993
A Monte-Carlo Algorithm for Estimating the Permanent.
SIAM J. Comput., 1993

Random Walks in a Convex Body and an Improved Volume Algorithm.
Random Struct. Algorithms, 1993

A note on the last new vertex visited by a random walk.
Journal of Graph Theory, 1993

Communication Complexity and Combinatorial Lattice Theory.
J. Comput. Syst. Sci., 1993

The Cocycle Lattice of Binary Matroids .
Eur. J. Comb., 1993

Dating to Marriage.
Discrete Applied Mathematics, 1993

Randomized algorithms in combinatorial optimization.
Proceedings of the Combinatorial Optimization, 1993

Combinatorial problems and exercises (2. ed.).
North-Holland, ISBN: 978-0-444-81504-0, 1993

1992
The Generalized Basis Reduction Algorithm.
Math. Oper. Res., 1992

A matching algorithm for regular bipartite graphs.
Discrete Applied Mathematics, 1992

On integer points in polyhedra: a lower bound.
Combinatorica, 1992

Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Linear Decision Trees: Volume Estimates and Topological Bounds
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

On the Randomized Complexity of Volume and Diameter
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Cones of Matrices and Set-Functions and 0-1 Optimization.
SIAM Journal on Optimization, 1991

Chip-firing Games on Graphs.
Eur. J. Comb., 1991

Graphs with Given Automorphism Group and Few Edge Orbits.
Eur. J. Comb., 1991

Search Problems in the Decision Tree Model (Preliminary Version)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Approximating Clique is Almost NP-Complete (Preliminary Version)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
The Shapes of Polyhedra.
Math. Oper. Res., 1990

Entropy splitting for antiblocking corners and perfect graphs.
Combinatorica, 1990

The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Matrix Cones, Projection Representations, and Stable Set Polyhedra.
Proceedings of the Polyhedral Combinatorics, 1990

1989
An on-line graph coloring algorithm with sublinear performance ratio.
Discrete Mathematics, 1989

The intersection of matroids and antimatroids.
Discrete Mathematics, 1989

On the Graph of Large Distance.
Discrete & Computational Geometry, 1989

Faster Algorithms for Hard Problems.
IFIP Congress, 1989

On the Number of Halving Planes.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Rubber bands, convex embeddings and graph connectivity.
Combinatorica, 1988

Lattices, Möbius Functions and Communication Complexity
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987
Matching structure and the matching lattice.
J. Comb. Theory, Ser. B, 1987

On some combinatorial properties of algebraic matroids.
Combinatorica, 1987

1986
Searching in Trees, Series-Parallel and Interval Orders.
SIAM J. Comput., 1986

Relaxations of vertex packing.
J. Comb. Theory, Ser. B, 1986

Discrepancy of Set-systems and Matrices.
Eur. J. Comb., 1986

Non-interval greedoids and the transposition property.
Discrete Mathematics, 1986

Homomorphisms and Ramsey properties of antimatroids.
Discrete Applied Mathematics, 1986

Connectivity Algorithms Using Rubber-bands.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

Covering Minima and Lattice Point Free Convex Bodies.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985
Relations between subclasses of greedoids.
Zeitschr. für OR, 1985

Lengths of cycles in halin graphs.
Journal of Graph Theory, 1985

Polymatroid greedoids.
J. Comb. Theory, Ser. B, 1985

A Note on Selectors and Greedoids.
Eur. J. Comb., 1985

Vertex Packing Algorithms.
Proceedings of the Automata, 1985

Computing ears and branchings in parallel
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".
Combinatorica, 1984

Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
Ear-decompositions of matching covered graphs.
Combinatorica, 1983

Structural properties of greedoids.
Combinatorica, 1983

1982
Tibor Gallai.
Combinatorica, 1982

Brick decompositions and the matching rank of graphs.
Combinatorica, 1982

1981
The ellipsoid method and its consequences in combinatorial optimization.
Combinatorica, 1981

Cycles through specified vertices of a graph.
Combinatorica, 1981

Mathematical Structures Underlying Greedy Algorithms.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
On a product dimension of graphs.
J. Comb. Theory, Ser. B, 1980

Matroid matching and some applications.
J. Comb. Theory, Ser. B, 1980

Matroids and Sperner's Lemma.
Eur. J. Comb., 1980

1979
On the Shannon capacity of a graph.
IEEE Trans. Information Theory, 1979

Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

On determinants, matchings, and random algorithms.
FCT, 1979

1978
Kneser's Conjecture, Chromatic Number, and Homotopy.
J. Comb. Theory, Ser. A, 1978

1977
On minimal elementary bipartite graphs.
J. Comb. Theory, Ser. B, 1977

1976
On two minimax theorems in graph.
J. Comb. Theory, Ser. B, 1976


  Loading...