László Lovász

According to our database, László Lovász authored at least 145 papers between 1975 and 2023.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of one.

2023

Locally common graphs.

Endre Csóka, Tamás Hubai, László Lovász

J. Graph Theory, 2023

2021

Discrete Quantitative Nodal Theorem.

László Lovász

Electron. J. Comb., 2021

2019

Measures on the square as sparse graph limits.

Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy

J. Comb. Theory, Ser. B, 2019

2016

Positive graphs.

Tamás Hubai, Dávid Kunszenti-Kovács, László Lovász

Electron. Notes Discret. Math., 2016

Preface.

László Lovász, Jaroslav Nesetril, Alexander Schrijver

Eur. J. Comb., 2016

Positive graphs.

Omar Antolín Camarena, Endre Csóka, Tamás Hubai, Gábor Lippner, László Lovász

Eur. J. Comb., 2016

2013

Left and right convergence of graphs with bounded degree.

Christian Borgs, Jennifer T. Chayes, Jeff Kahn, László Lovász

Random Struct. Algorithms, 2013

Preface.

László Lovász, Attila Sali, Vera T. Sós

Electron. Notes Discret. Math., 2013

Non-Deterministic Graph Property Testing.

László Lovász, Katalin Vesztergombi

Comb. Probab. Comput., 2013

2012

Local Versus Global Properties of Metric Spaces.

Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala

SIAM J. Comput., 2012

Random graphons and a weak Positivstellensatz for graphs.

László Lovász, Balázs Szegedy

J. Graph Theory, 2012

Computational results of an O^∗(n⁴) volume algorithm.

László Lovász, István Deák

Eur. J. Oper. Res., 2012

Nondeterministic graph property testing

László Lovász, Katalin Vesztergombi

CoRR, 2012

Large Networks and Graph Limits.

László Lovász

Colloquium Publications 60, American Mathematical Society, ISBN: 978-0-8218-9085-1, 2012

2011

Finitely forcible graphons.

László Lovász, Balázs Szegedy

J. Comb. Theory, Ser. B, 2011

Preface.

László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver

Eur. J. Comb., 2011

Limits of randomly grown graph sequences.

Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Katalin Vesztergombi

Eur. J. Comb., 2011

Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko Conjecture.

László Lovász

Electron. J. Comb., 2011

Dot Product Representations of Planar Graphs.

Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman

Electron. J. Comb., 2011

2010

The History of the LLL-Algorithm.

Ionica Smeets, Arjen K. Lenstra, Hendrik Lenstra, László Lovász, Peter van Emde Boas

Proceedings of the LLL Algorithm - Survey and Applications, 2010

Dual graph homomorphism functions.

László Lovász, Alexander Schrijver

J. Comb. Theory, Ser. A, 2010

Exit Frequency Matrices for Finite Markov Chains.

Andrew Beveridge, László Lovász

Comb. Probab. Comput., 2010

2009

Contractors and connectors of graph algebras.

László Lovász, Balázs Szegedy

J. Graph Theory, 2009

Approximate Counting and Quantum Computation

Magnus Bordewich, Michael H. Freedman, László Lovász, D. Welsh

CoRR, 2009

Semidefinite Functions on Categories.

László Lovász, Alexander Schrijver

Electron. J. Comb., 2009

2008

Generalized quasirandom graphs.

László Lovász, Vera T. Sós

J. Comb. Theory, Ser. B, 2008

Graph parameters and semigroup functions.

László Lovász, Alexander Schrijver

Eur. J. Comb., 2008

Some Mathematics Behind Graph Property Testing.

László Lovász

Proceedings of the Discovery Science, 11th International Conference, 2008

2007

The geometry of logconcave functions and sampling algorithms.

László Lovász, Santosh S. Vempala

Random Struct. Algorithms, 2007

(Almost) Tight bounds and existence theorems for single-commodity confluent flows.

Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta

J. ACM, 2007

Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding.

Kamal Jain, László Lovász, Philip A. Chou

Distributed Comput., 2007

Approximating Graphs by Graphs and Functions (Abstract).

László Lovász

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006

Proving Integrality Gaps without Knowing the Linear Program.

Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis

Theory Comput., 2006

Hit-and-Run from a Corner.

László Lovász, Santosh S. Vempala

SIAM J. Comput., 2006

Limits of dense graph sequences.

László Lovász, Balázs Szegedy

J. Comb. Theory, Ser. B, 2006

A localization inequality for set functions.

László Lovász, Michael E. Saks

J. Comb. Theory, Ser. A, 2006

Simulated annealing in convex bodies and an <i>O</i>^*(<i>n</i>⁴) volume algorithm.

László Lovász, Santosh S. Vempala

J. Comput. Syst. Sci., 2006

Semi-matchings for bipartite graphs and load balancing.

Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir

J. Algorithms, 2006

The rank of connection matrices and the dimension of graph algebras.

László Lovász

Eur. J. Comb., 2006

Normal hypergraphs and the perfect graph conjecture.

László Lovász

Discret. Math., 2006

Blocking Conductance and Mixing in Random Walks.

Ravi Kannan, László Lovász, Ravi Montenegro

Comb. Probab. Comput., 2006

Waiting for a Bat to Fly By (in Polynomial Time).

Itai Benjamini, Gady Kozma, László Lovász, Dan Romik, Gábor Tardos

Comb. Probab. Comput., 2006

Graph limits and parameter testing.

Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization.

László Lovász, Santosh S. Vempala

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.

László Lovász

Oper. Res. Lett., 2005

2004

Approximating Min Sum Set Cover.

Uriel Feige, László Lovász, Prasad Tetali

Algorithmica, 2004

(Almost) tight bounds and existence theorems for confluent flows.

Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003

Logconcave Functions: Geometry and Efficient Sampling Algorithms

László Lovász, Santosh S. Vempala

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm.

László Lovász, Santosh S. Vempala

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002

Lecture Notes on Evasiveness of Graph Properties

László Lovász, Neal E. Young

CoRR, 2002

Global Information from Local Observation.

Itai Benjamini, László Lovász

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Proving Integrality Gaps without Knowing the Linear Program.

Sanjeev Arora, Béla Bollobás, László Lovász

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Steinitz Representations of Polyhedra and the Colin de Verdière Number.

László Lovász

J. Comb. Theory, Ser. B, 2001

Energy of Convex Sets, Shortest Paths, and Resistance.

László Lovász

J. Comb. Theory, Ser. A, 2001

Unextendible Product Bases.

Noga Alon, László Lovász

J. Comb. Theory, Ser. A, 2001

Critical Facets of the Stable Set Polytope.

László Lipták, László Lovász

Comb., 2001

2000

Facets with fixed defect of the stable set polytope.

László Lipták, László Lovász

Math. Program., 2000

The Cover Time, the Blanket Time, and the Matthews Bound.

Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Hit-and-run mixes fast.

László Lovász

Math. Program., 1999

Faster Mixing via Average Conductance.

László Lovász, Ravi Kannan

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Lifting Markov Chains to Speed up Mixing.

Fang Chen, László Lovász, Igor Pak

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998

Random walks and the regeneration time.

Andrew Beveridge, László Lovász

J. Graph Theory, 1998

Reversal of Markov Chains and the Forget Time.

László Lovász, Peter Winkler

Comb. Probab. Comput., 1998

Approximation of Diameters: Randomization Doesn't Help.

Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Random walks and an O^*(n⁵) volume algorithm for convex bodies.

Ravi Kannan, László Lovász, Miklós Simonovits

Random Struct. Algorithms, 1997

The Membership Problem in Jump Systems.

László Lovász

J. Comb. Theory, Ser. B, 1997

On Conway's Thrackle Conjecture.

László Lovász, János Pach, Mario Szegedy

Discret. Comput. Geom., 1997

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

Andrew Kotlov, László Lovász, Santosh S. Vempala

Comb., 1997

Mixing times.

László Lovász, Peter Winkler

Proceedings of the Microsurveys in Discrete Probability, 1997

1996

The rank and size of graphs.

Andrew Kotlov, László Lovász

J. Graph Theory, 1996

Interactive Proofs and the Hardness of Approximating Cliques.

Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy

J. ACM, 1996

1995

Search Problems in the Decision Tree Model.

László Lovász, Moni Naor, Ilan Newman, Avi Wigderson

SIAM J. Discret. Math., 1995

Isoperimetric Problems for Convex Bodies and a Localization Lemama.

Ravi Kannan, László Lovász, Miklós Simonovits

Discret. Comput. Geom., 1995

Exact Mixing in an Unknown Markov Chain.

László Lovász, Peter Winkler

Electron. J. Comb., 1995

Efficient stopping rules for Markov chains.

László Lovász, Peter Winkler

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Stable sets and polynomials.

László Lovász

Discret. Math., 1994

1993

A Monte-Carlo Algorithm for Estimating the Permanent.

Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby

SIAM J. Comput., 1993

Random Walks in a Convex Body and an Improved Volume Algorithm.

László Lovász, Miklós Simonovits

Random Struct. Algorithms, 1993

A note on the last new vertex visited by a random walk.

László Lovász, Peter Winkler

J. Graph Theory, 1993

Communication Complexity and Combinatorial Lattice Theory.

László Lovász, Michael E. Saks

J. Comput. Syst. Sci., 1993

The Cocycle Lattice of Binary Matroids .

László Lovász, Ákos Seress

Eur. J. Comb., 1993

Dating to Marriage.

J. Csima, László Lovász

Discret. Appl. Math., 1993

Randomized algorithms in combinatorial optimization.

László Lovász

Proceedings of the Combinatorial Optimization, 1993

Combinatorial problems and exercises (2. ed.).

László Lovász

North-Holland, ISBN: 978-0-444-81504-0, 1993

1992

The Generalized Basis Reduction Algorithm.

László Lovász, Herbert E. Scarf

Math. Oper. Res., 1992

A matching algorithm for regular bipartite graphs.

J. Csima, László Lovász

Discret. Appl. Math., 1992

On integer points in polyhedra: a lower bound.

Imre Bárány, Roger Howe, László Lovász

Comb., 1992

Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract)

Uriel Feige, László Lovász

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Linear Decision Trees: Volume Estimates and Topological Bounds

Anders Björner, László Lovász, Andrew Chi-Chih Yao

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

On the Randomized Complexity of Volume and Diameter

László Lovász, Miklós Simonovits

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Cones of Matrices and Set-Functions and 0-1 Optimization.

László Lovász, Alexander Schrijver

SIAM J. Optim., 1991

Chip-firing Games on Graphs.

Anders Björner, László Lovász, Peter W. Shor

Eur. J. Comb., 1991

Graphs with Given Automorphism Group and Few Edge Orbits.

László Babai, Albert J. Goodman, László Lovász

Eur. J. Comb., 1991

Search Problems in the Decision Tree Model (Preliminary Version)

László Lovász, Moni Naor, Ilan Newman, Avi Wigderson

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Approximating Clique is Almost NP-Complete (Preliminary Version)

Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

The Shapes of Polyhedra.

Ravi Kannan, László Lovász, Herbert E. Scarf

Math. Oper. Res., 1990

Entropy splitting for antiblocking corners and perfect graphs.

Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi

Comb., 1990

On the number of halving planes.

Imre Bárány, Zoltán Füredi, László Lovász

Comb., 1990

The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume

László Lovász, Miklós Simonovits

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Matrix Cones, Projection Representations, and Stable Set Polyhedra.

László Lovász, Alexander Schrijver

Proceedings of the Polyhedral Combinatorics, 1990

1989

An on-line graph coloring algorithm with sublinear performance ratio.

László Lovász, Michael E. Saks, William T. Trotter

Discret. Math., 1989

The intersection of matroids and antimatroids.

Bernhard Korte, László Lovász

Discret. Math., 1989

On the Graph of Large Distance.

Paul Erdös, László Lovász, Katalin Vesztergombi

Discret. Comput. Geom., 1989

Faster Algorithms for Hard Problems.

László Lovász

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

Rubber bands, convex embeddings and graph connectivity.

Nathan Linial, László Lovász, Avi Wigderson

Comb., 1988

Lattices, Möbius Functions and Communication Complexity

László Lovász, Michael E. Saks

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Geometric Algorithms and Combinatorial Optimization

Martin Grötschel, László Lovász, Alexander Schrijver

Algorithms and Combinatorics 2, Springer, ISBN: 978-3-642-97881-4, 1988

1987

Matching structure and the matching lattice.

László Lovász

J. Comb. Theory, Ser. B, 1987

On some combinatorial properties of algebraic matroids.

Andreas W. M. Dress, László Lovász

Comb., 1987

1986

Searching in Trees, Series-Parallel and Interval Orders.

Ulrich Faigle, László Lovász, Rainer Schrader, György Turán

SIAM J. Comput., 1986

Relaxations of vertex packing.

Martin Grötschel, László Lovász, Alexander Schrijver

J. Comb. Theory, Ser. B, 1986

Discrepancy of Set-systems and Matrices.

László Lovász, Joel Spencer, Katalin Vesztergombi

Eur. J. Comb., 1986

Non-interval greedoids and the transposition property.

Bernhard Korte, László Lovász

Discret. Math., 1986

Homomorphisms and Ramsey properties of antimatroids.

Bernhard Korte, László Lovász

Discret. Appl. Math., 1986

Connectivity Algorithms Using Rubber-bands.

László Lovász

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

Covering Minima and Lattice Point Free Convex Bodies.

Ravi Kannan, László Lovász

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications

Nathan Linial, László Lovász, Avi Wigderson

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Algorithmic theory of numbers, graphs and convexity.

László Lovász

CBMS-NSF regional conference series in applied mathematics 50, SIAM, ISBN: 978-0-89871-203-2, 1986

1985

Relations between subclasses of greedoids.

Bernhard Korte, László Lovász

Z. Oper. Research, 1985

Lengths of cycles in halin graphs.

J. Adrian Bondy, László Lovász

J. Graph Theory, 1985

Polymatroid greedoids.

Bernhard Korte, László Lovász

J. Comb. Theory, Ser. B, 1985

A Note on Selectors and Greedoids.

Bernhard Korte, László Lovász

Eur. J. Comb., 1985

Vertex Packing Algorithms.

László Lovász

Proceedings of the Automata, 1985

Computing ears and branchings in parallel

László Lovász

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".

Martin Grötschel, László Lovász, Alexander Schrijver

Comb., 1984

Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers

Ravindran Kannan, Arjen K. Lenstra, László Lovász

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

Ear-decompositions of matching covered graphs.

László Lovász

Comb., 1983

Structural properties of greedoids.

Bernhard Korte, László Lovász

Comb., 1983

1982

Tibor Gallai.

László Lovász

Comb., 1982

Brick decompositions and the matching rank of graphs.

Jack Edmonds, László Lovász, William R. Pulleyblank

Comb., 1982

Submodular functions and convexity.

László Lovász

Proceedings of the Mathematical Programming The State of the Art, 1982

1981

The ellipsoid method and its consequences in combinatorial optimization.

Martin Grötschel, László Lovász, Alexander Schrijver

Comb., 1981

Cycles through specified vertices of a graph.

J. Adrian Bondy, László Lovász

Comb., 1981

Mathematical Structures Underlying Greedy Algorithms.

Bernhard Korte, László Lovász

Proceedings of the Fundamentals of Computation Theory, 1981

1980

On a product dimension of graphs.

László Lovász, Jaroslav Nesetril, Ales Pultr

J. Comb. Theory, Ser. B, 1980

Matroid matching and some applications.

László Lovász

J. Comb. Theory, Ser. B, 1980

Matroids and Sperner's Lemma.

László Lovász

Eur. J. Comb., 1980

1979

On the Shannon capacity of a graph.

László Lovász

IEEE Trans. Inf. Theory, 1979

Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems

Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

On determinants, matchings, and random algorithms.

László Lovász

Proceedings of the Fundamentals of Computation Theory, 1979

1978

Kneser's Conjecture, Chromatic Number, and Homotopy.

László Lovász

J. Comb. Theory, Ser. A, 1978

1977

Some Remarks on Generalized Spectra.

László Lovász, Péter Gács

Math. Log. Q., 1977

On minimal elementary bipartite graphs.

László Lovász, Michael D. Plummer

J. Comb. Theory, Ser. B, 1977

1976

On two minimax theorems in graph.

László Lovász

J. Comb. Theory, Ser. B, 1976

1975

On the ratio of optimal integral and fractional covers.

László Lovász

Discret. Math., 1975