Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter

Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos. Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. In Daniel Lokshtanov, Naomi Nishimura, editors, 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria. Volume 89 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

@inproceedings{BasteGPSST17,
  title = {Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter},
  author = {Julien Baste and Didem Gözüpek and Christophe Paul and Ignasi Sau and Mordechai Shalom and Dimitrios M. Thilikos},
  year = {2017},
  doi = {10.4230/LIPIcs.IPEC.2017.3},
  url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.3},
  researchr = {https://researchr.org/publication/BasteGPSST17},
  cites = {0},
  citedby = {0},
  booktitle = {12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria},
  editor = {Daniel Lokshtanov and Naomi Nishimura},
  volume = {89},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-051-4},
}