On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. Weller, M., Chateau, A., & Giroudeau, R. In Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings, pages 409–423, 2015.
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/cocoa/WellerCG15,
  author       = {Mathias Weller and
                  Annie Chateau and
                  Rodolphe Giroudeau},
  title        = {On the Complexity of Scaffolding Problems: From Cliques to Sparse
                  Graphs},
  booktitle    = {Combinatorial Optimization and Applications - 9th International Conference,
                  {COCOA} 2015, Houston, TX, USA, December 18-20, 2015, Proceedings},
  pages        = {409--423},
  year         = {2015},
  crossref     = {DBLP:conf/cocoa/2015},
  url          = {https://doi.org/10.1007/978-3-319-26626-8\_30},
  doi          = {10.1007/978-3-319-26626-8\_30},
  timestamp    = {Thu, 02 Dec 2021 16:45:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cocoa/WellerCG15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0