Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: László Lovász 0001
@article{DBLP:journals/jgt/CsokaHL23,
author = {Endre Cs{\'{o}}ka and
Tam{\'{a}}s Hubai and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Locally common graphs},
journal = {J. Graph Theory},
volume = {102},
number = {3},
pages = {472--483},
year = {2023},
url = {https://doi.org/10.1002/jgt.22881},
doi = {10.1002/JGT.22881},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/CsokaHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Lovasz21,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Discrete Quantitative Nodal Theorem},
journal = {Electron. J. Comb.},
volume = {28},
number = {3},
year = {2021},
url = {https://doi.org/10.37236/9944},
doi = {10.37236/9944},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/Lovasz21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kunszenti-Kovacs19,
author = {D{\'{a}}vid Kunszenti{-}Kov{\'{a}}cs and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Bal{\'{a}}zs Szegedy},
title = {Measures on the square as sparse graph limits},
journal = {J. Comb. Theory, Ser. {B}},
volume = {138},
pages = {1--40},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2019.01.004},
doi = {10.1016/J.JCTB.2019.01.004},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kunszenti-Kovacs19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LovaszNS16,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Jaroslav Nesetril and
Alexander Schrijver},
title = {Preface},
journal = {Eur. J. Comb.},
volume = {52},
pages = {245--247},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2015.07.008},
doi = {10.1016/J.EJC.2015.07.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/LovaszNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CamarenaCHLL16,
author = {Omar Antol{\'{\i}}n Camarena and
Endre Cs{\'{o}}ka and
Tam{\'{a}}s Hubai and
G{\'{a}}bor Lippner and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Positive graphs},
journal = {Eur. J. Comb.},
volume = {52},
pages = {290--301},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2015.07.007},
doi = {10.1016/J.EJC.2015.07.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/CamarenaCHLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HubaiKL16,
author = {Tam{\'{a}}s Hubai and
D{\'{a}}vid Kunszenti{-}Kov{\'{a}}cs and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Positive graphs},
journal = {Electron. Notes Discret. Math.},
volume = {54},
pages = {355--360},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.09.061},
doi = {10.1016/J.ENDM.2016.09.061},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HubaiKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/LovaszV13,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Katalin Vesztergombi},
title = {Non-Deterministic Graph Property Testing},
journal = {Comb. Probab. Comput.},
volume = {22},
number = {5},
pages = {749--762},
year = {2013},
url = {https://doi.org/10.1017/S0963548313000205},
doi = {10.1017/S0963548313000205},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/LovaszV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LovaszSS13,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Attila Sali and
Vera T. S{\'{o}}s},
title = {Preface},
journal = {Electron. Notes Discret. Math.},
volume = {43},
pages = {1--3},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.07.001},
doi = {10.1016/J.ENDM.2013.07.001},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LovaszSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BorgsCKL13,
author = {Christian Borgs and
Jennifer T. Chayes and
Jeff Kahn and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Left and right convergence of graphs with bounded degree},
journal = {Random Struct. Algorithms},
volume = {42},
number = {1},
pages = {1--28},
year = {2013},
url = {https://doi.org/10.1002/rsa.20414},
doi = {10.1002/RSA.20414},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BorgsCKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0031021,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Large Networks and Graph Limits},
series = {Colloquium Publications},
volume = {60},
publisher = {American Mathematical Society},
year = {2012},
url = {http://www.ams.org/bookstore-getitem/item=COLL-60},
isbn = {978-0-8218-9085-1},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0031021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LovaszD12,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Istv{\'{a}}n De{\'{a}}k},
title = {Computational results of an O\({}^{\mbox{{\({_\ast}\)}}}\)(n\({}^{\mbox{4}}\))
volume algorithm},
journal = {Eur. J. Oper. Res.},
volume = {216},
number = {1},
pages = {152--161},
year = {2012},
url = {https://doi.org/10.1016/j.ejor.2011.06.024},
doi = {10.1016/J.EJOR.2011.06.024},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LovaszD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LovaszS12,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Bal{\'{a}}zs Szegedy},
title = {Random graphons and a weak Positivstellensatz for graphs},
journal = {J. Graph Theory},
volume = {70},
number = {2},
pages = {214--225},
year = {2012},
url = {https://doi.org/10.1002/jgt.20611},
doi = {10.1002/JGT.20611},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LovaszS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AroraLNRRV12,
author = {Sanjeev Arora and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Ilan Newman and
Yuval Rabani and
Yuri Rabinovich and
Santosh S. Vempala},
title = {Local Versus Global Properties of Metric Spaces},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {1},
pages = {250--271},
year = {2012},
url = {https://doi.org/10.1137/090780304},
doi = {10.1137/090780304},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AroraLNRRV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-5337,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Katalin Vesztergombi},
title = {Nondeterministic graph property testing},
journal = {CoRR},
volume = {abs/1202.5337},
year = {2012},
url = {http://arxiv.org/abs/1202.5337},
eprinttype = {arXiv},
eprint = {1202.5337},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-5337.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KangLMS11,
author = {Ross J. Kang and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Tobias M{\"{u}}ller and
Edward R. Scheinerman},
title = {Dot Product Representations of Planar Graphs},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/703},
doi = {10.37236/703},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/KangLMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Lovasz11,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko
Conjecture},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/614},
doi = {10.37236/614},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Lovasz11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LovaszNMS11,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Jaroslav Nesetril and
Patrice Ossona de Mendez and
Alexander Schrijver},
title = {Preface},
journal = {Eur. J. Comb.},
volume = {32},
number = {7},
pages = {951--953},
year = {2011},
url = {https://doi.org/10.1016/j.ejc.2011.03.018},
doi = {10.1016/J.EJC.2011.03.018},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/LovaszNMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BorgsCLSV11,
author = {Christian Borgs and
Jennifer T. Chayes and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Vera T. S{\'{o}}s and
Katalin Vesztergombi},
title = {Limits of randomly grown graph sequences},
journal = {Eur. J. Comb.},
volume = {32},
number = {7},
pages = {985--999},
year = {2011},
url = {https://doi.org/10.1016/j.ejc.2011.03.015},
doi = {10.1016/J.EJC.2011.03.015},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BorgsCLSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LovaszS11,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Bal{\'{a}}zs Szegedy},
title = {Finitely forcible graphons},
journal = {J. Comb. Theory, Ser. {B}},
volume = {101},
number = {5},
pages = {269--301},
year = {2011},
url = {https://doi.org/10.1016/j.jctb.2011.03.005},
doi = {10.1016/J.JCTB.2011.03.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LovaszS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BeveridgeL10,
author = {Andrew Beveridge and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Exit Frequency Matrices for Finite Markov Chains},
journal = {Comb. Probab. Comput.},
volume = {19},
number = {4},
pages = {541--560},
year = {2010},
url = {https://doi.org/10.1017/S0963548310000118},
doi = {10.1017/S0963548310000118},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BeveridgeL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LovaszS10,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Alexander Schrijver},
title = {Dual graph homomorphism functions},
journal = {J. Comb. Theory, Ser. {A}},
volume = {117},
number = {2},
pages = {216--222},
year = {2010},
url = {https://doi.org/10.1016/j.jcta.2009.04.006},
doi = {10.1016/J.JCTA.2009.04.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LovaszS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/isc/SmeetsLLLB10,
author = {Ionica Smeets and
Arjen K. Lenstra and
Hendrik Lenstra and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Peter van Emde Boas},
editor = {Phong Q. Nguyen and
Brigitte Vall{\'{e}}e},
title = {The History of the LLL-Algorithm},
booktitle = {The {LLL} Algorithm - Survey and Applications},
series = {Information Security and Cryptography},
pages = {1--17},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-02295-1\_1},
doi = {10.1007/978-3-642-02295-1\_1},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/isc/SmeetsLLLB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LovaszS09,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Alexander Schrijver},
title = {Semidefinite Functions on Categories},
journal = {Electron. J. Comb.},
volume = {16},
number = {2},
year = {2009},
url = {https://doi.org/10.37236/80},
doi = {10.37236/80},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LovaszS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LovaszS09,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Bal{\'{a}}zs Szegedy},
title = {Contractors and connectors of graph algebras},
journal = {J. Graph Theory},
volume = {60},
number = {1},
pages = {11--30},
year = {2009},
url = {https://doi.org/10.1002/jgt.20343},
doi = {10.1002/JGT.20343},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LovaszS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/bonnco/2008,
editor = {William J. Cook and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Jens Vygen},
title = {Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial
Optimization, November 3-7, 2008, Bonn, Germany},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-540-76796-1},
doi = {10.1007/978-3-540-76796-1},
isbn = {978-3-540-76795-4},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bonnco/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-2122,
author = {Magnus Bordewich and
Michael H. Freedman and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
D. Welsh},
title = {Approximate Counting and Quantum Computation},
journal = {CoRR},
volume = {abs/0908.2122},
year = {2009},
url = {http://arxiv.org/abs/0908.2122},
eprinttype = {arXiv},
eprint = {0908.2122},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0908-2122.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LovaszS08,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Alexander Schrijver},
title = {Graph parameters and semigroup functions},
journal = {Eur. J. Comb.},
volume = {29},
number = {4},
pages = {987--1002},
year = {2008},
url = {https://doi.org/10.1016/j.ejc.2007.11.008},
doi = {10.1016/J.EJC.2007.11.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/LovaszS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LovaszS08,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Vera T. S{\'{o}}s},
title = {Generalized quasirandom graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {98},
number = {1},
pages = {146--163},
year = {2008},
url = {https://doi.org/10.1016/j.jctb.2007.06.005},
doi = {10.1016/J.JCTB.2007.06.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LovaszS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/Lovasz08,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Yoav Freund and
L{\'{a}}szl{\'{o}} Gy{\"{o}}rfi and
Gy{\"{o}}rgy Tur{\'{a}}n and
Thomas Zeugmann},
title = {Some Mathematics behind Graph Property Testing},
booktitle = {Algorithmic Learning Theory, 19th International Conference, {ALT}
2008, Budapest, Hungary, October 13-16, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5254},
pages = {3},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87987-9\_3},
doi = {10.1007/978-3-540-87987-9\_3},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/Lovasz08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dis/Lovasz08,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Jean{-}Fran{\c{c}}ois Boulicaut and
Michael R. Berthold and
Tam{\'{a}}s Horv{\'{a}}th},
title = {Some Mathematics Behind Graph Property Testing},
booktitle = {Discovery Science, 11th International Conference, {DS} 2008, Budapest,
Hungary, October 13-16, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5255},
pages = {15},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-88411-8\_3},
doi = {10.1007/978-3-540-88411-8\_3},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dis/Lovasz08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/JainLC07,
author = {Kamal Jain and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Philip A. Chou},
title = {Building scalable and robust peer-to-peer overlay networks for broadcasting
using network coding},
journal = {Distributed Comput.},
volume = {19},
number = {4},
pages = {301--311},
year = {2007},
url = {https://doi.org/10.1007/s00446-006-0014-9},
doi = {10.1007/S00446-006-0014-9},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/JainLC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenKLRSV07,
author = {Jiangzhuo Chen and
Robert D. Kleinberg and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Rajmohan Rajaraman and
Ravi Sundaram and
Adrian Vetta},
title = {(Almost) Tight bounds and existence theorems for single-commodity
confluent flows},
journal = {J. {ACM}},
volume = {54},
number = {4},
pages = {16},
year = {2007},
url = {https://doi.org/10.1145/1255443.1255444},
doi = {10.1145/1255443.1255444},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChenKLRSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LovaszV07,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Santosh S. Vempala},
title = {The geometry of logconcave functions and sampling algorithms},
journal = {Random Struct. Algorithms},
volume = {30},
number = {3},
pages = {307--358},
year = {2007},
url = {https://doi.org/10.1002/rsa.20135},
doi = {10.1002/RSA.20135},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LovaszV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Lovasz07,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Zolt{\'{a}}n {\'{E}}sik},
title = {Approximating Graphs by Graphs and Functions (Abstract)},
booktitle = {Fundamentals of Computation Theory, 16th International Symposium,
{FCT} 2007, Budapest, Hungary, August 27-30, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4639},
pages = {38},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74240-1\_3},
doi = {10.1007/978-3-540-74240-1\_3},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/Lovasz07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KannanLM06,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Ravi Montenegro},
title = {Blocking Conductance and Mixing in Random Walks},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {4},
pages = {541--570},
year = {2006},
url = {https://doi.org/10.1017/S0963548306007504},
doi = {10.1017/S0963548306007504},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KannanLM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BenjaminiKLRT06,
author = {Itai Benjamini and
Gady Kozma and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Dan Romik and
G{\'{a}}bor Tardos},
title = {Waiting for a Bat to Fly By (in Polynomial Time)},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {5},
pages = {673--683},
year = {2006},
url = {https://doi.org/10.1017/S0963548306007590},
doi = {10.1017/S0963548306007590},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BenjaminiKLRT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lovasz06,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Normal hypergraphs and the perfect graph conjecture},
journal = {Discret. Math.},
volume = {306},
number = {10-11},
pages = {867--875},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2006.03.007},
doi = {10.1016/J.DISC.2006.03.007},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Lovasz06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Lovasz06,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {The rank of connection matrices and the dimension of graph algebras},
journal = {Eur. J. Comb.},
volume = {27},
number = {6},
pages = {962--970},
year = {2006},
url = {https://doi.org/10.1016/j.ejc.2005.04.012},
doi = {10.1016/J.EJC.2005.04.012},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Lovasz06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HarveyLLT06,
author = {Nicholas J. A. Harvey and
Richard E. Ladner and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Tami Tamir},
title = {Semi-matchings for bipartite graphs and load balancing},
journal = {J. Algorithms},
volume = {59},
number = {1},
pages = {53--78},
year = {2006},
url = {https://doi.org/10.1016/j.jalgor.2005.01.003},
doi = {10.1016/J.JALGOR.2005.01.003},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/HarveyLLT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LovaszV06,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Santosh S. Vempala},
title = {Simulated annealing in convex bodies and an \emph{O}\({}^{\mbox{*}}\)(\emph{n}\({}^{\mbox{4}}\))
volume algorithm},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {2},
pages = {392--417},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2005.08.004},
doi = {10.1016/J.JCSS.2005.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LovaszV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LovaszS06a,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Bal{\'{a}}zs Szegedy},
title = {Limits of dense graph sequences},
journal = {J. Comb. Theory, Ser. {B}},
volume = {96},
number = {6},
pages = {933--957},
year = {2006},
url = {https://doi.org/10.1016/j.jctb.2006.05.002},
doi = {10.1016/J.JCTB.2006.05.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LovaszS06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LovaszS06,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Michael E. Saks},
title = {A localization inequality for set functions},
journal = {J. Comb. Theory, Ser. {A}},
volume = {113},
number = {4},
pages = {726--735},
year = {2006},
url = {https://doi.org/10.1016/j.jcta.2005.03.011},
doi = {10.1016/J.JCTA.2005.03.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LovaszS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LovaszV06,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Santosh S. Vempala},
title = {Hit-and-Run from a Corner},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {4},
pages = {985--1005},
year = {2006},
url = {https://doi.org/10.1137/S009753970544727X},
doi = {10.1137/S009753970544727X},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LovaszV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AroraBLT06,
author = {Sanjeev Arora and
B{\'{e}}la Bollob{\'{a}}s and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Iannis Tourlakis},
title = {Proving Integrality Gaps without Knowing the Linear Program},
journal = {Theory Comput.},
volume = {2},
number = {2},
pages = {19--51},
year = {2006},
url = {https://doi.org/10.4086/toc.2006.v002a002},
doi = {10.4086/TOC.2006.V002A002},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/AroraBLT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LovaszV06,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Santosh S. Vempala},
title = {Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration
and Optimization},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {57--68},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.28},
doi = {10.1109/FOCS.2006.28},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LovaszV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AroraLNRRV06,
author = {Sanjeev Arora and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Ilan Newman and
Yuval Rabani and
Yuri Rabinovich and
Santosh S. Vempala},
title = {Local versus global properties of metric spaces},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {41--50},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109563},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AroraLNRRV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BorgsCLSSV06,
author = {Christian Borgs and
Jennifer T. Chayes and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Vera T. S{\'{o}}s and
Bal{\'{a}}zs Szegedy and
Katalin Vesztergombi},
editor = {Jon M. Kleinberg},
title = {Graph limits and parameter testing},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {261--270},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132556},
doi = {10.1145/1132516.1132556},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BorgsCLSSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Lovasz05,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Review of the book by Alexander Schrijver: Combinatorial Optimization:
Polyhedra and Efficiency},
journal = {Oper. Res. Lett.},
volume = {33},
number = {4},
pages = {437--440},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.10.003},
doi = {10.1016/J.ORL.2004.10.003},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Lovasz05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/JainLC05,
author = {Kamal Jain and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Philip A. Chou},
editor = {Marcos Kawazoe Aguilera and
James Aspnes},
title = {Building scalable and robust peer-to-peer overlay networks for broadcasting
using network coding},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2005, Las Vegas, NV, USA, July 17-20,
2005},
pages = {51--59},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1073814.1073824},
doi = {10.1145/1073814.1073824},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/JainLC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeLT04,
author = {Uriel Feige and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Prasad Tetali},
title = {Approximating Min Sum Set Cover},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {219--234},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1110-5},
doi = {10.1007/S00453-004-1110-5},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeigeLT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LovaszV04,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Santosh S. Vempala},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Hit-and-run from a corner},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {310--314},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007403},
doi = {10.1145/1007352.1007403},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LovaszV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenKLRSV04,
author = {Jiangzhuo Chen and
Robert D. Kleinberg and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Rajmohan Rajaraman and
Ravi Sundaram and
Adrian Vetta},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {(Almost) tight bounds and existence theorems for confluent flows},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {529--538},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007432},
doi = {10.1145/1007352.1007432},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenKLRSV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LovaszV03a,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Santosh S. Vempala},
title = {Logconcave Functions: Geometry and Efficient Sampling Algorithms},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {640--649},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238236},
doi = {10.1109/SFCS.2003.1238236},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LovaszV03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LovaszV03,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Santosh S. Vempala},
title = {Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {650--659},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238237},
doi = {10.1109/SFCS.2003.1238237},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LovaszV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/HarveyLLT03,
author = {Nicholas J. A. Harvey and
Richard E. Ladner and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Tami Tamir},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Michiel H. M. Smid},
title = {Semi-matchings for Bipartite Graphs and Load Balancing},
booktitle = {Algorithms and Data Structures, 8th International Workshop, {WADS}
2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2748},
pages = {294--308},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45078-8\_26},
doi = {10.1007/978-3-540-45078-8\_26},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/HarveyLLT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeLT02,
author = {Uriel Feige and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Prasad Tetali},
editor = {Klaus Jansen and
Stefano Leonardi and
Vijay V. Vazirani},
title = {Approximating Min-sum Set Cover},
booktitle = {Approximation Algorithms for Combinatorial Optimization, 5th International
Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2462},
pages = {94--107},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45753-4\_10},
doi = {10.1007/3-540-45753-4\_10},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/approx/FeigeLT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AroraBL02,
author = {Sanjeev Arora and
B{\'{e}}la Bollob{\'{a}}s and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Proving Integrality Gaps without Knowing the Linear Program},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {313--322},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181954},
doi = {10.1109/SFCS.2002.1181954},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AroraBL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenjaminiL02,
author = {Itai Benjamini and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Global Information from Local Observation},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {701--710},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181995},
doi = {10.1109/SFCS.2002.1181995},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BenjaminiL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0205031,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Neal E. Young},
title = {Lecture Notes on Evasiveness of Graph Properties},
journal = {CoRR},
volume = {cs.CC/0205031},
year = {2002},
url = {https://arxiv.org/abs/cs/0205031},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0205031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/LiptakL01,
author = {L{\'{a}}szl{\'{o}} Lipt{\'{a}}k and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Critical Facets of the Stable Set Polytope},
journal = {Comb.},
volume = {21},
number = {1},
pages = {61--88},
year = {2001},
url = {https://doi.org/10.1007/s004930170005},
doi = {10.1007/S004930170005},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/LiptakL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lovasz01a,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Steinitz Representations of Polyhedra and the Colin de Verdi{\`{e}}re
Number},
journal = {J. Comb. Theory, Ser. {B}},
volume = {82},
number = {2},
pages = {223--236},
year = {2001},
url = {https://doi.org/10.1006/jctb.2000.2027},
doi = {10.1006/JCTB.2000.2027},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lovasz01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lovasz01,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Energy of Convex Sets, Shortest Paths, and Resistance},
journal = {J. Comb. Theory, Ser. {A}},
volume = {94},
number = {2},
pages = {363--382},
year = {2001},
url = {https://doi.org/10.1006/jcta.2000.3153},
doi = {10.1006/JCTA.2000.3153},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lovasz01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AlonL01,
author = {Noga Alon and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Unextendible Product Bases},
journal = {J. Comb. Theory, Ser. {A}},
volume = {95},
number = {1},
pages = {169--179},
year = {2001},
url = {https://doi.org/10.1006/jcta.2000.3122},
doi = {10.1006/JCTA.2000.3122},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/AlonL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LiptakL00,
author = {L{\'{a}}szl{\'{o}} Lipt{\'{a}}k and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Facets with fixed defect of the stable set polytope},
journal = {Math. Program.},
volume = {88},
number = {1},
pages = {33--44},
year = {2000},
url = {https://doi.org/10.1007/PL00011376},
doi = {10.1007/PL00011376},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/LiptakL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KahnKLV00,
author = {Jeff Kahn and
Jeong Han Kim and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Van H. Vu},
title = {The Cover Time, the Blanket Time, and the Matthews Bound},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {467--475},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892134},
doi = {10.1109/SFCS.2000.892134},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KahnKLV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Lovasz99,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Hit-and-run mixes fast},
journal = {Math. Program.},
volume = {86},
number = {3},
pages = {443--461},
year = {1999},
url = {https://doi.org/10.1007/s101070050099},
doi = {10.1007/S101070050099},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Lovasz99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenLP99,
author = {Fang Chen and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Igor Pak},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Lifting Markov Chains to Speed up Mixing},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {275--281},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301315},
doi = {10.1145/301250.301315},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenLP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LovaszK99,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Ravi Kannan},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Faster Mixing via Average Conductance},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {282--287},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301317},
doi = {10.1145/301250.301317},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LovaszK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/LovaszW98,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Peter Winkler},
title = {Reversal of Markov Chains and the Forget Time},
journal = {Comb. Probab. Comput.},
volume = {7},
number = {2},
pages = {189--204},
year = {1998},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46595},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/LovaszW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BeveridgeL98,
author = {Andrew Beveridge and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Random walks and the regeneration time},
journal = {J. Graph Theory},
volume = {29},
number = {2},
pages = {57--62},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0118(199810)29:2\&\#60;57::AID-JGT1\&\#62;3.0.CO;2-B},
doi = {10.1002/(SICI)1097-0118(199810)29:2\&\#60;57::AID-JGT1\&\#62;3.0.CO;2-B},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BeveridgeL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BriedenGKKLS98,
author = {Andreas Brieden and
Peter Gritzmann and
Ravi Kannan and
Victor Klee and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Mikl{\'{o}}s Simonovits},
title = {Approximation of Diameters: Randomization Doesn't Help},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {244--251},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743451},
doi = {10.1109/SFCS.1998.743451},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BriedenGKKLS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KotlovLV97,
author = {Andrew Kotlov and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Santosh S. Vempala},
title = {The Colin de Verdi{\`{e}}re Number and Sphere Representations of a
Graph},
journal = {Comb.},
volume = {17},
number = {4},
pages = {483--521},
year = {1997},
url = {https://doi.org/10.1007/BF01195002},
doi = {10.1007/BF01195002},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KotlovLV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/LovaszPS97,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
J{\'{a}}nos Pach and
Mario Szegedy},
title = {On Conway's Thrackle Conjecture},
journal = {Discret. Comput. Geom.},
volume = {18},
number = {4},
pages = {369--376},
year = {1997},
url = {https://doi.org/10.1007/PL00009322},
doi = {10.1007/PL00009322},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/LovaszPS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lovasz97,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {The Membership Problem in Jump Systems},
journal = {J. Comb. Theory, Ser. {B}},
volume = {70},
number = {1},
pages = {45--66},
year = {1997},
url = {https://doi.org/10.1006/jctb.1997.1744},
doi = {10.1006/JCTB.1997.1744},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lovasz97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KannanLS97,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Mikl{\'{o}}s Simonovits},
title = {Random walks and an O\({}^{\mbox{*}}\)(n\({}^{\mbox{5}}\)) volume
algorithm for convex bodies},
journal = {Random Struct. Algorithms},
volume = {11},
number = {1},
pages = {1--50},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1098-2418(199708)11:1\&\#60;1::AID-RSA1\&\#62;3.0.CO;2-X},
doi = {10.1002/(SICI)1098-2418(199708)11:1\&\#60;1::AID-RSA1\&\#62;3.0.CO;2-X},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KannanLS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/LovaszW97,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Peter Winkler},
editor = {David J. Aldous and
James Propp},
title = {Mixing times},
booktitle = {Microsurveys in Discrete Probability, Proceedings of a {DIMACS} Workshop,
Princeton, New Jersey, USA, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {41},
pages = {85--133},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/041/06},
doi = {10.1090/DIMACS/041/06},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/LovaszW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FeigeGLSS96,
author = {Uriel Feige and
Shafi Goldwasser and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Shmuel Safra and
Mario Szegedy},
title = {Interactive Proofs and the Hardness of Approximating Cliques},
journal = {J. {ACM}},
volume = {43},
number = {2},
pages = {268--292},
year = {1996},
url = {https://doi.org/10.1145/226643.226652},
doi = {10.1145/226643.226652},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FeigeGLSS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KotlovL96,
author = {Andrew Kotlov and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {The rank and size of graphs},
journal = {J. Graph Theory},
volume = {23},
number = {2},
pages = {185--189},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199610)23:2\&\#60;185::AID-JGT9\&\#62;3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199610)23:2\&\#60;185::AID-JGT9\&\#62;3.0.CO;2-P},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KotlovL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LovaszW95,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Peter Winkler},
title = {Exact Mixing in an Unknown Markov Chain},
journal = {Electron. J. Comb.},
volume = {2},
year = {1995},
url = {https://doi.org/10.37236/1209},
doi = {10.37236/1209},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LovaszW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KannanLS95,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Mikl{\'{o}}s Simonovits},
title = {Isoperimetric Problems for Convex Bodies and a Localization Lemama},
journal = {Discret. Comput. Geom.},
volume = {13},
pages = {541--559},
year = {1995},
url = {https://doi.org/10.1007/BF02574061},
doi = {10.1007/BF02574061},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/KannanLS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LovaszNNW95,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Moni Naor and
Ilan Newman and
Avi Wigderson},
title = {Search Problems in the Decision Tree Model},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {1},
pages = {119--132},
year = {1995},
url = {https://doi.org/10.1137/S0895480192233867},
doi = {10.1137/S0895480192233867},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LovaszNNW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/LovaszPS95,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
J{\'{a}}nos Pach and
Mario Szegedy},
editor = {Jack Snoeyink},
title = {On Conway's Thrackle Conjecture},
booktitle = {Proceedings of the Eleventh Annual Symposium on Computational Geometry,
Vancouver, B.C., Canada, June 5-12, 1995},
pages = {147--151},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/220279.220295},
doi = {10.1145/220279.220295},
timestamp = {Mon, 14 Jun 2021 16:25:05 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/LovaszPS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LovaszW95,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Peter Winkler},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Efficient stopping rules for Markov chains},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {76--82},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225086},
doi = {10.1145/225058.225086},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LovaszW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs20,
editor = {William J. Cook and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Paul D. Seymour},
title = {Combinatorial Optimization, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, 1992/93},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {20},
publisher = {{DIMACS/AMS}},
year = {1995},
url = {https://doi.org/10.1090/dimacs/020},
doi = {10.1090/DIMACS/020},
isbn = {978-0-8218-0239-7},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/dimacs20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lovasz94,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Stable sets and polynomials},
journal = {Discret. Math.},
volume = {124},
number = {1-3},
pages = {137--153},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(92)00057-X},
doi = {10.1016/0012-365X(92)00057-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lovasz94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0077415,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Combinatorial problems and exercises {(2.} ed.)},
publisher = {North-Holland},
year = {1993},
isbn = {978-0-444-81504-0},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0077415.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CsimaL93,
author = {J. Csima and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Dating to Marriage},
journal = {Discret. Appl. Math.},
volume = {41},
number = {3},
pages = {269--270},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(90)90060-P},
doi = {10.1016/0166-218X(90)90060-P},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CsimaL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LovaszS93,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
{\'{A}}kos Seress},
title = {The Cocycle Lattice of Binary Matroids},
journal = {Eur. J. Comb.},
volume = {14},
number = {3},
pages = {241--250},
year = {1993},
url = {https://doi.org/10.1006/eujc.1993.1027},
doi = {10.1006/EUJC.1993.1027},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/LovaszS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LovaszS93,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Michael E. Saks},
title = {Communication Complexity and Combinatorial Lattice Theory},
journal = {J. Comput. Syst. Sci.},
volume = {47},
number = {2},
pages = {322--349},
year = {1993},
url = {https://doi.org/10.1016/0022-0000(93)90035-U},
doi = {10.1016/0022-0000(93)90035-U},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LovaszS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LovaszW93,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Peter Winkler},
title = {A note on the last new vertex visited by a random walk},
journal = {J. Graph Theory},
volume = {17},
number = {5},
pages = {593--596},
year = {1993},
url = {https://doi.org/10.1002/jgt.3190170505},
doi = {10.1002/JGT.3190170505},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LovaszW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LovaszS93,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Mikl{\'{o}}s Simonovits},
title = {Random Walks in a Convex Body and an Improved Volume Algorithm},
journal = {Random Struct. Algorithms},
volume = {4},
number = {4},
pages = {359--412},
year = {1993},
url = {https://doi.org/10.1002/rsa.3240040402},
doi = {10.1002/RSA.3240040402},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LovaszS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KarmarkarKLLL93,
author = {Narendra Karmarkar and
Richard M. Karp and
Richard J. Lipton and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Michael Luby},
title = {A Monte-Carlo Algorithm for Estimating the Permanent},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {2},
pages = {284--293},
year = {1993},
url = {https://doi.org/10.1137/0222021},
doi = {10.1137/0222021},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KarmarkarKLLL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Lovasz93,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {William J. Cook and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Paul D. Seymour},
title = {Randomized algorithms in combinatorial optimization},
booktitle = {Combinatorial Optimization, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, 1992/93},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {20},
pages = {153--179},
publisher = {{DIMACS/AMS}},
year = {1993},
url = {https://doi.org/10.1090/dimacs/020/03},
doi = {10.1090/DIMACS/020/03},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Lovasz93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BaranyHL92,
author = {Imre B{\'{a}}r{\'{a}}ny and
Roger Howe and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {On integer points in polyhedra: a lower bound},
journal = {Comb.},
volume = {12},
number = {2},
pages = {135--142},
year = {1992},
url = {https://doi.org/10.1007/BF01204716},
doi = {10.1007/BF01204716},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BaranyHL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CsimaL92,
author = {J. Csima and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {A matching algorithm for regular bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {35},
number = {3},
pages = {197--203},
year = {1992},
url = {https://doi.org/10.1016/0166-218X(92)90244-5},
doi = {10.1016/0166-218X(92)90244-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CsimaL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LovaszS92,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Herbert E. Scarf},
title = {The Generalized Basis Reduction Algorithm},
journal = {Math. Oper. Res.},
volume = {17},
number = {3},
pages = {751--764},
year = {1992},
url = {https://doi.org/10.1287/moor.17.3.751},
doi = {10.1287/MOOR.17.3.751},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/LovaszS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LovaszS92,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Mikl{\'{o}}s Simonovits},
title = {On the Randomized Complexity of Volume and Diameter},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {482--491},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267803},
doi = {10.1109/SFCS.1992.267803},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LovaszS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BjornerLY92,
author = {Anders Bj{\"{o}}rner and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Andrew Chi{-}Chih Yao},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Linear Decision Trees: Volume Estimates and Topological Bounds},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {170--177},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129730},
doi = {10.1145/129712.129730},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BjornerLY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeL92a,
author = {Uriel Feige and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Two-Prover One-Round Proof Systems: Their Power and Their Problems
(Extended Abstract)},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {733--744},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129783},
doi = {10.1145/129712.129783},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeigeL92a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BabaiGL91,
author = {L{\'{a}}szl{\'{o}} Babai and
Albert J. Goodman and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Graphs with Given Automorphism Group and Few Edge Orbits},
journal = {Eur. J. Comb.},
volume = {12},
number = {3},
pages = {185--203},
year = {1991},
url = {https://doi.org/10.1016/S0195-6698(13)80085-6},
doi = {10.1016/S0195-6698(13)80085-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BabaiGL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BjornerLS91,
author = {Anders Bj{\"{o}}rner and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Peter W. Shor},
title = {Chip-firing Games on Graphs},
journal = {Eur. J. Comb.},
volume = {12},
number = {4},
pages = {283--291},
year = {1991},
url = {https://doi.org/10.1016/S0195-6698(13)80111-4},
doi = {10.1016/S0195-6698(13)80111-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BjornerLS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/LovaszS91,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Alexander Schrijver},
title = {Cones of Matrices and Set-Functions and 0-1 Optimization},
journal = {{SIAM} J. Optim.},
volume = {1},
number = {2},
pages = {166--190},
year = {1991},
url = {https://doi.org/10.1137/0801013},
doi = {10.1137/0801013},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/LovaszS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeGLSS91,
author = {Uriel Feige and
Shafi Goldwasser and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Shmuel Safra and
Mario Szegedy},
title = {Approximating Clique is Almost NP-Complete (Preliminary Version)},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {2--12},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185341},
doi = {10.1109/SFCS.1991.185341},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/FeigeGLSS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LovaszNNW91,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Moni Naor and
Ilan Newman and
Avi Wigderson},
title = {Search Problems in the Decision Tree Model (Preliminary Version)},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {576--585},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185422},
doi = {10.1109/SFCS.1991.185422},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LovaszNNW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/CsiszarKLMS90,
author = {Imre Csisz{\'{a}}r and
J{\'{a}}nos K{\"{o}}rner and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Katalin Marton and
G{\'{a}}bor Simonyi},
title = {Entropy splitting for antiblocking corners and perfect graphs},
journal = {Comb.},
volume = {10},
number = {1},
pages = {27--40},
year = {1990},
url = {https://doi.org/10.1007/BF02122693},
doi = {10.1007/BF02122693},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/CsiszarKLMS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BaranyFL90,
author = {Imre B{\'{a}}r{\'{a}}ny and
Zolt{\'{a}}n F{\"{u}}redi and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {On the number of halving planes},
journal = {Comb.},
volume = {10},
number = {2},
pages = {175--183},
year = {1990},
url = {https://doi.org/10.1007/BF02123008},
doi = {10.1007/BF02123008},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BaranyFL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KannanLS90,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Herbert E. Scarf},
title = {The Shapes of Polyhedra},
journal = {Math. Oper. Res.},
volume = {15},
number = {2},
pages = {364--380},
year = {1990},
url = {https://doi.org/10.1287/moor.15.2.364},
doi = {10.1287/MOOR.15.2.364},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/KannanLS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/LovaszS90,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Alexander Schrijver},
editor = {William J. Cook and
Paul D. Seymour},
title = {Matrix Cones, Projection Representations, and Stable Set Polyhedra},
booktitle = {Polyhedral Combinatorics, Proceedings of a {DIMACS} Workshop, Morristown,
New Jersey, USA, June 12-16, 1989},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {1},
pages = {1--18},
publisher = {{DIMACS/AMS}},
year = {1990},
url = {https://doi.org/10.1090/dimacs/001/01},
doi = {10.1090/DIMACS/001/01},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/LovaszS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LovaszS90,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Mikl{\'{o}}s Simonovits},
title = {The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and
Computing the Volume},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {346--354},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89553},
doi = {10.1109/FSCS.1990.89553},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LovaszS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ErdosLV89,
author = {Paul Erd{\"{o}}s and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Katalin Vesztergombi},
title = {On the Graph of Large Distance},
journal = {Discret. Comput. Geom.},
volume = {4},
pages = {541--549},
year = {1989},
url = {https://doi.org/10.1007/BF02187746},
doi = {10.1007/BF02187746},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/ErdosLV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KorteL89,
author = {Bernhard Korte and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {The intersection of matroids and antimatroids},
journal = {Discret. Math.},
volume = {73},
number = {1-2},
pages = {143--157},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(88)90142-2},
doi = {10.1016/0012-365X(88)90142-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KorteL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LovaszST89,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Michael E. Saks and
William T. Trotter},
title = {An on-line graph coloring algorithm with sublinear performance ratio},
journal = {Discret. Math.},
volume = {75},
number = {1-3},
pages = {319--325},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(89)90096-4},
doi = {10.1016/0012-365X(89)90096-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LovaszST89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BaranyFL89,
author = {Imre B{\'{a}}r{\'{a}}ny and
Zolt{\'{a}}n F{\"{u}}redi and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Kurt Mehlhorn},
title = {On the Number of Halving Planes},
booktitle = {Proceedings of the Fifth Annual Symposium on Computational Geometry,
Saarbr{\"{u}}cken, Germany, June 5-7, 1989},
pages = {140--144},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73833.73849},
doi = {10.1145/73833.73849},
timestamp = {Mon, 14 Jun 2021 16:25:09 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BaranyFL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/Lovasz89,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Gerhard X. Ritter},
title = {Faster Algorithms for Hard Problems},
booktitle = {Information Processing 89, Proceedings of the {IFIP} 11th World Computer
Congress, San Francisco, USA, August 28 - September 1, 1989},
pages = {135--141},
publisher = {North-Holland/IFIP},
year = {1989},
timestamp = {Wed, 02 Feb 2022 21:17:54 +0100},
biburl = {https://dblp.org/rec/conf/ifip/Lovasz89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/sp/GLS1988,
author = {Martin Gr{\"{o}}tschel and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Alexander Schrijver},
title = {Geometric Algorithms and Combinatorial Optimization},
series = {Algorithms and Combinatorics},
volume = {2},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/978-3-642-97881-4},
doi = {10.1007/978-3-642-97881-4},
isbn = {978-3-642-97883-8},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/GLS1988.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/LinialLW88,
author = {Nathan Linial and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Avi Wigderson},
title = {Rubber bands, convex embeddings and graph connectivity},
journal = {Comb.},
volume = {8},
number = {1},
pages = {91--102},
year = {1988},
url = {https://doi.org/10.1007/BF02122557},
doi = {10.1007/BF02122557},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/LinialLW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LovaszS88,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Michael E. Saks},
title = {Lattices, M{\"{o}}bius Functions and Communication Complexity},
booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains,
New York, USA, 24-26 October 1988},
pages = {81--90},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SFCS.1988.21924},
doi = {10.1109/SFCS.1988.21924},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LovaszS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DressL87,
author = {Andreas W. M. Dress and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {On some combinatorial properties of algebraic matroids},
journal = {Comb.},
volume = {7},
number = {1},
pages = {39--48},
year = {1987},
url = {https://doi.org/10.1007/BF02579199},
doi = {10.1007/BF02579199},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/DressL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lovasz87,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Matching structure and the matching lattice},
journal = {J. Comb. Theory, Ser. {B}},
volume = {43},
number = {2},
pages = {187--222},
year = {1987},
url = {https://doi.org/10.1016/0095-8956(87)90021-9},
doi = {10.1016/0095-8956(87)90021-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lovasz87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0068161,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Algorithmic theory of numbers, graphs and convexity},
series = {{CBMS-NSF} regional conference series in applied mathematics},
volume = {50},
publisher = {{SIAM}},
year = {1986},
isbn = {978-0-89871-203-2},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0068161.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KorteL86,
author = {Bernhard Korte and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Homomorphisms and Ramsey properties of antimatroids},
journal = {Discret. Appl. Math.},
volume = {15},
number = {2-3},
pages = {283--290},
year = {1986},
url = {https://doi.org/10.1016/0166-218X(86)90049-1},
doi = {10.1016/0166-218X(86)90049-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KorteL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KorteL86,
author = {Bernhard Korte and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Non-interval greedoids and the transposition property},
journal = {Discret. Math.},
volume = {59},
number = {3},
pages = {297--314},
year = {1986},
url = {https://doi.org/10.1016/0012-365X(86)90176-7},
doi = {10.1016/0012-365X(86)90176-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KorteL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LovaszSV86,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Joel Spencer and
Katalin Vesztergombi},
title = {Discrepancy of Set-systems and Matrices},
journal = {Eur. J. Comb.},
volume = {7},
number = {2},
pages = {151--160},
year = {1986},
url = {https://doi.org/10.1016/S0195-6698(86)80041-5},
doi = {10.1016/S0195-6698(86)80041-5},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/LovaszSV86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GrotschelLS86,
author = {Martin Gr{\"{o}}tschel and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Alexander Schrijver},
title = {Relaxations of vertex packing},
journal = {J. Comb. Theory, Ser. {B}},
volume = {40},
number = {3},
pages = {330--343},
year = {1986},
url = {https://doi.org/10.1016/0095-8956(86)90087-0},
doi = {10.1016/0095-8956(86)90087-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GrotschelLS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FaigleLST86,
author = {Ulrich Faigle and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Rainer Schrader and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Searching in Trees, Series-Parallel and Interval Orders},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1075--1084},
year = {1986},
url = {https://doi.org/10.1137/0215077},
doi = {10.1137/0215077},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FaigleLST86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LinialLW86,
author = {Nathan Linial and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Avi Wigderson},
title = {A Physical Interpretation of Graph Connectivity, and Its Algorithmic
Applications},
booktitle = {27th Annual Symposium on Foundations of Computer Science, Toronto,
Canada, 27-29 October 1986},
pages = {39--48},
publisher = {{IEEE} Computer Society},
year = {1986},
url = {https://doi.org/10.1109/SFCS.1986.3},
doi = {10.1109/SFCS.1986.3},
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
biburl = {https://dblp.org/rec/conf/focs/LinialLW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KannanL86,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Kesav V. Nori},
title = {Covering Minima and Lattice Point Free Convex Bodies},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {241},
pages = {193--213},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-17179-7\_12},
doi = {10.1007/3-540-17179-7\_12},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KannanL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Lovasz86,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Kesav V. Nori},
title = {Connectivity Algorithms Using Rubber-bands},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {241},
pages = {394--411},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-17179-7\_24},
doi = {10.1007/3-540-17179-7\_24},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Lovasz86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KorteL85,
author = {Bernhard Korte and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {A Note on Selectors and Greedoids},
journal = {Eur. J. Comb.},
volume = {6},
number = {1},
pages = {59--67},
year = {1985},
url = {https://doi.org/10.1016/S0195-6698(85)80022-6},
doi = {10.1016/S0195-6698(85)80022-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KorteL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KorteL85,
author = {Bernhard Korte and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Polymatroid greedoids},
journal = {J. Comb. Theory, Ser. {B}},
volume = {38},
number = {1},
pages = {41--72},
year = {1985},
url = {https://doi.org/10.1016/0095-8956(85)90091-7},
doi = {10.1016/0095-8956(85)90091-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KorteL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BondyL85,
author = {J. Adrian Bondy and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Lengths of cycles in halin graphs},
journal = {J. Graph Theory},
volume = {9},
number = {3},
pages = {397--410},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090311},
doi = {10.1002/JGT.3190090311},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BondyL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/KorteL85,
author = {Bernhard Korte and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Relations between subclasses of greedoids},
journal = {Z. Oper. Research},
volume = {29},
number = {7},
pages = {249--267},
year = {1985},
url = {https://doi.org/10.1007/BF01918757},
doi = {10.1007/BF01918757},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/KorteL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lovasz85,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Computing ears and branchings in parallel},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
Oregon, USA, 21-23 October 1985},
pages = {464--467},
publisher = {{IEEE} Computer Society},
year = {1985},
url = {https://doi.org/10.1109/SFCS.1985.16},
doi = {10.1109/SFCS.1985.16},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lovasz85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Lovasz85,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Wilfried Brauer},
title = {Vertex Packing Algorithms},
booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece,
July 15-19, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {194},
pages = {1--14},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0015726},
doi = {10.1007/BFB0015726},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Lovasz85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GrotschelLS84,
author = {Martin Gr{\"{o}}tschel and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Alexander Schrijver},
title = {Corrigendum to our paper "The ellipsoid method and its consequences
in combinatorial optimization"},
journal = {Comb.},
volume = {4},
number = {4},
pages = {291--295},
year = {1984},
url = {https://doi.org/10.1007/BF02579139},
doi = {10.1007/BF02579139},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GrotschelLS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KannanLL84,
author = {Ravindran Kannan and
Arjen K. Lenstra and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Richard A. DeMillo},
title = {Polynomial Factorization and Nonrandomness of Bits of Algebraic and
Some Transcendental Numbers},
booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1984, Washington, DC, {USA}},
pages = {191--200},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800057.808681},
doi = {10.1145/800057.808681},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KannanLL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Lovasz83,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Ear-decompositions of matching covered graphs},
journal = {Comb.},
volume = {3},
number = {1},
pages = {105--117},
year = {1983},
url = {https://doi.org/10.1007/BF02579346},
doi = {10.1007/BF02579346},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Lovasz83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KorteL83,
author = {Bernhard Korte and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Structural properties of greedoids},
journal = {Comb.},
volume = {3},
number = {3},
pages = {359--374},
year = {1983},
url = {https://doi.org/10.1007/BF02579192},
doi = {10.1007/BF02579192},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KorteL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Lovasz82,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Tibor Gallai},
journal = {Comb.},
volume = {2},
number = {3},
pages = {203--205},
year = {1982},
url = {https://doi.org/10.1007/BF02579227},
doi = {10.1007/BF02579227},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Lovasz82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EdmondsLP82,
author = {Jack Edmonds and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
William R. Pulleyblank},
title = {Brick decompositions and the matching rank of graphs},
journal = {Comb.},
volume = {2},
number = {3},
pages = {247--274},
year = {1982},
url = {https://doi.org/10.1007/BF02579233},
doi = {10.1007/BF02579233},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EdmondsLP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismp/Lovasz82,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Achim Bachem and
Bernhard Korte and
Martin Gr{\"{o}}tschel},
title = {Submodular functions and convexity},
booktitle = {Mathematical Programming The State of the Art, XIth International
Symposium on Mathematical Programming, Bonn, Germany, August 23-27,
1982},
pages = {235--257},
publisher = {Springer},
year = {1982},
url = {https://doi.org/10.1007/978-3-642-68874-4\_10},
doi = {10.1007/978-3-642-68874-4\_10},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ismp/Lovasz82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BondyL81,
author = {J. Adrian Bondy and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Cycles through specified vertices of a graph},
journal = {Comb.},
volume = {1},
number = {2},
pages = {117--140},
year = {1981},
url = {https://doi.org/10.1007/BF02579268},
doi = {10.1007/BF02579268},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BondyL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GrotschelLS81,
author = {Martin Gr{\"{o}}tschel and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Alexander Schrijver},
title = {The ellipsoid method and its consequences in combinatorial optimization},
journal = {Comb.},
volume = {1},
number = {2},
pages = {169--197},
year = {1981},
url = {https://doi.org/10.1007/BF02579273},
doi = {10.1007/BF02579273},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GrotschelLS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/KorteL81,
author = {Bernhard Korte and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Ferenc G{\'{e}}cseg},
title = {Mathematical Structures Underlying Greedy Algorithms},
booktitle = {Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981
International FCT-Conference, Szeged, Hungary, August 24-28, 1981},
series = {Lecture Notes in Computer Science},
volume = {117},
pages = {205--209},
publisher = {Springer},
year = {1981},
url = {https://doi.org/10.1007/3-540-10854-8\_22},
doi = {10.1007/3-540-10854-8\_22},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/KorteL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Lovasz80,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Matroids and Sperner's Lemma},
journal = {Eur. J. Comb.},
volume = {1},
number = {1},
pages = {65--66},
year = {1980},
url = {https://doi.org/10.1016/S0195-6698(80)80023-0},
doi = {10.1016/S0195-6698(80)80023-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Lovasz80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lovasz80,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Matroid matching and some applications},
journal = {J. Comb. Theory, Ser. {B}},
volume = {28},
number = {2},
pages = {208--236},
year = {1980},
url = {https://doi.org/10.1016/0095-8956(80)90066-0},
doi = {10.1016/0095-8956(80)90066-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lovasz80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LovaszNP80,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Jaroslav Nesetril and
Ales Pultr},
title = {On a product dimension of graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {29},
number = {1},
pages = {47--67},
year = {1980},
url = {https://doi.org/10.1016/0095-8956(80)90043-X},
doi = {10.1016/0095-8956(80)90043-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LovaszNP80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Lovasz79,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {On the Shannon capacity of a graph},
journal = {{IEEE} Trans. Inf. Theory},
volume = {25},
number = {1},
pages = {1--7},
year = {1979},
url = {https://doi.org/10.1109/TIT.1979.1055985},
doi = {10.1109/TIT.1979.1055985},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Lovasz79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Lovasz79,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Lothar Budach},
title = {On determinants, matchings, and random algorithms},
booktitle = {Fundamentals of Computation Theory, {FCT} 1979, Proceedings of the
Conference on Algebraic, Arthmetic, and Categorial Methods in Computation
Theory, Berlin/Wendisch-Rietz, Germany, September 17-21, 1979},
pages = {565--574},
publisher = {Akademie-Verlag, Berlin},
year = {1979},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/Lovasz79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AleliunasKLLR79,
author = {Romas Aleliunas and
Richard M. Karp and
Richard J. Lipton and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Charles Rackoff},
title = {Random Walks, Universal Traversal Sequences, and the Complexity of
Maze Problems},
booktitle = {20th Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 29-31 October 1979},
pages = {218--223},
publisher = {{IEEE} Computer Society},
year = {1979},
url = {https://doi.org/10.1109/SFCS.1979.34},
doi = {10.1109/SFCS.1979.34},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AleliunasKLLR79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lovasz78,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Kneser's Conjecture, Chromatic Number, and Homotopy},
journal = {J. Comb. Theory, Ser. {A}},
volume = {25},
number = {3},
pages = {319--324},
year = {1978},
url = {https://doi.org/10.1016/0097-3165(78)90022-5},
doi = {10.1016/0097-3165(78)90022-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lovasz78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LovaszP77,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Michael D. Plummer},
title = {On minimal elementary bipartite graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {23},
number = {1},
pages = {127--138},
year = {1977},
url = {https://doi.org/10.1016/0095-8956(77)90062-4},
doi = {10.1016/0095-8956(77)90062-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LovaszP77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/LovaszG77,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
P{\'{e}}ter G{\'{a}}cs},
title = {Some Remarks on Generalized Spectra},
journal = {Math. Log. Q.},
volume = {23},
number = {36},
pages = {547--554},
year = {1977},
url = {https://doi.org/10.1002/malq.19770233608},
doi = {10.1002/MALQ.19770233608},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mlq/LovaszG77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lovasz76,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {On two minimax theorems in graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {21},
number = {2},
pages = {96--103},
year = {1976},
url = {https://doi.org/10.1016/0095-8956(76)90049-6},
doi = {10.1016/0095-8956(76)90049-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lovasz76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lovasz75,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {On the ratio of optimal integral and fractional covers},
journal = {Discret. Math.},
volume = {13},
number = {4},
pages = {383--390},
year = {1975},
url = {https://doi.org/10.1016/0012-365X(75)90058-8},
doi = {10.1016/0012-365X(75)90058-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lovasz75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lovasz72,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Normal hypergraphs and the perfect graph conjecture},
journal = {Discret. Math.},
volume = {2},
number = {3},
pages = {253--267},
year = {1972},
url = {https://doi.org/10.1016/0012-365X(72)90006-4},
doi = {10.1016/0012-365X(72)90006-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lovasz72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-05-03 00:12 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:
