default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLászló Lovász 0001
Person information
- affiliation: Eötvös Loránd University, Budapest, Hungary
- award (2021): Abel Prize
- award (2010): Kyoto Prize
- award (2008): Széchenyi Prize
- award (2006): John von Neumann Theory Prize
- award (2001): Gödel Prize
- award (1999): Knuth Prize
- award (1982): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j105]Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy:
Random homomorphisms into the orthogonality graph. J. Comb. Theory B 167: 392-444 (2024)- [j104]László Lovász:
The matroid of a graphing. J. Comb. Theory B 169: 542-560 (2024) - 2023
- [j103]Endre Csóka
, Tamás Hubai, László Lovász:
Locally common graphs. J. Graph Theory 102(3): 472-483 (2023) - 2021
- [j102]László Lovász:
Discrete Quantitative Nodal Theorem. Electron. J. Comb. 28(3) (2021)
2010 – 2019
- 2019
- [j101]Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy:
Measures on the square as sparse graph limits. J. Comb. Theory B 138: 1-40 (2019) - 2016
- [j100]László Lovász, Jaroslav Nesetril, Alexander Schrijver:
Preface. Eur. J. Comb. 52: 245-247 (2016) - [j99]Omar Antolín Camarena, Endre Csóka, Tamás Hubai, Gábor Lippner, László Lovász:
Positive graphs. Eur. J. Comb. 52: 290-301 (2016) - [j98]Tamás Hubai, Dávid Kunszenti-Kovács, László Lovász:
Positive graphs. Electron. Notes Discret. Math. 54: 355-360 (2016) - 2013
- [j97]László Lovász, Katalin Vesztergombi:
Non-Deterministic Graph Property Testing. Comb. Probab. Comput. 22(5): 749-762 (2013) - [j96]László Lovász, Attila Sali, Vera T. Sós:
Preface. Electron. Notes Discret. Math. 43: 1-3 (2013) - [j95]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): 1-28 (2013) - 2012
- [b4]László Lovász:
Large Networks and Graph Limits. Colloquium Publications 60, American Mathematical Society 2012, ISBN 978-0-8218-9085-1, pp. I-XIV, 1-475 - [j94]László Lovász, István Deák:
Computational results of an O∗(n4) volume algorithm. Eur. J. Oper. Res. 216(1): 152-161 (2012) - [j93]László Lovász, Balázs Szegedy:
Random graphons and a weak Positivstellensatz for graphs. J. Graph Theory 70(2): 214-225 (2012) - [j92]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): 250-271 (2012) - [i3]László Lovász, Katalin Vesztergombi:
Nondeterministic graph property testing. CoRR abs/1202.5337 (2012) - 2011
- [j91]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) - [j90]László Lovász:
Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko Conjecture. Electron. J. Comb. 18(1) (2011) - [j89]László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver:
Preface. Eur. J. Comb. 32(7): 951-953 (2011) - [j88]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): 985-999 (2011) - [j87]László Lovász, Balázs Szegedy:
Finitely forcible graphons. J. Comb. Theory B 101(5): 269-301 (2011) - 2010
- [j86]Andrew Beveridge, László Lovász:
Exit Frequency Matrices for Finite Markov Chains. Comb. Probab. Comput. 19(4): 541-560 (2010) - [j85]László Lovász, Alexander Schrijver:
Dual graph homomorphism functions. J. Comb. Theory A 117(2): 216-222 (2010) - [p1]Ionica Smeets, Arjen K. Lenstra, Hendrik Lenstra, László Lovász, Peter van Emde Boas:
The History of the LLL-Algorithm. The LLL Algorithm 2010: 1-17
2000 – 2009
- 2009
- [j84]László Lovász, Alexander Schrijver:
Semidefinite Functions on Categories. Electron. J. Comb. 16(2) (2009) - [j83]László Lovász, Balázs Szegedy:
Contractors and connectors of graph algebras. J. Graph Theory 60(1): 11-30 (2009) - [e2]William J. Cook, László Lovász, Jens Vygen:
Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany. Springer 2009, ISBN 978-3-540-76795-4 [contents] - [i2]Magnus Bordewich, Michael H. Freedman, László Lovász, D. Welsh:
Approximate Counting and Quantum Computation. CoRR abs/0908.2122 (2009) - 2008
- [j82]László Lovász, Alexander Schrijver:
Graph parameters and semigroup functions. Eur. J. Comb. 29(4): 987-1002 (2008) - [j81]László Lovász, Vera T. Sós:
Generalized quasirandom graphs. J. Comb. Theory B 98(1): 146-163 (2008) - [c43]László Lovász:
Some Mathematics behind Graph Property Testing. ALT 2008: 3 - [c42]László Lovász:
Some Mathematics Behind Graph Property Testing. Discovery Science 2008: 15 - 2007
- [j80]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): 301-311 (2007) - [j79]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): 16 (2007) - [j78]László Lovász, Santosh S. Vempala:
The geometry of logconcave functions and sampling algorithms. Random Struct. Algorithms 30(3): 307-358 (2007) - [c41]László Lovász:
Approximating Graphs by Graphs and Functions (Abstract). FCT 2007: 38 - 2006
- [j77]Ravi Kannan, László Lovász, Ravi Montenegro:
Blocking Conductance and Mixing in Random Walks. Comb. Probab. Comput. 15(4): 541-570 (2006) - [j76]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): 673-683 (2006) - [j75]László Lovász:
Normal hypergraphs and the perfect graph conjecture. Discret. Math. 306(10-11): 867-875 (2006) - [j74]László Lovász:
The rank of connection matrices and the dimension of graph algebras. Eur. J. Comb. 27(6): 962-970 (2006) - [j73]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): 53-78 (2006) - [j72]László Lovász, Santosh S. Vempala:
Simulated annealing in convex bodies and an O*(n4) volume algorithm. J. Comput. Syst. Sci. 72(2): 392-417 (2006) - [j71]László Lovász, Balázs Szegedy:
Limits of dense graph sequences. J. Comb. Theory B 96(6): 933-957 (2006) - [j70]László Lovász, Michael E. Saks:
A localization inequality for set functions. J. Comb. Theory A 113(4): 726-735 (2006) - [j69]László Lovász, Santosh S. Vempala:
Hit-and-Run from a Corner. SIAM J. Comput. 35(4): 985-1005 (2006) - [j68]Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis:
Proving Integrality Gaps without Knowing the Linear Program. Theory Comput. 2(2): 19-51 (2006) - [c40]László Lovász, Santosh S. Vempala:
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. FOCS 2006: 57-68 - [c39]Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala:
Local versus global properties of metric spaces. SODA 2006: 41-50 - [c38]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: 261-270 - 2005
- [j67]László Lovász:
Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. Oper. Res. Lett. 33(4): 437-440 (2005) - [c37]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: 51-59 - 2004
- [j66]Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min Sum Set Cover. Algorithmica 40(4): 219-234 (2004) - [c36]László Lovász, Santosh S. Vempala:
Hit-and-run from a corner. STOC 2004: 310-314 - [c35]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: 529-538 - 2003
- [c34]László Lovász, Santosh S. Vempala:
Logconcave Functions: Geometry and Efficient Sampling Algorithms. FOCS 2003: 640-649 - [c33]László Lovász, Santosh S. Vempala:
Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. FOCS 2003: 650-659 - [c32]Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir:
Semi-matchings for Bipartite Graphs and Load Balancing. WADS 2003: 294-308 - 2002
- [c31]Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min-sum Set Cover. APPROX 2002: 94-107 - [c30]Sanjeev Arora, Béla Bollobás, László Lovász:
Proving Integrality Gaps without Knowing the Linear Program. FOCS 2002: 313-322 - [c29]Itai Benjamini, László Lovász:
Global Information from Local Observation. FOCS 2002: 701-710 - [i1]László Lovász, Neal E. Young:
Lecture Notes on Evasiveness of Graph Properties. CoRR cs.CC/0205031 (2002) - 2001
- [j65]László Lipták, László Lovász:
Critical Facets of the Stable Set Polytope. Comb. 21(1): 61-88 (2001) - [j64]László Lovász:
Steinitz Representations of Polyhedra and the Colin de Verdière Number. J. Comb. Theory B 82(2): 223-236 (2001) - [j63]László Lovász:
Energy of Convex Sets, Shortest Paths, and Resistance. J. Comb. Theory A 94(2): 363-382 (2001) - [j62]Noga Alon, László Lovász:
Unextendible Product Bases. J. Comb. Theory A 95(1): 169-179 (2001) - 2000
- [j61]László Lipták, László Lovász:
Facets with fixed defect of the stable set polytope. Math. Program. 88(1): 33-44 (2000) - [c28]Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu:
The Cover Time, the Blanket Time, and the Matthews Bound. FOCS 2000: 467-475
1990 – 1999
- 1999
- [j60]László Lovász:
Hit-and-run mixes fast. Math. Program. 86(3): 443-461 (1999) - [c27]Fang Chen, László Lovász, Igor Pak:
Lifting Markov Chains to Speed up Mixing. STOC 1999: 275-281 - [c26]László Lovász, Ravi Kannan:
Faster Mixing via Average Conductance. STOC 1999: 282-287 - 1998
- [j59]László Lovász, Peter Winkler:
Reversal of Markov Chains and the Forget Time. Comb. Probab. Comput. 7(2): 189-204 (1998) - [j58]Andrew Beveridge, László Lovász:
Random walks and the regeneration time. J. Graph Theory 29(2): 57-62 (1998) - [c25]Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits:
Approximation of Diameters: Randomization Doesn't Help. FOCS 1998: 244-251 - 1997
- [j57]Andrew Kotlov, László Lovász, Santosh S. Vempala:
The Colin de Verdière Number and Sphere Representations of a Graph. Comb. 17(4): 483-521 (1997) - [j56]László Lovász, János Pach, Mario Szegedy:
On Conway's Thrackle Conjecture. Discret. Comput. Geom. 18(4): 369-376 (1997) - [j55]László Lovász:
The Membership Problem in Jump Systems. J. Comb. Theory B 70(1): 45-66 (1997) - [j54]Ravi Kannan, László Lovász, Miklós Simonovits:
Random walks and an O*(n5) volume algorithm for convex bodies. Random Struct. Algorithms 11(1): 1-50 (1997) - [c24]László Lovász, Peter Winkler:
Mixing times. Microsurveys in Discrete Probability 1997: 85-133 - 1996
- [j53]Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy:
Interactive Proofs and the Hardness of Approximating Cliques. J. ACM 43(2): 268-292 (1996) - [j52]Andrew Kotlov, László Lovász:
The rank and size of graphs. J. Graph Theory 23(2): 185-189 (1996) - 1995
- [j51]László Lovász, Peter Winkler:
Exact Mixing in an Unknown Markov Chain. Electron. J. Comb. 2 (1995) - [j50]Ravi Kannan, László Lovász, Miklós Simonovits:
Isoperimetric Problems for Convex Bodies and a Localization Lemama. Discret. Comput. Geom. 13: 541-559 (1995) - [j49]László Lovász, Moni Naor, Ilan Newman, Avi Wigderson:
Search Problems in the Decision Tree Model. SIAM J. Discret. Math. 8(1): 119-132 (1995) - [c23]László Lovász, János Pach, Mario Szegedy:
On Conway's Thrackle Conjecture. SCG 1995: 147-151 - [c22]László Lovász, Peter Winkler:
Efficient stopping rules for Markov chains. STOC 1995: 76-82 - [e1]William J. Cook, László Lovász, Paul D. Seymour:
Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20, DIMACS/AMS 1995, ISBN 978-0-8218-0239-7 [contents] - 1994
- [j48]László Lovász:
Stable sets and polynomials. Discret. Math. 124(1-3): 137-153 (1994) - 1993
- [b3]László Lovász:
Combinatorial problems and exercises (2. ed.). North-Holland 1993, ISBN 978-0-444-81504-0, pp. 1-635 - [j47]J. Csima, László Lovász:
Dating to Marriage. Discret. Appl. Math. 41(3): 269-270 (1993) - [j46]László Lovász, Ákos Seress:
The Cocycle Lattice of Binary Matroids . Eur. J. Comb. 14(3): 241-250 (1993) - [j45]László Lovász, Michael E. Saks:
Communication Complexity and Combinatorial Lattice Theory. J. Comput. Syst. Sci. 47(2): 322-349 (1993) - [j44]László Lovász, Peter Winkler:
A note on the last new vertex visited by a random walk. J. Graph Theory 17(5): 593-596 (1993) - [j43]László Lovász, Miklós Simonovits:
Random Walks in a Convex Body and an Improved Volume Algorithm. Random Struct. Algorithms 4(4): 359-412 (1993) - [j42]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): 284-293 (1993) - [c21]László Lovász:
Randomized algorithms in combinatorial optimization. Combinatorial Optimization 1993: 153-179 - 1992
- [j41]Imre Bárány, Roger Howe, László Lovász:
On integer points in polyhedra: a lower bound. Comb. 12(2): 135-142 (1992) - [j40]J. Csima, László Lovász:
A matching algorithm for regular bipartite graphs. Discret. Appl. Math. 35(3): 197-203 (1992) - [j39]László Lovász, Herbert E. Scarf:
The Generalized Basis Reduction Algorithm. Math. Oper. Res. 17(3): 751-764 (1992) - [c20]László Lovász, Miklós Simonovits:
On the Randomized Complexity of Volume and Diameter. FOCS 1992: 482-491 - [c19]Anders Björner, László Lovász, Andrew Chi-Chih Yao:
Linear Decision Trees: Volume Estimates and Topological Bounds. STOC 1992: 170-177 - [c18]Uriel Feige, László Lovász:
Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract). STOC 1992: 733-744 - 1991
- [j38]László Babai, Albert J. Goodman, László Lovász:
Graphs with Given Automorphism Group and Few Edge Orbits. Eur. J. Comb. 12(3): 185-203 (1991) - [j37]Anders Björner, László Lovász, Peter W. Shor:
Chip-firing Games on Graphs. Eur. J. Comb. 12(4): 283-291 (1991) - [j36]László Lovász, Alexander Schrijver:
Cones of Matrices and Set-Functions and 0-1 Optimization. SIAM J. Optim. 1(2): 166-190 (1991) - [c17]Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy:
Approximating Clique is Almost NP-Complete (Preliminary Version). FOCS 1991: 2-12 - [c16]László Lovász, Moni Naor, Ilan Newman, Avi Wigderson:
Search Problems in the Decision Tree Model (Preliminary Version). FOCS 1991: 576-585 - 1990
- [j35]Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi:
Entropy splitting for antiblocking corners and perfect graphs. Comb. 10(1): 27-40 (1990) - [j34]Imre Bárány, Zoltán Füredi, László Lovász:
On the number of halving planes. Comb. 10(2): 175-183 (1990) - [j33]Ravi Kannan, László Lovász, Herbert E. Scarf:
The Shapes of Polyhedra. Math. Oper. Res. 15(2): 364-380 (1990) - [c15]László Lovász, Alexander Schrijver:
Matrix Cones, Projection Representations, and Stable Set Polyhedra. Polyhedral Combinatorics 1990: 1-18 - [c14]László Lovász, Miklós Simonovits:
The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume. FOCS 1990: 346-354
1980 – 1989
- 1989
- [j32]Paul Erdös, László Lovász, Katalin Vesztergombi:
On the Graph of Large Distance. Discret. Comput. Geom. 4: 541-549 (1989) - [j31]Bernhard Korte, László Lovász:
The intersection of matroids and antimatroids. Discret. Math. 73(1-2): 143-157 (1989) - [j30]László Lovász, Michael E. Saks, William T. Trotter:
An on-line graph coloring algorithm with sublinear performance ratio. Discret. Math. 75(1-3): 319-325 (1989) - [c13]Imre Bárány, Zoltán Füredi, László Lovász:
On the Number of Halving Planes. SCG 1989: 140-144 - [c12]László Lovász:
Faster Algorithms for Hard Problems. IFIP Congress 1989: 135-141 - 1988
- [b2]Martin Grötschel, László Lovász, Alexander Schrijver:
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2, Springer 1988, ISBN 978-3-642-97883-8 - [j29]Nathan Linial, László Lovász, Avi Wigderson:
Rubber bands, convex embeddings and graph connectivity. Comb. 8(1): 91-102 (1988) - [c11]László Lovász, Michael E. Saks:
Lattices, Möbius Functions and Communication Complexity. FOCS 1988: 81-90 - 1987
- [j28]Andreas W. M. Dress, László Lovász:
On some combinatorial properties of algebraic matroids. Comb. 7(1): 39-48 (1987) - [j27]László Lovász:
Matching structure and the matching lattice. J. Comb. Theory B 43(2): 187-222 (1987) - 1986
- [b1]László Lovász:
Algorithmic theory of numbers, graphs and convexity. CBMS-NSF regional conference series in applied mathematics 50, SIAM 1986, ISBN 978-0-89871-203-2, pp. 1-91 - [j26]Bernhard Korte, László Lovász:
Homomorphisms and Ramsey properties of antimatroids. Discret. Appl. Math. 15(2-3): 283-290 (1986) - [j25]Bernhard Korte, László Lovász:
Non-interval greedoids and the transposition property. Discret. Math. 59(3): 297-314 (1986) - [j24]László Lovász, Joel Spencer, Katalin Vesztergombi:
Discrepancy of Set-systems and Matrices. Eur. J. Comb. 7(2): 151-160 (1986) - [j23]Martin Grötschel, László Lovász, Alexander Schrijver:
Relaxations of vertex packing. J. Comb. Theory B 40(3): 330-343 (1986) - [j22]Ulrich Faigle, László Lovász, Rainer Schrader, György Turán:
Searching in Trees, Series-Parallel and Interval Orders. SIAM J. Comput. 15(4): 1075-1084 (1986) - [c10]Nathan Linial, László Lovász, Avi Wigderson:
A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications. FOCS 1986: 39-48 - [c9]Ravi Kannan, László Lovász:
Covering Minima and Lattice Point Free Convex Bodies. FSTTCS 1986: 193-213 - [c8]László Lovász:
Connectivity Algorithms Using Rubber-bands. FSTTCS 1986: 394-411 - 1985
- [j21]Bernhard Korte, László Lovász:
A Note on Selectors and Greedoids. Eur. J. Comb. 6(1): 59-67 (1985) - [j20]Bernhard Korte, László Lovász:
Polymatroid greedoids. J. Comb. Theory B 38(1): 41-72 (1985) - [j19]J. Adrian Bondy, László Lovász:
Lengths of cycles in halin graphs. J. Graph Theory 9(3): 397-410 (1985) - [j18]Bernhard Korte, László Lovász:
Relations between subclasses of greedoids. Z. Oper. Research 29(7): 249-267 (1985) - [c7]László Lovász:
Computing ears and branchings in parallel. FOCS 1985: 464-467 - [c6]László Lovász:
Vertex Packing Algorithms. ICALP 1985: 1-14 - 1984
- [j17]Martin Grötschel, László Lovász, Alexander Schrijver:
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". Comb. 4(4): 291-295 (1984) - [c5]Ravindran Kannan, Arjen K. Lenstra, László Lovász:
Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers. STOC 1984: 191-200 - 1983
- [j16]László Lovász:
Ear-decompositions of matching covered graphs. Comb. 3(1): 105-117 (1983) - [j15]Bernhard Korte, László Lovász:
Structural properties of greedoids. Comb. 3(3): 359-374 (1983) - 1982
- [j14]László Lovász:
Tibor Gallai. Comb. 2(3): 203-205 (1982) - [j13]Jack Edmonds, László Lovász, William R. Pulleyblank:
Brick decompositions and the matching rank of graphs. Comb. 2(3): 247-274 (1982) - [c4]László Lovász:
Submodular functions and convexity. ISMP 1982: 235-257 - 1981
- [j12]J. Adrian Bondy, László Lovász:
Cycles through specified vertices of a graph. Comb. 1(2): 117-140 (1981) - [j11]Martin Grötschel, László Lovász, Alexander Schrijver:
The ellipsoid method and its consequences in combinatorial optimization. Comb. 1(2): 169-197 (1981) - [c3]Bernhard Korte, László Lovász:
Mathematical Structures Underlying Greedy Algorithms. FCT 1981: 205-209 - 1980
- [j10]László Lovász:
Matroids and Sperner's Lemma. Eur. J. Comb. 1(1): 65-66 (1980) - [j9]László Lovász:
Matroid matching and some applications. J. Comb. Theory B 28(2): 208-236 (1980) - [j8]László Lovász, Jaroslav Nesetril, Ales Pultr:
On a product dimension of graphs. J. Comb. Theory B 29(1): 47-67 (1980)
1970 – 1979
- 1979
- [j7]László Lovász:
On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25(1): 1-7 (1979) - [c2]László Lovász:
On determinants, matchings, and random algorithms. FCT 1979: 565-574 - [c1]Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff:
Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. FOCS 1979: 218-223 - 1978
- [j6]László Lovász:
Kneser's Conjecture, Chromatic Number, and Homotopy. J. Comb. Theory A 25(3): 319-324 (1978) - 1977
- [j5]László Lovász, Michael D. Plummer:
On minimal elementary bipartite graphs. J. Comb. Theory B 23(1): 127-138 (1977) - [j4]László Lovász, Péter Gács:
Some Remarks on Generalized Spectra. Math. Log. Q. 23(36): 547-554 (1977) - 1976
- [j3]László Lovász:
On two minimax theorems in graph. J. Comb. Theory B 21(2): 96-103 (1976) - 1975
- [j2]László Lovász:
On the ratio of optimal integral and fractional covers. Discret. Math. 13(4): 383-390 (1975) - 1972
- [j1]László Lovász:
Normal hypergraphs and the perfect graph conjecture. Discret. Math. 2(3): 253-267 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
