@article{DBLP:journals/jda/Binkele-RaibleF12,
  author    = {Daniel Binkele{-}Raible and
               Henning Fernau},
  title     = {An exact exponential-time algorithm for the Directed Maximum Leaf
               Spanning Tree problem},
  journal   = {J. Discrete Algorithms},
  volume    = {15},
  pages     = {43--55},
  year      = {2012},
  url       = {https://doi.org/10.1016/j.jda.2012.03.006},
  doi       = {10.1016/j.jda.2012.03.006},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jda/Binkele-RaibleF12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"7ZRXLJLiA4f7nbQE9","bibbaseid":"binkeleraible-fernau-anexactexponentialtimealgorithmforthedirectedmaximumleafspanningtreeproblem-2012","downloads":0,"creationDate":"2018-10-01T13:54:48.771Z","title":"An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem","author_short":["Binkele-Raible, D.","Fernau, H."],"year":2012,"bibtype":"article","biburl":"https://dblp.org/pid/f/HenningFernau.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Daniel"],"propositions":[],"lastnames":["Binkele-Raible"],"suffixes":[]},{"firstnames":["Henning"],"propositions":[],"lastnames":["Fernau"],"suffixes":[]}],"title":"An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem","journal":"J. Discrete Algorithms","volume":"15","pages":"43–55","year":"2012","url":"https://doi.org/10.1016/j.jda.2012.03.006","doi":"10.1016/j.jda.2012.03.006","timestamp":"Sun, 28 May 2017 01:00:00 +0200","biburl":"https://dblp.org/rec/bib/journals/jda/Binkele-RaibleF12","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/jda/Binkele-RaibleF12,\n author = {Daniel Binkele{-}Raible and\n Henning Fernau},\n title = {An exact exponential-time algorithm for the Directed Maximum Leaf\n Spanning Tree problem},\n journal = {J. Discrete Algorithms},\n volume = {15},\n pages = {43--55},\n year = {2012},\n url = {https://doi.org/10.1016/j.jda.2012.03.006},\n doi = {10.1016/j.jda.2012.03.006},\n timestamp = {Sun, 28 May 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/jda/Binkele-RaibleF12},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Binkele-Raible, D.","Fernau, H."],"key":"DBLP:journals/jda/Binkele-RaibleF12","id":"DBLP:journals/jda/Binkele-RaibleF12","bibbaseid":"binkeleraible-fernau-anexactexponentialtimealgorithmforthedirectedmaximumleafspanningtreeproblem-2012","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.jda.2012.03.006"},"downloads":0},"search_terms":["exact","exponential","time","algorithm","directed","maximum","leaf","spanning","tree","problem","binkele-raible","fernau"],"keywords":[],"authorIDs":[],"dataSources":["TuA7fGR5JYLK4NXQn"]}