Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. Fomin, F. V., Lokshtanov, D., Panolan, F., & Saurabh, S. J. ACM, 63(4):29:1--29:60, 2016.
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms [link]Paper  Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms [pdf]Paper  doi  bibtex   
@article{2016b,
  author    = {Fedor V. Fomin and
               Daniel Lokshtanov and
               Fahad Panolan and
               Saket Saurabh},
  title     = {Efficient Computation of Representative Families with Applications
               in Parameterized and Exact Algorithms},
  journal   = {J. {ACM}},
  volume    = {63},
  number    = {4},
  pages     = {29:1--29:60},
  year      = {2016},
  url       = {http://doi.acm.org/10.1145/2886094},
  doi       = {10.1145/2886094},
Keywords = {parameterized complexity, exact exponential algorithms, matroid, treewidth},
Url_Paper = {http://www.ii.uib.no/~fomin/articles/2016/2016b.pdf},
  timestamp = {Fri, 09 Dec 2016 13:15:44 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jacm/FominLPS16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
Downloads: 0