@inproceedings{DBLP:conf/wabi/ScornavaccaW21,
  author       = {C{\'{e}}line Scornavacca and
                  Mathias Weller},
  title        = {Treewidth-Based Algorithms for the Small Parsimony Problem on Networks},
  booktitle    = {{WABI}},
  series       = {LIPIcs},
  volume       = {201},
  pages        = {6:1--6:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021}
}

{"_id":"pqKX5GPyfkJ6mbG82","bibbaseid":"scornavacca-weller-treewidthbasedalgorithmsforthesmallparsimonyproblemonnetworks-2021","author_short":["Scornavacca, C.","Weller, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Céline"],"propositions":[],"lastnames":["Scornavacca"],"suffixes":[]},{"firstnames":["Mathias"],"propositions":[],"lastnames":["Weller"],"suffixes":[]}],"title":"Treewidth-Based Algorithms for the Small Parsimony Problem on Networks","booktitle":"WABI","series":"LIPIcs","volume":"201","pages":"6:1–6:21","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2021","bibtex":"@inproceedings{DBLP:conf/wabi/ScornavaccaW21,\n author = {C{\\'{e}}line Scornavacca and\n Mathias Weller},\n title = {Treewidth-Based Algorithms for the Small Parsimony Problem on Networks},\n booktitle = {{WABI}},\n series = {LIPIcs},\n volume = {201},\n pages = {6:1--6:21},\n publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik},\n year = {2021}\n}\n\n","author_short":["Scornavacca, C.","Weller, M."],"key":"DBLP:conf/wabi/ScornavaccaW21","id":"DBLP:conf/wabi/ScornavaccaW21","bibbaseid":"scornavacca-weller-treewidthbasedalgorithmsforthesmallparsimonyproblemonnetworks-2021","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://dblp.dagstuhl.de/pers/tb0/w/Weller:Mathias.bib","dataSources":["p4oCSPTRLiiykYZHi","S8v6dBTYDW8zRm2Zp"],"keywords":[],"search_terms":["treewidth","based","algorithms","small","parsimony","problem","networks","scornavacca","weller"],"title":"Treewidth-Based Algorithms for the Small Parsimony Problem on Networks","year":2021}