BibTeX record journals/mst/AkridaGMS17

download as .bib file

@article{DBLP:journals/mst/AkridaGMS17,
  author       = {Eleni C. Akrida and
                  Leszek Gasieniec and
                  George B. Mertzios and
                  Paul G. Spirakis},
  title        = {The Complexity of Optimal Design of Temporally Connected Graphs},
  journal      = {Theory Comput. Syst.},
  volume       = {61},
  number       = {3},
  pages        = {907--944},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00224-017-9757-x},
  doi          = {10.1007/S00224-017-9757-X},
  timestamp    = {Fri, 27 Mar 2020 08:36:54 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/AkridaGMS17.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.