Improved Complexity for Power Edge Set Problem. Darties, B., Chateau, A., Giroudeau, R., & Weller, M. In Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers, pages 128–141, 2017.
Paper doi bibtex @inproceedings{DBLP:conf/iwoca/DartiesCGW17,
author = {Beno{\^{\i}}t Darties and
Annie Chateau and
Rodolphe Giroudeau and
Mathias Weller},
title = {Improved Complexity for Power Edge Set Problem},
booktitle = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017,
Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers},
pages = {128--141},
year = {2017},
crossref = {DBLP:conf/iwoca/2017},
url = {https://doi.org/10.1007/978-3-319-78825-8\_11},
doi = {10.1007/978-3-319-78825-8\_11},
timestamp = {Sun, 06 Oct 2024 21:10:18 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/DartiesCGW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"M76P2boW4EtSqpwAp","bibbaseid":"darties-chateau-giroudeau-weller-improvedcomplexityforpoweredgesetproblem-2017","downloads":0,"creationDate":"2018-04-20T13:38:57.462Z","title":"Improved Complexity for Power Edge Set Problem","author_short":["Darties, B.","Chateau, A.","Giroudeau, R.","Weller, M."],"year":2017,"bibtype":"inproceedings","biburl":"http://dblp.org/pers/tb2/w/Weller:Mathias","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Benoît"],"propositions":[],"lastnames":["Darties"],"suffixes":[]},{"firstnames":["Annie"],"propositions":[],"lastnames":["Chateau"],"suffixes":[]},{"firstnames":["Rodolphe"],"propositions":[],"lastnames":["Giroudeau"],"suffixes":[]},{"firstnames":["Mathias"],"propositions":[],"lastnames":["Weller"],"suffixes":[]}],"title":"Improved Complexity for Power Edge Set Problem","booktitle":"Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers","pages":"128–141","year":"2017","crossref":"DBLP:conf/iwoca/2017","url":"https://doi.org/10.1007/978-3-319-78825-8\\_11","doi":"10.1007/978-3-319-78825-8_11","timestamp":"Sun, 06 Oct 2024 21:10:18 +0200","biburl":"https://dblp.org/rec/conf/iwoca/DartiesCGW17.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/iwoca/DartiesCGW17,\n author = {Beno{\\^{\\i}}t Darties and\n Annie Chateau and\n Rodolphe Giroudeau and\n Mathias Weller},\n title = {Improved Complexity for Power Edge Set Problem},\n booktitle = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017,\n Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers},\n pages = {128--141},\n year = {2017},\n crossref = {DBLP:conf/iwoca/2017},\n url = {https://doi.org/10.1007/978-3-319-78825-8\\_11},\n doi = {10.1007/978-3-319-78825-8\\_11},\n timestamp = {Sun, 06 Oct 2024 21:10:18 +0200},\n biburl = {https://dblp.org/rec/conf/iwoca/DartiesCGW17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Darties, B.","Chateau, A.","Giroudeau, R.","Weller, M."],"key":"DBLP:conf/iwoca/DartiesCGW17","id":"DBLP:conf/iwoca/DartiesCGW17","bibbaseid":"darties-chateau-giroudeau-weller-improvedcomplexityforpoweredgesetproblem-2017","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-319-78825-8\\_11"},"metadata":{"authorlinks":{"weller, m":"https://bibbase.org/show?bib=http%3A%2F%2Fdblp.dagstuhl.de%2Fpers%2Ftb0%2Fw%2FWeller%3AMathias.bib"}},"downloads":0},"search_terms":["improved","complexity","power","edge","set","problem","darties","chateau","giroudeau","weller"],"keywords":[],"authorIDs":["TGu5DA8jtddSomh6L"],"dataSources":["S8v6dBTYDW8zRm2Zp","p4oCSPTRLiiykYZHi","L9AaFQgoMtch4ZW9P","fKjFRbHyQXXwLE4bx","aaPLt6wxd2uAJLqcN"]}