BibTeX record journals/networks/BasteGPSST20

download as .bib file

@article{DBLP:journals/networks/BasteGPSST20,
  author       = {Julien Baste and
                  Didem G{\"{o}}z{\"{u}}pek and
                  Christophe Paul and
                  Ignasi Sau and
                  Mordechai Shalom and
                  Dimitrios M. Thilikos},
  title        = {Parameterized complexity of finding a spanning tree with minimum reload
                  cost diameter},
  journal      = {Networks},
  volume       = {75},
  number       = {3},
  pages        = {259--277},
  year         = {2020},
  url          = {https://doi.org/10.1002/net.21923},
  doi          = {10.1002/NET.21923},
  timestamp    = {Sat, 09 Apr 2022 12:20:25 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/BasteGPSST20.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.