Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Fomin, F. V., Lokshtanov, D., Pilipczuk, M., Saurabh, S., & Wrochna, M. CoRR, 2015. Paper bibtex @article{ dblp1750291,
title = {Fully polynomial-time parameterized computations for graphs and matrices of low treewidth},
author = {Fedor V. Fomin and Daniel Lokshtanov and Michal Pilipczuk and Saket Saurabh and Marcin Wrochna},
author_short = {Fomin, F. V. and Lokshtanov, D. and Pilipczuk, M. and Saurabh, S. and Wrochna, M.},
bibtype = {article},
type = {article},
year = {2015},
key = {dblp1750291},
id = {dblp1750291},
biburl = {http://www.dblp.org/rec/bibtex/journals/corr/FominLPSW15},
url = {http://arxiv.org/abs/1511.01379},
journal = {CoRR},
volume = {abs/1511.01379},
text = {CoRR abs/1511.01379 (2015)}
}
Downloads: 0
{"_id":"CAABTg2SCTS3hQLWK","bibbaseid":"fomin-lokshtanov-pilipczuk-saurabh-wrochna-fullypolynomialtimeparameterizedcomputationsforgraphsandmatricesoflowtreewidth-2015","downloads":0,"creationDate":"2016-02-19T11:50:52.564Z","title":"Fully polynomial-time parameterized computations for graphs and matrices of low treewidth","author_short":["Fomin, F. V.","Lokshtanov, D.","Pilipczuk, M.","Saurabh, S.","Wrochna, M."],"year":2015,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/corr/FominLPSW15","bibdata":{"title":"Fully polynomial-time parameterized computations for graphs and matrices of low treewidth","author":["Fedor V. Fomin","Daniel Lokshtanov","Michal Pilipczuk","Saket Saurabh","Marcin Wrochna"],"author_short":["Fomin, F. V.","Lokshtanov, D.","Pilipczuk, M.","Saurabh, S.","Wrochna, M."],"bibtype":"article","type":"article","year":"2015","key":"dblp1750291","id":"dblp1750291","biburl":"http://www.dblp.org/rec/bibtex/journals/corr/FominLPSW15","url":"http://arxiv.org/abs/1511.01379","journal":"CoRR","volume":"abs/1511.01379","text":"CoRR abs/1511.01379 (2015)","bibtex":"@article{ dblp1750291,\n title = {Fully polynomial-time parameterized computations for graphs and matrices of low treewidth},\n author = {Fedor V. Fomin and Daniel Lokshtanov and Michal Pilipczuk and Saket Saurabh and Marcin Wrochna},\n author_short = {Fomin, F. V. and Lokshtanov, D. and Pilipczuk, M. and Saurabh, S. and Wrochna, M.},\n bibtype = {article},\n type = {article},\n year = {2015},\n key = {dblp1750291},\n id = {dblp1750291},\n biburl = {http://www.dblp.org/rec/bibtex/journals/corr/FominLPSW15},\n url = {http://arxiv.org/abs/1511.01379},\n journal = {CoRR},\n volume = {abs/1511.01379},\n text = {CoRR abs/1511.01379 (2015)}\n}","bibbaseid":"fomin-lokshtanov-pilipczuk-saurabh-wrochna-fullypolynomialtimeparameterizedcomputationsforgraphsandmatricesoflowtreewidth-2015","role":"author","urls":{"Paper":"http://arxiv.org/abs/1511.01379"},"downloads":0},"search_terms":["fully","polynomial","time","parameterized","computations","graphs","matrices","low","treewidth","fomin","lokshtanov","pilipczuk","saurabh","wrochna"],"keywords":[],"authorIDs":[],"dataSources":["kHEApdKX5Coy257dW"]}