@inproceedings{DBLP:conf/soda/Bansal0U17,
  author    = {Nikhil Bansal and
               Daniel Reichman and
               Seeun William Umboh},
  title     = {LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth
               Graphs},
  booktitle = {{ACM-SIAM} Symposium on Discrete
               Algorithms {(SODA)}},
  year      = {2017},
  url       = {https://doi.org/10.1137/1.9781611974782.128},
  timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/Bansal0U17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"hB54a8z36B4g6L9Cs","bibbaseid":"bansal-reichman-umboh-lpbasedrobustalgorithmsfornoisyminorfreeandboundedtreewidthgraphs-2017","author_short":["Bansal, N.","Reichman, D.","Umboh, S. W."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Nikhil"],"propositions":[],"lastnames":["Bansal"],"suffixes":[]},{"firstnames":["Daniel"],"propositions":[],"lastnames":["Reichman"],"suffixes":[]},{"firstnames":["Seeun","William"],"propositions":[],"lastnames":["Umboh"],"suffixes":[]}],"title":"LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs","booktitle":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","year":"2017","url":"https://doi.org/10.1137/1.9781611974782.128","timestamp":"Tue, 15 Feb 2022 00:00:00 +0100","biburl":"https://dblp.org/rec/conf/soda/Bansal0U17.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/soda/Bansal0U17,\n author = {Nikhil Bansal and\n Daniel Reichman and\n Seeun William Umboh},\n title = {LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth\n Graphs},\n booktitle = {{ACM-SIAM} Symposium on Discrete\n Algorithms {(SODA)}},\n year = {2017},\n url = {https://doi.org/10.1137/1.9781611974782.128},\n timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/soda/Bansal0U17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Bansal, N.","Reichman, D.","Umboh, S. W."],"key":"DBLP:conf/soda/Bansal0U17","id":"DBLP:conf/soda/Bansal0U17","bibbaseid":"bansal-reichman-umboh-lpbasedrobustalgorithmsfornoisyminorfreeandboundedtreewidthgraphs-2017","role":"author","urls":{"Paper":"https://doi.org/10.1137/1.9781611974782.128"},"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/qyK8KPx6JHiBjGaRs","dataSources":["fMqRtzLgM2KNfkNW2","eg2vynTaAy9aRwMje","JstqMqR72gLdioEdx","wztYpFajAHupX7543","SQ5YPvQM68JoyAMKQ"],"keywords":[],"search_terms":["based","robust","algorithms","noisy","minor","free","bounded","treewidth","graphs","bansal","reichman","umboh"],"title":"LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs","year":2017,"downloads":1}