BibTeX records: Katalin Vesztergombi

download as .bib file

@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/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/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}
}
@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/dm/Vesztergombi96,
  author       = {Katalin Vesztergombi},
  title        = {The two largest distances in finite planar sets},
  journal      = {Discret. Math.},
  volume       = {150},
  number       = {1-3},
  pages        = {379--386},
  year         = {1996},
  url          = {https://doi.org/10.1016/0012-365X(95)00202-8},
  doi          = {10.1016/0012-365X(95)00202-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Vesztergombi96.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/Vesztergombi87,
  author       = {Katalin Vesztergombi},
  title        = {On large distances in planar sets},
  journal      = {Discret. Math.},
  volume       = {67},
  number       = {2},
  pages        = {191--198},
  year         = {1987},
  url          = {https://doi.org/10.1016/0012-365X(87)90027-6},
  doi          = {10.1016/0012-365X(87)90027-6},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/Vesztergombi87.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/dm/Vesztergombi85,
  author       = {Katalin Vesztergombi},
  title        = {On the distribution of distances in finite sets in the plane},
  journal      = {Discret. Math.},
  volume       = {57},
  number       = {1-2},
  pages        = {129--145},
  year         = {1985},
  url          = {https://doi.org/10.1016/0012-365X(85)90162-1},
  doi          = {10.1016/0012-365X(85)90162-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Vesztergombi85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/Vesztergombi80,
  author       = {Katalin Vesztergombi},
  title        = {Some remarks on the chromatic number of the strong product of graphs},
  journal      = {Acta Cybern.},
  volume       = {4},
  number       = {2},
  pages        = {207--212},
  year         = {1979},
  url          = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3179},
  timestamp    = {Wed, 16 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/actaC/Vesztergombi80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics