László Lovász

Publication Activity (10 Years)

Years Active: 1972-2024
Publications (10 Years): 7

Top Venues

Eur. J. Comb.

Electron. J. Comb.

Electron. Notes Discret. Math.

J. Comb. Theory B

Publications

Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy
Random homomorphisms into the orthogonality graph. J. Comb. Theory B 167 (2024)
Endre Csóka, Tamás Hubai, László Lovász
Locally common graphs. J. Graph Theory 102 (3) (2023)
László Lovász
Discrete Quantitative Nodal Theorem. Electron. J. Comb. 28 (3) (2021)
Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy
Measures on the square as sparse graph limits. J. Comb. Theory, Ser. B 138 (2019)
László Lovász, Jaroslav Nesetril, Alexander Schrijver
Preface. Eur. J. Comb. 52 (2016)
Tamás Hubai, Dávid Kunszenti-Kovács, László Lovász
Positive graphs. Electron. Notes Discret. Math. 54 (2016)
Omar Antolín Camarena, Endre Csóka, Tamás Hubai, Gábor Lippner, László Lovász
Positive graphs. Eur. J. Comb. 52 (2016)
László Lovász, Katalin Vesztergombi
Non-Deterministic Graph Property Testing. Comb. Probab. Comput. 22 (5) (2013)
Christian Borgs, Jennifer T. Chayes, Jeff Kahn, László Lovász
Left and right convergence of graphs with bounded degree. Random Struct. Algorithms 42 (1) (2013)
László Lovász, Attila Sali, Vera T. Sós
Preface. Electron. Notes Discret. Math. 43 (2013)
László Lovász, Balázs Szegedy
Random graphons and a weak Positivstellensatz for graphs. J. Graph Theory 70 (2) (2012)
László Lovász, Katalin Vesztergombi
Nondeterministic graph property testing CoRR (2012)
Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala
Local Versus Global Properties of Metric Spaces. SIAM J. Comput. 41 (1) (2012)
László Lovász, István Deák
) volume algorithm. Eur. J. Oper. Res. 216 (1) (2012)
László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver
Preface. Eur. J. Comb. 32 (7) (2011)
Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman
Dot Product Representations of Planar Graphs. Electron. J. Comb. 18 (1) (2011)
László Lovász
Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko Conjecture. Electron. J. Comb. 18 (1) (2011)
László Lovász, Balázs Szegedy
Finitely forcible graphons. J. Comb. Theory, Ser. B 101 (5) (2011)
Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Katalin Vesztergombi
Limits of randomly grown graph sequences. Eur. J. Comb. 32 (7) (2011)
Andrew Beveridge, László Lovász
Exit Frequency Matrices for Finite Markov Chains. Comb. Probab. Comput. 19 (4) (2010)
László Lovász, Alexander Schrijver
Dual graph homomorphism functions. J. Comb. Theory, Ser. A 117 (2) (2010)
László Lovász, Alexander Schrijver
Semidefinite Functions on Categories. Electron. J. Comb. 16 (2) (2009)
László Lovász, Balázs Szegedy
Contractors and connectors of graph algebras. J. Graph Theory 60 (1) (2009)
Magnus Bordewich, Michael H. Freedman, László Lovász, D. Welsh
Approximate Counting and Quantum Computation CoRR (2009)
László Lovász, Vera T. Sós
Generalized quasirandom graphs. J. Comb. Theory, Ser. B 98 (1) (2008)
László Lovász
Some Mathematics Behind Graph Property Testing. Discovery Science (2008)
László Lovász, Alexander Schrijver
Graph parameters and semigroup functions. Eur. J. Comb. 29 (4) (2008)
László Lovász
Some Mathematics behind Graph Property Testing. ALT (2008)
Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
(Almost) Tight bounds and existence theorems for single-commodity confluent flows. J. ACM 54 (4) (2007)
László Lovász
Approximating Graphs by Graphs and Functions (Abstract). FCT (2007)
László Lovász, Santosh S. Vempala
The geometry of logconcave functions and sampling algorithms. Random Struct. Algorithms 30 (3) (2007)
Kamal Jain, László Lovász, Philip A. Chou
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. Distributed Comput. 19 (4) (2007)
Itai Benjamini, Gady Kozma, László Lovász, Dan Romik, Gábor Tardos
Waiting for a Bat to Fly By (in Polynomial Time). Comb. Probab. Comput. 15 (5) (2006)
László Lovász, Michael E. Saks
A localization inequality for set functions. J. Comb. Theory, Ser. A 113 (4) (2006)
László Lovász, Santosh S. Vempala
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. FOCS (2006)
Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi
Graph limits and parameter testing. STOC (2006)
László Lovász
Normal hypergraphs and the perfect graph conjecture. Discret. Math. 306 (10-11) (2006)
László Lovász, Santosh S. Vempala
Hit-and-Run from a Corner. SIAM J. Comput. 35 (4) (2006)
Ravi Kannan, László Lovász, Ravi Montenegro
Blocking Conductance and Mixing in Random Walks. Comb. Probab. Comput. 15 (4) (2006)
Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala
Local versus global properties of metric spaces. SODA (2006)
László Lovász
The rank of connection matrices and the dimension of graph algebras. Eur. J. Comb. 27 (6) (2006)
László Lovász, Balázs Szegedy
Limits of dense graph sequences. J. Comb. Theory, Ser. B 96 (6) (2006)
Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
Semi-matchings for bipartite graphs and load balancing. J. Algorithms 59 (1) (2006)
Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis
Proving Integrality Gaps without Knowing the Linear Program. Theory Comput. 2 (2) (2006)
László Lovász, Santosh S. Vempala
) volume algorithm. J. Comput. Syst. Sci. 72 (2) (2006)
Kamal Jain, László Lovász, Philip A. Chou
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. PODC (2005)
László Lovász
Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. Oper. Res. Lett. 33 (4) (2005)
Uriel Feige, László Lovász, Prasad Tetali
Approximating Min Sum Set Cover. Algorithmica 40 (4) (2004)
Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
(Almost) tight bounds and existence theorems for confluent flows. STOC (2004)
László Lovász, Santosh S. Vempala
Hit-and-run from a corner. STOC (2004)
Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
Semi-matchings for Bipartite Graphs and Load Balancing. WADS (2003)
László Lovász, Santosh S. Vempala
Logconcave Functions: Geometry and Efficient Sampling Algorithms FOCS (2003)
László Lovász, Santosh S. Vempala
Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. FOCS (2003)
Uriel Feige, László Lovász, Prasad Tetali
Approximating Min-sum Set Cover. APPROX (2002)
László Lovász, Neal E. Young
Lecture Notes on Evasiveness of Graph Properties CoRR (2002)
Itai Benjamini, László Lovász
Global Information from Local Observation. FOCS (2002)
Sanjeev Arora, Béla Bollobás, László Lovász
Proving Integrality Gaps without Knowing the Linear Program. FOCS (2002)
Noga Alon, László Lovász
Unextendible Product Bases. J. Comb. Theory, Ser. A 95 (1) (2001)
László Lovász
Energy of Convex Sets, Shortest Paths, and Resistance. J. Comb. Theory, Ser. A 94 (2) (2001)
László Lovász
Steinitz Representations of Polyhedra and the Colin de Verdière Number. J. Comb. Theory, Ser. B 82 (2) (2001)
László Lipták, László Lovász
Critical Facets of the Stable Set Polytope. Comb. 21 (1) (2001)
Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu
The Cover Time, the Blanket Time, and the Matthews Bound. FOCS (2000)
László Lipták, László Lovász
Facets with fixed defect of the stable set polytope. Math. Program. 88 (1) (2000)
Fang Chen, László Lovász, Igor Pak
Lifting Markov Chains to Speed up Mixing. STOC (1999)
László Lovász, Ravi Kannan
Faster Mixing via Average Conductance. STOC (1999)
László Lovász
Hit-and-run mixes fast. Math. Program. 86 (3) (1999)
László Lovász, Peter Winkler
Reversal of Markov Chains and the Forget Time. Comb. Probab. Comput. 7 (2) (1998)
Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits
Approximation of Diameters: Randomization Doesn't Help. FOCS (1998)
Andrew Beveridge, László Lovász
Random walks and the regeneration time. J. Graph Theory 29 (2) (1998)
László Lovász, János Pach, Mario Szegedy
On Conway's Thrackle Conjecture. Discret. Comput. Geom. 18 (4) (1997)
Andrew Kotlov, László Lovász, Santosh S. Vempala
The Colin de Verdière Number and Sphere Representations of a Graph. Comb. 17 (4) (1997)
László Lovász, Peter Winkler
Mixing times. Microsurveys in Discrete Probability (1997)
László Lovász
The Membership Problem in Jump Systems. J. Comb. Theory, Ser. B 70 (1) (1997)
Ravi Kannan, László Lovász, Miklós Simonovits
) volume algorithm for convex bodies. Random Struct. Algorithms 11 (1) (1997)
Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy
Interactive Proofs and the Hardness of Approximating Cliques. J. ACM 43 (2) (1996)
Andrew Kotlov, László Lovász
The rank and size of graphs. J. Graph Theory 23 (2) (1996)
László Lovász, Peter Winkler
Exact Mixing in an Unknown Markov Chain. Electron. J. Comb. 2 (1995)
László Lovász, János Pach, Mario Szegedy
On Conway's Thrackle Conjecture. SCG (1995)
László Lovász, Peter Winkler
Efficient stopping rules for Markov chains. STOC (1995)
László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
Search Problems in the Decision Tree Model. SIAM J. Discret. Math. 8 (1) (1995)
Ravi Kannan, László Lovász, Miklós Simonovits
Isoperimetric Problems for Convex Bodies and a Localization Lemama. Discret. Comput. Geom. 13 (1995)
László Lovász
Stable sets and polynomials. Discret. Math. 124 (1-3) (1994)
László Lovász, Michael E. Saks
Communication Complexity and Combinatorial Lattice Theory. J. Comput. Syst. Sci. 47 (2) (1993)
László Lovász, Peter Winkler
A note on the last new vertex visited by a random walk. J. Graph Theory 17 (5) (1993)
László Lovász
Randomized algorithms in combinatorial optimization. Combinatorial Optimization (1993)
László Lovász, Miklós Simonovits
Random Walks in a Convex Body and an Improved Volume Algorithm. Random Struct. Algorithms 4 (4) (1993)
Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby
A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput. 22 (2) (1993)
László Lovász, Ákos Seress
The Cocycle Lattice of Binary Matroids . Eur. J. Comb. 14 (3) (1993)
J. Csima, László Lovász
Dating to Marriage. Discret. Appl. Math. 41 (3) (1993)
J. Csima, László Lovász
A matching algorithm for regular bipartite graphs. Discret. Appl. Math. 35 (3) (1992)
Uriel Feige, László Lovász
Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) STOC (1992)
László Lovász, Miklós Simonovits
On the Randomized Complexity of Volume and Diameter FOCS (1992)
Anders Björner, László Lovász, Andrew Chi-Chih Yao
Linear Decision Trees: Volume Estimates and Topological Bounds STOC (1992)
László Lovász, Herbert E. Scarf
The Generalized Basis Reduction Algorithm. Math. Oper. Res. 17 (3) (1992)
Imre Bárány, Roger Howe, László Lovász
On integer points in polyhedra: a lower bound. Comb. 12 (2) (1992)
László Babai, Albert J. Goodman, László Lovász
Graphs with Given Automorphism Group and Few Edge Orbits. Eur. J. Comb. 12 (3) (1991)
Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy
Approximating Clique is Almost NP-Complete (Preliminary Version) FOCS (1991)
László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
Search Problems in the Decision Tree Model (Preliminary Version) FOCS (1991)
László Lovász, Alexander Schrijver
Cones of Matrices and Set-Functions and 0-1 Optimization. SIAM J. Optim. 1 (2) (1991)
Anders Björner, László Lovász, Peter W. Shor
Chip-firing Games on Graphs. Eur. J. Comb. 12 (4) (1991)

László Lovász.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

László Lovász