BibTeX records: Ermelinda DeLaViña

download as .bib file

@article{DBLP:journals/arsmc/DeLaVinaL13,
  author       = {Ermelinda DeLaVi{\~{n}}a and
                  Craig E. Larson},
  title        = {A parallel algorithm for computing the critical independence number
                  and related sets},
  journal      = {Ars Math. Contemp.},
  volume       = {6},
  number       = {2},
  pages        = {237--245},
  year         = {2013},
  url          = {https://doi.org/10.26493/1855-3974.165.b8b},
  doi          = {10.26493/1855-3974.165.B8B},
  timestamp    = {Wed, 27 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arsmc/DeLaVinaL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/gc/DeLaVinaLPW12,
  author       = {Ermelinda DeLaVi{\~{n}}a and
                  Craig E. Larson and
                  Ryan Pepper and
                  Bill Waller},
  title        = {A Characterization of Graphs Where the Independence Number Equals
                  the Radius},
  journal      = {Graphs Comb.},
  volume       = {28},
  number       = {3},
  pages        = {315--332},
  year         = {2012},
  url          = {https://doi.org/10.1007/s00373-011-1054-x},
  doi          = {10.1007/S00373-011-1054-X},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/DeLaVinaLPW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/appml/DeLaVinaGHPV11,
  author       = {Ermelinda DeLaVi{\~{n}}a and
                  Wayne Goddard and
                  Michael A. Henning and
                  Ryan Pepper and
                  Emil R. Vaughan},
  title        = {Bounds on the k-domination number of a graph},
  journal      = {Appl. Math. Lett.},
  volume       = {24},
  number       = {6},
  pages        = {996--998},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.aml.2011.01.013},
  doi          = {10.1016/J.AML.2011.01.013},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/appml/DeLaVinaGHPV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dmgt/DeLaVinaPW10,
  author       = {Ermelinda DeLaVi{\~{n}}a and
                  Ryan Pepper and
                  Bill Waller},
  title        = {Lower bounds for the domination number},
  journal      = {Discuss. Math. Graph Theory},
  volume       = {30},
  number       = {3},
  pages        = {475--487},
  year         = {2010},
  url          = {https://doi.org/10.7151/dmgt.1508},
  doi          = {10.7151/DMGT.1508},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dmgt/DeLaVinaPW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/DeLaVinaPW09,
  author       = {Ermelinda DeLaVi{\~{n}}a and
                  Ryan Pepper and
                  Bill Waller},
  title        = {A note on dominating sets and average distance},
  journal      = {Discret. Math.},
  volume       = {309},
  number       = {8},
  pages        = {2615--2619},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.disc.2008.03.018},
  doi          = {10.1016/J.DISC.2008.03.018},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/DeLaVinaPW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icumt/YuanWV09,
  author       = {Shengli Yuan and
                  William Waller and
                  Ermelinda DeLaVi{\~{n}}a},
  title        = {Heuristic algorithms for finding reliable lightpath under multiple
                  failures},
  booktitle    = {Proceedings of the International Conference on Ultra Modern Telecommunications,
                  {ICUMT} 2009, 12-14 October 2009, St. Petersburg, Russia},
  pages        = {1--7},
  publisher    = {{IEEE}},
  year         = {2009},
  url          = {https://doi.org/10.1109/ICUMT.2009.5345552},
  doi          = {10.1109/ICUMT.2009.5345552},
  timestamp    = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl       = {https://dblp.org/rec/conf/icumt/YuanWV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/DeLaVinaW08,
  author       = {Ermelinda DeLaVi{\~{n}}a and
                  Bill Waller},
  title        = {Spanning Trees with Many Leaves and Average Distance},
  journal      = {Electron. J. Comb.},
  volume       = {15},
  number       = {1},
  year         = {2008},
  url          = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r33.html},
  timestamp    = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/DeLaVinaW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dimacs/DeLaVina01,
  author       = {Ermelinda DeLaVi{\~{n}}a},
  editor       = {Siemion Fajtlowicz and
                  Patrick W. Fowler and
                  Pierre Hansen and
                  Melvin F. Janowitz and
                  Fred S. Roberts},
  title        = {Graffiti.pc: {A} Variant of Graffiti},
  booktitle    = {Graphs and Discovery, Proceedings of a {DIMACS} Workshop, New Brunswick,
                  New Jersey, USA, November 12-16, 2001},
  series       = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume       = {69},
  pages        = {71--79},
  publisher    = {{DIMACS/AMS}},
  year         = {2001},
  url          = {https://doi.org/10.1090/dimacs/069/05},
  doi          = {10.1090/DIMACS/069/05},
  timestamp    = {Mon, 22 May 2023 16:07:34 +0200},
  biburl       = {https://dblp.org/rec/conf/dimacs/DeLaVina01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dimacs/DeLaVina01a,
  author       = {Ermelinda DeLaVi{\~{n}}a},
  editor       = {Siemion Fajtlowicz and
                  Patrick W. Fowler and
                  Pierre Hansen and
                  Melvin F. Janowitz and
                  Fred S. Roberts},
  title        = {Some History of the Development of Graffiti},
  booktitle    = {Graphs and Discovery, Proceedings of a {DIMACS} Workshop, New Brunswick,
                  New Jersey, USA, November 12-16, 2001},
  series       = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume       = {69},
  pages        = {81--118},
  publisher    = {{DIMACS/AMS}},
  year         = {2001},
  url          = {https://doi.org/10.1090/dimacs/069/06},
  doi          = {10.1090/DIMACS/069/06},
  timestamp    = {Thu, 09 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dimacs/DeLaVina01a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dimacs/DeLaVinaFW01,
  author       = {Ermelinda DeLaVi{\~{n}}a and
                  Siemion Fajtlowicz and
                  William Waller},
  editor       = {Siemion Fajtlowicz and
                  Patrick W. Fowler and
                  Pierre Hansen and
                  Melvin F. Janowitz and
                  Fred S. Roberts},
  title        = {On Some Conjectures of Griggs and Graffiti},
  booktitle    = {Graphs and Discovery, Proceedings of a {DIMACS} Workshop, New Brunswick,
                  New Jersey, USA, November 12-16, 2001},
  series       = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume       = {69},
  pages        = {119--125},
  publisher    = {{DIMACS/AMS}},
  year         = {2001},
  url          = {https://doi.org/10.1090/dimacs/069/07},
  doi          = {10.1090/DIMACS/069/07},
  timestamp    = {Thu, 09 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/dimacs/DeLaVinaFW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/DeLaVinaF96,
  author       = {Ermelinda DeLaVi{\~{n}}a and
                  Siemion Fajtlowicz},
  title        = {Ramseyan Properties of Graphs},
  journal      = {Electron. J. Comb.},
  volume       = {3},
  number       = {1},
  year         = {1996},
  url          = {https://doi.org/10.37236/1250},
  doi          = {10.37236/1250},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/DeLaVinaF96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.