BibTeX record conf/iwpec/BasteGPSST17

download as .bib file

@inproceedings{DBLP:conf/iwpec/BasteGPSST17,
  author       = {Julien Baste and
                  Didem G{\"{o}}z{\"{u}}pek and
                  Christophe Paul and
                  Ignasi Sau and
                  Mordechai Shalom and
                  Dimitrios M. Thilikos},
  editor       = {Daniel Lokshtanov and
                  Naomi Nishimura},
  title        = {Parameterized Complexity of Finding a Spanning Tree with Minimum Reload
                  Cost Diameter},
  booktitle    = {12th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2017, September 6-8, 2017, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {89},
  pages        = {3:1--3:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2017.3},
  doi          = {10.4230/LIPICS.IPEC.2017.3},
  timestamp    = {Sat, 09 Apr 2022 12:45:01 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/BasteGPSST17.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.