On exact algorithms for treewidth. Bodlaender, H. L., Fomin, F. V., Koster, A. M. C. A., Kratsch, D., & Thilikos, D. M. ACM Transactions on Algorithms, 9(1):12, 2012.
Link
Paper bibtex @article{2012k,
author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos},
bibsource = {DBLP, http://dblp.uni-trier.de},
date-added = {2016-02-23 00:46:42 +0000},
date-modified = {2016-02-23 00:46:42 +0000},
ee = {http://doi.acm.org/10.1145/2390176.2390188},
journal = {ACM Transactions on Algorithms},
number = {1},
pages = {12},
title = {On exact algorithms for treewidth},
url_paper = {http://www.ii.uib.no/~fomin/articles/2012/2012k.pdf},
volume = {9},
year = {2012}}
Downloads: 0
{"_id":"6s39vAo2BJuSDx894","bibbaseid":"bodlaender-fomin-koster-kratsch-thilikos-onexactalgorithmsfortreewidth-2012","downloads":0,"creationDate":"2015-06-23T17:42:39.471Z","title":"On exact algorithms for treewidth","author_short":["Bodlaender, H. L.","Fomin, F. V.","Koster, A. M. C. A.","Kratsch, D.","Thilikos, D. M."],"year":2012,"bibtype":"article","biburl":"https://bibbase.org/network/files/NMvet57iG3cfoNh6G","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Hans","L."],"propositions":[],"lastnames":["Bodlaender"],"suffixes":[]},{"firstnames":["Fedor","V."],"propositions":[],"lastnames":["Fomin"],"suffixes":[]},{"firstnames":["Arie","M.","C.","A."],"propositions":[],"lastnames":["Koster"],"suffixes":[]},{"firstnames":["Dieter"],"propositions":[],"lastnames":["Kratsch"],"suffixes":[]},{"firstnames":["Dimitrios","M."],"propositions":[],"lastnames":["Thilikos"],"suffixes":[]}],"bibsource":"DBLP, http://dblp.uni-trier.de","date-added":"2016-02-23 00:46:42 +0000","date-modified":"2016-02-23 00:46:42 +0000","ee":"http://doi.acm.org/10.1145/2390176.2390188","journal":"ACM Transactions on Algorithms","number":"1","pages":"12","title":"On exact algorithms for treewidth","url_paper":"http://www.ii.uib.no/~fomin/articles/2012/2012k.pdf","volume":"9","year":"2012","bibtex":"@article{2012k,\n\tauthor = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos},\n\tbibsource = {DBLP, http://dblp.uni-trier.de},\n\tdate-added = {2016-02-23 00:46:42 +0000},\n\tdate-modified = {2016-02-23 00:46:42 +0000},\n\tee = {http://doi.acm.org/10.1145/2390176.2390188},\n\tjournal = {ACM Transactions on Algorithms},\n\tnumber = {1},\n\tpages = {12},\n\ttitle = {On exact algorithms for treewidth},\n\turl_paper = {http://www.ii.uib.no/~fomin/articles/2012/2012k.pdf},\n\tvolume = {9},\n\tyear = {2012}}\n\n","author_short":["Bodlaender, H. L.","Fomin, F. V.","Koster, A. M. C. A.","Kratsch, D.","Thilikos, D. M."],"key":"2012k","id":"2012k","bibbaseid":"bodlaender-fomin-koster-kratsch-thilikos-onexactalgorithmsfortreewidth-2012","role":"author","urls":{"Link":"http://doi.acm.org/10.1145/2390176.2390188"," paper":"http://www.ii.uib.no/~fomin/articles/2012/2012k.pdf"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["exact","algorithms","treewidth","bodlaender","fomin","koster","kratsch","thilikos"],"keywords":[],"authorIDs":[],"dataSources":["Cypug6AWS8rvGPR5j","RtxX8siCrYJoMBHxn"]}