@article{ dblp3290931,
  title = {Solving Connected Dominating Set Faster than 2<sup> <i>n</i> </sup>},
  author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch},
  author_short = {Fomin, F. V. and Grandoni, F. and Kratsch, D.},
  bibtype = {article},
  type = {article},
  year = {2008},
  key = {dblp3290931},
  id = {dblp3290931},
  biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/FominGK08},
  url = {http://dx.doi.org/10.1007/s00453-007-9145-z},
  journal = {Algorithmica},
  pages = {153-166},
  number = {2},
  volume = {52},
  text = {Algorithmica 52(2):153-166 (2008)}
}

{"_id":"dy9stG2AE53joBM9B","bibbaseid":"fomin-grandoni-kratsch-solvingconnecteddominatingsetfasterthan2supinisup-2008","downloads":0,"creationDate":"2015-06-23T17:42:39.930Z","title":"Solving Connected Dominating Set Faster than 2^<i>n</i>","author_short":["Fomin, F. V.","Grandoni, F.","Kratsch, D."],"year":2008,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/FominGK08","bibdata":{"title":"Solving Connected Dominating Set Faster than 2^<i>n</i>","author":["Fedor V. Fomin","Fabrizio Grandoni","Dieter Kratsch"],"author_short":["Fomin, F. V.","Grandoni, F.","Kratsch, D."],"bibtype":"article","type":"article","year":"2008","key":"dblp3290931","id":"dblp3290931","biburl":"http://www.dblp.org/rec/bibtex/journals/algorithmica/FominGK08","url":"http://dx.doi.org/10.1007/s00453-007-9145-z","journal":"Algorithmica","pages":"153-166","number":"2","volume":"52","text":"Algorithmica 52(2):153-166 (2008)","bibtex":"@article{ dblp3290931,\n title = {Solving Connected Dominating Set Faster than 2^<i>n</i>},\n author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch},\n author_short = {Fomin, F. V. and Grandoni, F. and Kratsch, D.},\n bibtype = {article},\n type = {article},\n year = {2008},\n key = {dblp3290931},\n id = {dblp3290931},\n biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/FominGK08},\n url = {http://dx.doi.org/10.1007/s00453-007-9145-z},\n journal = {Algorithmica},\n pages = {153-166},\n number = {2},\n volume = {52},\n text = {Algorithmica 52(2):153-166 (2008)}\n}","bibbaseid":"fomin-grandoni-kratsch-solvingconnecteddominatingsetfasterthan2supinisup-2008","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s00453-007-9145-z"},"downloads":0},"search_terms":["solving","connected","dominating","set","faster","sup","sup","fomin","grandoni","kratsch"],"keywords":[],"authorIDs":["55899a8faca630573e0006e6"],"dataSources":["625h8Ek9kNRmGzBru"]}