László Lovász

166 papers A* 29B 6Journal 114Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Cycle matroids of graphings: From convergence to duality. J. Comb. Theory B Kristóf Bérczi, Márton Borbényi, László Lovász, László Márton Tóth
2026	A*	`conf`	Interaction Between Skew-representability, Tensor Products, Extension Properties, and Rank Inequalities. SODA Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Carles Padró, Tamás Schwarcz
2026	J	`jnl`	Monotonic Decompositions of Submodular Set Functions. SIAM J. Discret. Math. Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Tamás Schwarcz
2026	J	`jnl`	Quotient-Convergence of Submodular Setfunctions. Comb. Kristóf Bérczi, Márton Borbényi, László Lovász, László Márton Tóth
2025	J	`jnl`	Interaction between skew-representability, tensor products, extension properties, and rank inequalities. CoRR Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Carles Padró, Tamás Schwarcz
2025	A*	`conf`	Matroid Products via Submodular Coupling. STOC Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Balázs Maga, Tamás Schwarcz
2025	J	`jnl`	Switchover phenomenon for general graphs. J. Graph Theory Dániel Keliger, László Lovász, Tamás Ferenc Móri, Gergely Ódor
2024	J	`jnl`	Matroid products via submodular coupling. CoRR Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Balázs Maga, Tamás Schwarcz
2024	J	`jnl`	Random homomorphisms into the orthogonality graph. J. Comb. Theory B Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy
2024	J	`jnl`	The matroid of a graphing. J. Comb. Theory B László Lovász
2023	J	`jnl`	Locally common graphs. J. Graph Theory Endre Csóka, Tamás Hubai, László Lovász
2021	J	`jnl`	Discrete Quantitative Nodal Theorem. Electron. J. Comb. László Lovász
2019	J	`jnl`	Measures on the square as sparse graph limits. J. Comb. Theory B Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy
2016	J	`jnl`	Positive graphs. Eur. J. Comb. Omar Antolín Camarena, Endre Csóka, Tamás Hubai, Gábor Lippner, László Lovász
2016	J	`jnl`	Positive graphs. Electron. Notes Discret. Math. Tamás Hubai, Dávid Kunszenti-Kovács, László Lovász
2016	J	`jnl`	Preface. Eur. J. Comb. László Lovász, Jaroslav Nesetril, Alexander Schrijver
2013	J	`jnl`	Left and right convergence of graphs with bounded degree. Random Struct. Algorithms Christian Borgs, Jennifer T. Chayes, Jeff Kahn, László Lovász
2013	J	`jnl`	Non-Deterministic Graph Property Testing. Comb. Probab. Comput. László Lovász, Katalin Vesztergombi
2013	J	`jnl`	Preface. Electron. Notes Discret. Math. László Lovász, Attila Sali, Vera T. Sós
2012	J	`jnl`	Computational results of an O Eur. J. Oper. Res. László Lovász, István Deák
2012	—	`book`	Large Networks and Graph Limits. László Lovász
2012	J	`jnl`	Local Versus Global Properties of Metric Spaces. SIAM J. Comput. Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala
2012	J	`jnl`	Nondeterministic graph property testing CoRR László Lovász, Katalin Vesztergombi
2012	J	`jnl`	Random graphons and a weak Positivstellensatz for graphs. J. Graph Theory László Lovász, Balázs Szegedy
2011	J	`jnl`	Dot Product Representations of Planar Graphs. Electron. J. Comb. Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman
2011	J	`jnl`	Finitely forcible graphons. J. Comb. Theory B László Lovász, Balázs Szegedy
2011	J	`jnl`	Limits of randomly grown graph sequences. Eur. J. Comb. Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Katalin Vesztergombi
2011	J	`jnl`	Preface. Eur. J. Comb. László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver
2011	J	`jnl`	Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko Conjecture. Electron. J. Comb. László Lovász
2010	J	`jnl`	Dual graph homomorphism functions. J. Comb. Theory A László Lovász, Alexander Schrijver
2010	J	`jnl`	Exit Frequency Matrices for Finite Markov Chains. Comb. Probab. Comput. Andrew Beveridge, László Lovász
2010	—	`ch.`	The History of the LLL-Algorithm. The LLL Algorithm Ionica Smeets, Arjen K. Lenstra, Hendrik Lenstra, László Lovász, Peter van Emde Boas
2009	J	`jnl`	Approximate Counting and Quantum Computation CoRR Magnus Bordewich, Michael H. Freedman, László Lovász, D. Welsh
2009	J	`jnl`	Contractors and connectors of graph algebras. J. Graph Theory László Lovász, Balázs Szegedy
2009	—	`ed.`	Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany Bonn Workshop on Combinatorial Optimization William J. Cook, László Lovász, Jens Vygen
2009	J	`jnl`	Semidefinite Functions on Categories. Electron. J. Comb. László Lovász, Alexander Schrijver
2008	J	`jnl`	Generalized quasirandom graphs. J. Comb. Theory B László Lovász, Vera T. Sós
2008	J	`jnl`	Graph parameters and semigroup functions. Eur. J. Comb. László Lovász, Alexander Schrijver
2008	B	`conf`	Some Mathematics Behind Graph Property Testing. Discovery Science László Lovász
2008	B	`conf`	Some Mathematics behind Graph Property Testing. ALT László Lovász
2007	J	`jnl`	(Almost) Tight bounds and existence theorems for single-commodity confluent flows. J. ACM Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
2007	B	`conf`	Approximating Graphs by Graphs and Functions (Abstract). FCT László Lovász
2007	J	`jnl`	Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. Distributed Comput. Kamal Jain, László Lovász, Philip A. Chou
2007	J	`jnl`	The geometry of logconcave functions and sampling algorithms. Random Struct. Algorithms László Lovász, Santosh S. Vempala
2006	J	`jnl`	A localization inequality for set functions. J. Comb. Theory A László Lovász, Michael E. Saks
2006	J	`jnl`	Blocking Conductance and Mixing in Random Walks. Comb. Probab. Comput. Ravi Kannan, László Lovász, Ravi Montenegro
2006	A*	`conf`	Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. FOCS László Lovász, Santosh S. Vempala
2006	A*	`conf`	Graph limits and parameter testing. STOC Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi
2006	J	`jnl`	Hit-and-Run from a Corner. SIAM J. Comput. László Lovász, Santosh S. Vempala
2006	J	`jnl`	Limits of dense graph sequences. J. Comb. Theory B László Lovász, Balázs Szegedy
2006	A*	`conf`	Local versus global properties of metric spaces. SODA Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala
2006	J	`jnl`	Normal hypergraphs and the perfect graph conjecture. Discret. Math. László Lovász
2006	J	`jnl`	Proving Integrality Gaps without Knowing the Linear Program. Theory Comput. Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis
2006	J	`jnl`	Semi-matchings for bipartite graphs and load balancing. J. Algorithms Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
2006	J	`jnl`	Simulated annealing in convex bodies and an J. Comput. Syst. Sci. László Lovász, Santosh S. Vempala
2006	J	`jnl`	The rank of connection matrices and the dimension of graph algebras. Eur. J. Comb. László Lovász
2006	J	`jnl`	Waiting for a Bat to Fly By (in Polynomial Time). Comb. Probab. Comput. Itai Benjamini, Gady Kozma, László Lovász, Dan Romik, Gábor Tardos
2005	A*	`conf`	Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. PODC Kamal Jain, László Lovász, Philip A. Chou
2005	J	`jnl`	Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. Oper. Res. Lett. László Lovász
2004	A*	`conf`	(Almost) tight bounds and existence theorems for confluent flows. STOC Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
2004	J	`jnl`	Approximating Min Sum Set Cover. Algorithmica Uriel Feige, László Lovász, Prasad Tetali
2004	A*	`conf`	Hit-and-run from a corner. STOC László Lovász, Santosh S. Vempala
2003	A*	`conf`	Logconcave Functions: Geometry and Efficient Sampling Algorithms FOCS László Lovász, Santosh S. Vempala
2003	B	`conf`	Semi-matchings for Bipartite Graphs and Load Balancing. WADS Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
2003	A*	`conf`	Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. FOCS László Lovász, Santosh S. Vempala
2002	—	`conf`	Approximating Min-sum Set Cover. APPROX Uriel Feige, László Lovász, Prasad Tetali
2002	A*	`conf`	Global Information from Local Observation. FOCS Itai Benjamini, László Lovász
2002	J	`jnl`	Lecture Notes on Evasiveness of Graph Properties CoRR László Lovász, Neal E. Young
2002	A*	`conf`	Proving Integrality Gaps without Knowing the Linear Program. FOCS Sanjeev Arora, Béla Bollobás, László Lovász
2001	J	`jnl`	Critical Facets of the Stable Set Polytope. Comb. László Lipták, László Lovász
2001	J	`jnl`	Energy of Convex Sets, Shortest Paths, and Resistance. J. Comb. Theory A László Lovász
2001	J	`jnl`	Steinitz Representations of Polyhedra and the Colin de Verdière Number. J. Comb. Theory B László Lovász
2001	J	`jnl`	Unextendible Product Bases. J. Comb. Theory A Noga Alon, László Lovász
2000	J	`jnl`	Facets with fixed defect of the stable set polytope. Math. Program. László Lipták, László Lovász
2000	A*	`conf`	The Cover Time, the Blanket Time, and the Matthews Bound. FOCS Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu
1999	A*	`conf`	Faster Mixing via Average Conductance. STOC László Lovász, Ravi Kannan
1999	J	`jnl`	Hit-and-run mixes fast. Math. Program. László Lovász
1999	A*	`conf`	Lifting Markov Chains to Speed up Mixing. STOC Fang Chen, László Lovász, Igor Pak
1998	A*	`conf`	Approximation of Diameters: Randomization Doesn't Help. FOCS Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits
1998	J	`jnl`	Random walks and the regeneration time. J. Graph Theory Andrew Beveridge, László Lovász
1998	J	`jnl`	Reversal of Markov Chains and the Forget Time. Comb. Probab. Comput. László Lovász, Peter Winkler
1997	—	`conf`	Mixing times. Microsurveys in Discrete Probability László Lovász, Peter Winkler
1997	J	`jnl`	On Conway's Thrackle Conjecture. Discret. Comput. Geom. László Lovász, János Pach, Mario Szegedy
1997	J	`jnl`	Random walks and an O Random Struct. Algorithms Ravi Kannan, László Lovász, Miklós Simonovits
1997	J	`jnl`	The Colin de Verdière Number and Sphere Representations of a Graph. Comb. Andrew Kotlov, László Lovász, Santosh S. Vempala
1997	J	`jnl`	The Membership Problem in Jump Systems. J. Comb. Theory B László Lovász
1996	J	`jnl`	Interactive Proofs and the Hardness of Approximating Cliques. J. ACM Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy
1996	J	`jnl`	The rank and size of graphs. J. Graph Theory Andrew Kotlov, László Lovász
1995	—	`ed.`	Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93 Combinatorial Optimization William J. Cook, László Lovász, Paul D. Seymour
1995	A*	`conf`	Efficient stopping rules for Markov chains. STOC László Lovász, Peter Winkler
1995	J	`jnl`	Exact Mixing in an Unknown Markov Chain. Electron. J. Comb. László Lovász, Peter Winkler
1995	J	`jnl`	Isoperimetric Problems for Convex Bodies and a Localization Lemama. Discret. Comput. Geom. Ravi Kannan, László Lovász, Miklós Simonovits
1995	—	`conf`	On Conway's Thrackle Conjecture. SCG László Lovász, János Pach, Mario Szegedy
1995	J	`jnl`	Search Problems in the Decision Tree Model. SIAM J. Discret. Math. László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
1994	J	`jnl`	Stable sets and polynomials. Discret. Math. László Lovász
1993	J	`jnl`	A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput. Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby
1993	J	`jnl`	A note on the last new vertex visited by a random walk. J. Graph Theory László Lovász, Peter Winkler
1993	—	`book`	Combinatorial problems and exercises (2. ed.). László Lovász
1993	J	`jnl`	Communication Complexity and Combinatorial Lattice Theory. J. Comput. Syst. Sci. László Lovász, Michael E. Saks
1993	J	`jnl`	Dating to Marriage. Discret. Appl. Math. J. Csima, László Lovász
1993	J	`jnl`	Random Walks in a Convex Body and an Improved Volume Algorithm. Random Struct. Algorithms László Lovász, Miklós Simonovits
1993	—	`conf`	Randomized algorithms in combinatorial optimization. Combinatorial Optimization László Lovász
1993	J	`jnl`	The Cocycle Lattice of Binary Matroids . Eur. J. Comb. László Lovász, Ákos Seress
1992	J	`jnl`	A matching algorithm for regular bipartite graphs. Discret. Appl. Math. J. Csima, László Lovász
1992	A*	`conf`	Linear Decision Trees: Volume Estimates and Topological Bounds STOC Anders Björner, László Lovász, Andrew Chi-Chih Yao
1992	J	`jnl`	On integer points in polyhedra: a lower bound. Comb. Imre Bárány, Roger Howe, László Lovász
1992	A*	`conf`	On the Randomized Complexity of Volume and Diameter FOCS László Lovász, Miklós Simonovits
1992	J	`jnl`	The Generalized Basis Reduction Algorithm. Math. Oper. Res. László Lovász, Herbert E. Scarf
1992	A*	`conf`	Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) STOC Uriel Feige, László Lovász
1991	A*	`conf`	Approximating Clique is Almost NP-Complete (Preliminary Version) FOCS Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy
1991	J	`jnl`	Chip-firing Games on Graphs. Eur. J. Comb. Anders Björner, László Lovász, Peter W. Shor
1991	J	`jnl`	Cones of Matrices and Set-Functions and 0-1 Optimization. SIAM J. Optim. László Lovász, Alexander Schrijver
1991	J	`jnl`	Graphs with Given Automorphism Group and Few Edge Orbits. Eur. J. Comb. László Babai, Albert J. Goodman, László Lovász
1991	A*	`conf`	Search Problems in the Decision Tree Model (Preliminary Version) FOCS László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
1990	J	`jnl`	Entropy splitting for antiblocking corners and perfect graphs. Comb. Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi
1990	—	`conf`	Matrix Cones, Projection Representations, and Stable Set Polyhedra. Polyhedral Combinatorics László Lovász, Alexander Schrijver
1990	J	`jnl`	On the number of halving planes. Comb. Imre Bárány, Zoltán Füredi, László Lovász
1990	A*	`conf`	The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume FOCS László Lovász, Miklós Simonovits
1990	J	`jnl`	The Shapes of Polyhedra. Math. Oper. Res. Ravi Kannan, László Lovász, Herbert E. Scarf
1989	J	`jnl`	An on-line graph coloring algorithm with sublinear performance ratio. Discret. Math. László Lovász, Michael E. Saks, William T. Trotter
1989	—	`conf`	Faster Algorithms for Hard Problems. IFIP Congress László Lovász
1989	J	`jnl`	On the Graph of Large Distance. Discret. Comput. Geom. Paul Erdös, László Lovász, Katalin Vesztergombi
1989	—	`conf`	On the Number of Halving Planes. SCG Imre Bárány, Zoltán Füredi, László Lovász
1989	J	`jnl`	The intersection of matroids and antimatroids. Discret. Math. Bernhard Korte, László Lovász
1988	—	`book`	Geometric Algorithms and Combinatorial Optimization Martin Grötschel, László Lovász, Alexander Schrijver
1988	A*	`conf`	Lattices, Möbius Functions and Communication Complexity FOCS László Lovász, Michael E. Saks
1988	J	`jnl`	Rubber bands, convex embeddings and graph connectivity. Comb. Nathan Linial, László Lovász, Avi Wigderson
1987	J	`jnl`	Matching structure and the matching lattice. J. Comb. Theory B László Lovász
1987	J	`jnl`	On some combinatorial properties of algebraic matroids. Comb. Andreas W. M. Dress, László Lovász
1986	A*	`conf`	A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications FOCS Nathan Linial, László Lovász, Avi Wigderson
1986	—	`book`	Algorithmic theory of numbers, graphs and convexity. László Lovász
1986	—	`conf`	Connectivity Algorithms Using Rubber-bands. FSTTCS László Lovász
1986	—	`conf`	Covering Minima and Lattice Point Free Convex Bodies. FSTTCS Ravi Kannan, László Lovász
1986	J	`jnl`	Discrepancy of Set-systems and Matrices. Eur. J. Comb. László Lovász, Joel Spencer, Katalin Vesztergombi
1986	J	`jnl`	Homomorphisms and Ramsey properties of antimatroids. Discret. Appl. Math. Bernhard Korte, László Lovász
1986	J	`jnl`	Non-interval greedoids and the transposition property. Discret. Math. Bernhard Korte, László Lovász
1986	J	`jnl`	Relaxations of vertex packing. J. Comb. Theory B Martin Grötschel, László Lovász, Alexander Schrijver
1986	J	`jnl`	Searching in Trees, Series-Parallel and Interval Orders. SIAM J. Comput. Ulrich Faigle, László Lovász, Rainer Schrader, György Turán
1985	J	`jnl`	A Note on Selectors and Greedoids. Eur. J. Comb. Bernhard Korte, László Lovász
1985	A*	`conf`	Computing ears and branchings in parallel FOCS László Lovász
1985	J	`jnl`	Lengths of cycles in halin graphs. J. Graph Theory J. Adrian Bondy, László Lovász
1985	J	`jnl`	Polymatroid greedoids. J. Comb. Theory B Bernhard Korte, László Lovász
1985	J	`jnl`	Relations between subclasses of greedoids. Z. Oper. Research Bernhard Korte, László Lovász
1985	A*	`conf`	Vertex Packing Algorithms. ICALP László Lovász
1984	J	`jnl`	Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". Comb. Martin Grötschel, László Lovász, Alexander Schrijver
1984	A*	`conf`	Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers STOC Ravindran Kannan, Arjen K. Lenstra, László Lovász
1983	J	`jnl`	Ear-decompositions of matching covered graphs. Comb. László Lovász
1983	J	`jnl`	Structural properties of greedoids. Comb. Bernhard Korte, László Lovász
1982	J	`jnl`	Brick decompositions and the matching rank of graphs. Comb. Jack Edmonds, László Lovász, William R. Pulleyblank
1982	—	`conf`	Submodular functions and convexity. ISMP László Lovász
1982	J	`jnl`	Tibor Gallai. Comb. László Lovász
1981	J	`jnl`	Cycles through specified vertices of a graph. Comb. J. Adrian Bondy, László Lovász
1981	B	`conf`	Mathematical Structures Underlying Greedy Algorithms. FCT Bernhard Korte, László Lovász
1981	J	`jnl`	The ellipsoid method and its consequences in combinatorial optimization. Comb. Martin Grötschel, László Lovász, Alexander Schrijver
1980	J	`jnl`	Matroid matching and some applications. J. Comb. Theory B László Lovász
1980	J	`jnl`	Matroids and Sperner's Lemma. Eur. J. Comb. László Lovász
1980	J	`jnl`	On a product dimension of graphs. J. Comb. Theory B László Lovász, Jaroslav Nesetril, Ales Pultr
1979	B	`conf`	On determinants, matchings, and random algorithms. FCT László Lovász
1979	J	`jnl`	On the Shannon capacity of a graph. IEEE Trans. Inf. Theory László Lovász
1979	A*	`conf`	Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems FOCS Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
1978	J	`jnl`	Kneser's Conjecture, Chromatic Number, and Homotopy. J. Comb. Theory A László Lovász
1977	J	`jnl`	On minimal elementary bipartite graphs. J. Comb. Theory B László Lovász, Michael D. Plummer
1977	J	`jnl`	Some Remarks on Generalized Spectra. Math. Log. Q. László Lovász, Péter Gács
1976	J	`jnl`	On two minimax theorems in graph. J. Comb. Theory B László Lovász
1975	J	`jnl`	On the ratio of optimal integral and fractional covers. Discret. Math. László Lovász
1972	J	`jnl`	Normal hypergraphs and the perfect graph conjecture. Discret. Math. László Lovász