@article{DBLP:journals/corr/abs-1211-1505,
  author    = {Hans L. Bodlaender and
               Marek Cygan and
               Stefan Kratsch and
               Jesper Nederlof},
  title     = {Solving weighted and counting variants of connectivity problems parameterized
               by treewidth deterministically in single exponential time},
  journal   = {CoRR},
  volume    = {abs/1211.1505},
  year      = {2012},
  url       = {http://arxiv.org/abs/1211.1505},
  archivePrefix = {arXiv},
  eprint    = {1211.1505},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1211-1505},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"37EGHMudgtv4FmkbY","bibbaseid":"bodlaender-cygan-kratsch-nederlof-solvingweightedandcountingvariantsofconnectivityproblemsparameterizedbytreewidthdeterministicallyinsingleexponentialtime-2012","downloads":0,"creationDate":"2018-12-05T09:14:34.539Z","title":"Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time","author_short":["Bodlaender, H. L.","Cygan, M.","Kratsch, S.","Nederlof, J."],"year":2012,"bibtype":"article","biburl":"https://dblp.org/pid/33/7187.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Hans","L."],"propositions":[],"lastnames":["Bodlaender"],"suffixes":[]},{"firstnames":["Marek"],"propositions":[],"lastnames":["Cygan"],"suffixes":[]},{"firstnames":["Stefan"],"propositions":[],"lastnames":["Kratsch"],"suffixes":[]},{"firstnames":["Jesper"],"propositions":[],"lastnames":["Nederlof"],"suffixes":[]}],"title":"Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time","journal":"CoRR","volume":"abs/1211.1505","year":"2012","url":"http://arxiv.org/abs/1211.1505","archiveprefix":"arXiv","eprint":"1211.1505","timestamp":"Mon, 13 Aug 2018 01:00:00 +0200","biburl":"https://dblp.org/rec/bib/journals/corr/abs-1211-1505","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/abs-1211-1505,\n author = {Hans L. Bodlaender and\n Marek Cygan and\n Stefan Kratsch and\n Jesper Nederlof},\n title = {Solving weighted and counting variants of connectivity problems parameterized\n by treewidth deterministically in single exponential time},\n journal = {CoRR},\n volume = {abs/1211.1505},\n year = {2012},\n url = {http://arxiv.org/abs/1211.1505},\n archivePrefix = {arXiv},\n eprint = {1211.1505},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/corr/abs-1211-1505},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Bodlaender, H. L.","Cygan, M.","Kratsch, S.","Nederlof, J."],"key":"DBLP:journals/corr/abs-1211-1505","id":"DBLP:journals/corr/abs-1211-1505","bibbaseid":"bodlaender-cygan-kratsch-nederlof-solvingweightedandcountingvariantsofconnectivityproblemsparameterizedbytreewidthdeterministicallyinsingleexponentialtime-2012","role":"author","urls":{"Paper":"http://arxiv.org/abs/1211.1505"},"downloads":0},"search_terms":["solving","weighted","counting","variants","connectivity","problems","parameterized","treewidth","deterministically","single","exponential","time","bodlaender","cygan","kratsch","nederlof"],"keywords":[],"authorIDs":[],"dataSources":["qoaa8S6oo6iCH58av"]}