BibTeX records: Daniela Ferrero

download as .bib file

@article{DBLP:journals/combinatorics/FerreroFHHLMNS19,
  author       = {Daniela Ferrero and
                  Mary Flagg and
                  H. Tracy Hall and
                  Leslie Hogben and
                  Jephian C.{-}H. Lin and
                  Seth A. Meyer and
                  Shahla Nasserasr and
                  Bryan L. Shader},
  title        = {Rigid Linkages and Partial Zero Forcing},
  journal      = {Electron. J. Comb.},
  volume       = {26},
  number       = {2},
  pages        = {2},
  year         = {2019},
  url          = {https://doi.org/10.37236/8097},
  doi          = {10.37236/8097},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/combinatorics/FerreroFHHLMNS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FerreroKS19,
  author       = {Daniela Ferrero and
                  Thomas Kalinowski and
                  Sudeep Stephen},
  title        = {Zero forcing in iterated line digraphs},
  journal      = {Discret. Appl. Math.},
  volume       = {255},
  pages        = {198--208},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.dam.2018.08.019},
  doi          = {10.1016/J.DAM.2018.08.019},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FerreroKS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoyerBEFKKPR19,
  author       = {Kirk Boyer and
                  Boris Brimkov and
                  Sean English and
                  Daniela Ferrero and
                  Ariel Keller and
                  Rachel Kirsch and
                  Michael Phillips and
                  Carolyn Reinhart},
  title        = {The zero forcing polynomial of a graph},
  journal      = {Discret. Appl. Math.},
  volume       = {258},
  pages        = {35--48},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.dam.2018.11.033},
  doi          = {10.1016/J.DAM.2018.11.033},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BoyerBEFKKPR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BozemanBEFFH19,
  author       = {Chassidy Bozeman and
                  Boris Brimkov and
                  Craig Erickson and
                  Daniela Ferrero and
                  Mary Flagg and
                  Leslie Hogben},
  title        = {Restricted power domination and zero forcing problems},
  journal      = {J. Comb. Optim.},
  volume       = {37},
  number       = {3},
  pages        = {935--956},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10878-018-0330-6},
  doi          = {10.1007/S10878-018-0330-6},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/BozemanBEFFH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FerreroGKRS19,
  author       = {Daniela Ferrero and
                  Cyriac Grigorious and
                  Thomas Kalinowski and
                  Joe Ryan and
                  Sudeep Stephen},
  title        = {Minimum rank and zero forcing number for butterfly networks},
  journal      = {J. Comb. Optim.},
  volume       = {37},
  number       = {3},
  pages        = {970--988},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10878-018-0335-1},
  doi          = {10.1007/S10878-018-0335-1},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/FerreroGKRS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BensonFFFHV18,
  author       = {Katherine F. Benson and
                  Daniela Ferrero and
                  Mary Flagg and
                  Veronika Furst and
                  Leslie Hogben and
                  Violeta Vasilevska},
  title        = {Nordhaus-Gaddum problems for power domination},
  journal      = {Discret. Appl. Math.},
  volume       = {251},
  pages        = {103--113},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2018.06.004},
  doi          = {10.1016/J.DAM.2018.06.004},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BensonFFFHV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FerreroHKY18,
  author       = {Daniela Ferrero and
                  Leslie Hogben and
                  Franklin H. J. Kenter and
                  Michael Young},
  title        = {The relationship between k-forcing and k-power domination},
  journal      = {Discret. Math.},
  volume       = {341},
  number       = {6},
  pages        = {1789--1797},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.disc.2017.10.031},
  doi          = {10.1016/J.DISC.2017.10.031},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/FerreroHKY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FerreroL18,
  author       = {Daniela Ferrero and
                  Linda M. Lesniak},
  title        = {Chorded Pancyclicity in \emph{k}-Partite Graphs},
  journal      = {Graphs Comb.},
  volume       = {34},
  number       = {6},
  pages        = {1565--1580},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00373-018-1942-4},
  doi          = {10.1007/S00373-018-1942-4},
  timestamp    = {Mon, 15 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/gc/FerreroL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FerreroHKY17,
  author       = {Daniela Ferrero and
                  Leslie Hogben and
                  Franklin H. J. Kenter and
                  Michael Young},
  title        = {Note on power propagation time and lower bounds for the power domination
                  number},
  journal      = {J. Comb. Optim.},
  volume       = {34},
  number       = {3},
  pages        = {736--741},
  year         = {2017},
  url          = {https://doi.org/10.1007/s10878-016-0103-z},
  doi          = {10.1007/S10878-016-0103-Z},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/FerreroHKY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FerreroGKRS16,
  author       = {Daniela Ferrero and
                  Cyriac Grigorious and
                  Thomas Kalinowski and
                  Joe Ryan and
                  Sudeep Stephen},
  title        = {Minimum rank and zero forcing number for butterfly networks},
  journal      = {CoRR},
  volume       = {abs/1607.07522},
  year         = {2016},
  url          = {http://arxiv.org/abs/1607.07522},
  eprinttype    = {arXiv},
  eprint       = {1607.07522},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/FerreroGKRS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/FerreroH14,
  author       = {Daniela Ferrero and
                  Sarah Hanusch},
  title        = {Component connectivity of generalized Petersen graphs},
  journal      = {Int. J. Comput. Math.},
  volume       = {91},
  number       = {9},
  pages        = {1940--1963},
  year         = {2014},
  url          = {https://doi.org/10.1080/00207160.2013.878023},
  doi          = {10.1080/00207160.2013.878023},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijcm/FerreroH14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BarreraF11,
  author       = {Roberto Barrera and
                  Daniela Ferrero},
  title        = {Power domination in cylinders, tori, and generalized Petersen graphs},
  journal      = {Networks},
  volume       = {58},
  number       = {1},
  pages        = {43--49},
  year         = {2011},
  url          = {https://doi.org/10.1002/net.20413},
  doi          = {10.1002/NET.20413},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BarreraF11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/WangHFS08,
  author       = {Jeng{-}Jung Wang and
                  Tung{-}Yang Ho and
                  Daniela Ferrero and
                  Ting{-}Yi Sung},
  title        = {Diameter variability of cycles and tori},
  journal      = {Inf. Sci.},
  volume       = {178},
  number       = {14},
  pages        = {2960--2967},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.ins.2008.03.008},
  doi          = {10.1016/J.INS.2008.03.008},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/isci/WangHFS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ispan/Ferrero08,
  author       = {Daniela Ferrero},
  title        = {Product Line Sigraphs},
  booktitle    = {9th International Symposium on Parallel Architectures, Algorithms,
                  and Networks, {ISPAN} 2008, 7-9 May 2008, Sydney, NSW, Australia},
  pages        = {141--145},
  publisher    = {{IEEE} Computer Society},
  year         = {2008},
  url          = {https://doi.org/10.1109/I-SPAN.2008.15},
  doi          = {10.1109/I-SPAN.2008.15},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ispan/Ferrero08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itng/Ferrero07,
  author       = {Daniela Ferrero},
  editor       = {Shahram Latifi},
  title        = {Some properties of superline digraphs},
  booktitle    = {Fourth International Conference on Information Technology: New Generations
                  {(ITNG} 2007), 2-4 April 2007, Las Vegas, Nevada, {USA}},
  pages        = {1073--1076},
  publisher    = {{IEEE} Computer Society},
  year         = {2007},
  url          = {https://doi.org/10.1109/ITNG.2007.183},
  doi          = {10.1109/ITNG.2007.183},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/itng/Ferrero07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BalbuenaMF05,
  author       = {Camino Balbuena and
                  Xavier Marcote and
                  Daniela Ferrero},
  title        = {Diameter vulnerability of iterated line digraphs in terms of the girth},
  journal      = {Networks},
  volume       = {45},
  number       = {2},
  pages        = {49--54},
  year         = {2005},
  url          = {https://doi.org/10.1002/net.20049},
  doi          = {10.1002/NET.20049},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BalbuenaMF05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ispan/BaggaF05,
  author       = {Jay S. Bagga and
                  Daniela Ferrero},
  title        = {The structure of super line graphs},
  booktitle    = {8th International Symposium on Parallel Architectures, Algorithms,
                  and Networks, {ISPAN} 2005, December 7-9. 2005, Las Vegas, Nevada,
                  {USA}},
  pages        = {468--471},
  publisher    = {{IEEE} Computer Society},
  year         = {2005},
  url          = {https://doi.org/10.1109/ISPAN.2005.84},
  doi          = {10.1109/ISPAN.2005.84},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ispan/BaggaF05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BalbuenaF03,
  author       = {Camino Balbuena and
                  Daniela Ferrero},
  title        = {Edge-connectivity and super edge-connectivity of \emph{P}\({}_{\mbox{2}}\)-path
                  graphs},
  journal      = {Discret. Math.},
  volume       = {269},
  number       = {1-3},
  pages        = {13--20},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0012-365X(02)00828-2},
  doi          = {10.1016/S0012-365X(02)00828-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BalbuenaF03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/FerreroH03,
  author       = {Daniela Ferrero and
                  Frank Harary},
  title        = {Edge Sums of Debruijn Interconnection Networks},
  journal      = {Int. J. Comput. Math.},
  volume       = {80},
  number       = {7},
  pages        = {819--824},
  year         = {2003},
  url          = {https://doi.org/10.1080/0020716031000087159a},
  doi          = {10.1080/0020716031000087159A},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijcm/FerreroH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/join/BalbuenaFMP03,
  author       = {Camino Balbuena and
                  Daniela Ferrero and
                  Xavier Marcote and
                  Ignacio M. Pelayo},
  title        = {Algebraic properties of a digraph and its line digraph},
  journal      = {J. Interconnect. Networks},
  volume       = {4},
  number       = {4},
  pages        = {377--393},
  year         = {2003},
  url          = {https://doi.org/10.1142/S0219265903000933},
  doi          = {10.1142/S0219265903000933},
  timestamp    = {Fri, 05 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/join/BalbuenaFMP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FerreroP02,
  author       = {Daniela Ferrero and
                  Carles Padr{\'{o}}},
  title        = {Connectivity and fault-tolerance of hyperdigraphs},
  journal      = {Discret. Appl. Math.},
  volume       = {117},
  number       = {1-3},
  pages        = {15--26},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0166-218X(00)00333-4},
  doi          = {10.1016/S0166-218X(00)00333-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FerreroP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FerreroP02,
  author       = {Daniela Ferrero and
                  Carles Padr{\'{o}}},
  title        = {Partial line directed hypergraphs},
  journal      = {Networks},
  volume       = {39},
  number       = {2},
  pages        = {61--67},
  year         = {2002},
  url          = {https://doi.org/10.1002/net.10013},
  doi          = {10.1002/NET.10013},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/FerreroP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FerreroP01,
  author       = {Daniela Ferrero and
                  Carles Padr{\'{o}}},
  title        = {New bounds on the diameter vulnerability of iterated line digraphs},
  journal      = {Discret. Math.},
  volume       = {233},
  number       = {1-3},
  pages        = {103--113},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00230-2},
  doi          = {10.1016/S0012-365X(00)00230-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/FerreroP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FerreroP99,
  author       = {Daniela Ferrero and
                  Carles Padr{\'{o}}},
  title        = {Disjoint paths of bounded length in large generalized cycles},
  journal      = {Discret. Math.},
  volume       = {197-198},
  pages        = {285--298},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(99)90075-4},
  doi          = {10.1016/S0012-365X(99)90075-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/FerreroP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sccc/Ferrero99,
  author       = {Daniela Ferrero},
  title        = {A Technique for the (d, s, N)-Bus Network Problem},
  booktitle    = {19th International Conference of the Chilean Computer Science Society
                  {(SCCC} '99), 11-13 November 1999, Talca, Chile},
  pages        = {129--135},
  publisher    = {{IEEE} Computer Society},
  year         = {1999},
  url          = {https://doi.org/10.1109/SCCC.1999.810165},
  doi          = {10.1109/SCCC.1999.810165},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sccc/Ferrero99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sccc/FerreroP97,
  author       = {Daniela Ferrero and
                  Carles Padr{\'{o}}},
  title        = {Fault-Tolerant Routings in Large Generalized Cycles},
  booktitle    = {Proceedings of 17th International Conference of the Chilean Computer
                  Science Society {(SCCC} '97), November 12-14, 1997, Valpariso, Chile},
  pages        = {58--65},
  publisher    = {{IEEE} Computer Society},
  year         = {1997},
  url          = {https://doi.org/10.1109/SCCC.1997.636870},
  doi          = {10.1109/SCCC.1997.636870},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sccc/FerreroP97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics