@article{DBLP:journals/algorithmica/WellerCDG18,
  author       = {Mathias Weller and
                  Annie Chateau and
                  Cl{\'{e}}ment Dallard and
                  Rodolphe Giroudeau},
  title        = {Scaffolding Problems Revisited: Complexity, Approximation and Fixed
                  Parameter Tractable Algorithms, and Some Special Cases},
  journal      = {Algorithmica},
  volume       = {80},
  number       = {6},
  pages        = {1771--1803},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00453-018-0405-x},
  doi          = {10.1007/S00453-018-0405-X},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/WellerCDG18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"DC7jXwEsts7RwNiJb","bibbaseid":"weller-chateau-dallard-giroudeau-scaffoldingproblemsrevisitedcomplexityapproximationandfixedparametertractablealgorithmsandsomespecialcases-2018","downloads":0,"creationDate":"2018-04-05T20:06:19.240Z","title":"Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases","author_short":["Weller, M.","Chateau, A.","Dallard, C.","Giroudeau, R."],"year":2018,"bibtype":"article","biburl":"http://dblp.org/pers/tb2/w/Weller:Mathias","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Mathias"],"propositions":[],"lastnames":["Weller"],"suffixes":[]},{"firstnames":["Annie"],"propositions":[],"lastnames":["Chateau"],"suffixes":[]},{"firstnames":["Clément"],"propositions":[],"lastnames":["Dallard"],"suffixes":[]},{"firstnames":["Rodolphe"],"propositions":[],"lastnames":["Giroudeau"],"suffixes":[]}],"title":"Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases","journal":"Algorithmica","volume":"80","number":"6","pages":"1771–1803","year":"2018","url":"https://doi.org/10.1007/s00453-018-0405-x","doi":"10.1007/S00453-018-0405-X","timestamp":"Sat, 19 Oct 2019 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/algorithmica/WellerCDG18.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/algorithmica/WellerCDG18,\n author = {Mathias Weller and\n Annie Chateau and\n Cl{\\'{e}}ment Dallard and\n Rodolphe Giroudeau},\n title = {Scaffolding Problems Revisited: Complexity, Approximation and Fixed\n Parameter Tractable Algorithms, and Some Special Cases},\n journal = {Algorithmica},\n volume = {80},\n number = {6},\n pages = {1771--1803},\n year = {2018},\n url = {https://doi.org/10.1007/s00453-018-0405-x},\n doi = {10.1007/S00453-018-0405-X},\n timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/algorithmica/WellerCDG18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Weller, M.","Chateau, A.","Dallard, C.","Giroudeau, R."],"key":"DBLP:journals/algorithmica/WellerCDG18","id":"DBLP:journals/algorithmica/WellerCDG18","bibbaseid":"weller-chateau-dallard-giroudeau-scaffoldingproblemsrevisitedcomplexityapproximationandfixedparametertractablealgorithmsandsomespecialcases-2018","role":"author","urls":{"Paper":"https://doi.org/10.1007/s00453-018-0405-x"},"metadata":{"authorlinks":{"weller, m":"https://bibbase.org/show?bib=http%3A%2F%2Fdblp.dagstuhl.de%2Fpers%2Ftb0%2Fw%2FWeller%3AMathias.bib"}},"downloads":0},"search_terms":["scaffolding","problems","revisited","complexity","approximation","fixed","parameter","tractable","algorithms","special","cases","weller","chateau","dallard","giroudeau"],"keywords":[],"authorIDs":["TGu5DA8jtddSomh6L"],"dataSources":["S8v6dBTYDW8zRm2Zp","gnpLmkqf5or77BT6p","p4oCSPTRLiiykYZHi"]}