@inproceedings{ Golovach2013a,
  address = {Riga, Latvia},
  author = {Golovach, PA and Heggernes, Pinar},
  booktitle = {ICALP 2013: the 40th International Colloquium on Automata, Languages, and Programming},
  doi = {10.1007/978-3-642-39206-1_41},
  editor = {Fomin, Fedor V. and Freivalds, Rūsiņš and Kwiatkowska, Marta and Peleg, David},
  file = {:Users/KunihiroWASA/Dropbox/paper/2013/Golovach, Heggernes, An incremental polynomial time algorithm to enumerate all minimal edge dominating sets, 2013.pdf:pdf},
  month = {July},
  pages = {485--496},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {{An incremental polynomial time algorithm to enumerate all minimal edge dominating sets}},
  url = {http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41},
  volume = {7965},
  year = {2013}
}

{"_id":"qG4RSbHAPiuWP8iAz","authorIDs":[],"author_short":["Golovach, P.","Heggernes, P."],"bibbaseid":"golovach-heggernes-anincrementalpolynomialtimealgorithmtoenumerateallminimaledgedominatingsets-2013","bibdata":{"address":"Riga, Latvia","author":["Golovach, PA","Heggernes, Pinar"],"author_short":["Golovach, P.","Heggernes, P."],"bibtex":"@inproceedings{ Golovach2013a,\n address = {Riga, Latvia},\n author = {Golovach, PA and Heggernes, Pinar},\n booktitle = {ICALP 2013: the 40th International Colloquium on Automata, Languages, and Programming},\n doi = {10.1007/978-3-642-39206-1_41},\n editor = {Fomin, Fedor V. and Freivalds, Rūsiņš and Kwiatkowska, Marta and Peleg, David},\n file = {:Users/KunihiroWASA/Dropbox/paper/2013/Golovach, Heggernes, An incremental polynomial time algorithm to enumerate all minimal edge dominating sets, 2013.pdf:pdf},\n month = {July},\n pages = {485--496},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science},\n title = {{An incremental polynomial time algorithm to enumerate all minimal edge dominating sets}},\n url = {http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41},\n volume = {7965},\n year = {2013}\n}","bibtype":"inproceedings","booktitle":"ICALP 2013: the 40th International Colloquium on Automata, Languages, and Programming","doi":"10.1007/978-3-642-39206-1_41","editor":["Fomin, Fedor V.","Freivalds, Rūsiņš","Kwiatkowska, Marta","Peleg, David"],"editor_short":["Fomin, F.<nbsp>V.","Freivalds, R.","Kwiatkowska, M.","Peleg, D."],"file":":Users/KunihiroWASA/Dropbox/paper/2013/Golovach, Heggernes, An incremental polynomial time algorithm to enumerate all minimal edge dominating sets, 2013.pdf:pdf","id":"Golovach2013a","key":"Golovach2013a","month":"July","pages":"485--496","publisher":"Springer Berlin Heidelberg","series":"Lecture Notes in Computer Science","title":"An incremental polynomial time algorithm to enumerate all minimal edge dominating sets","type":"inproceedings","url":"http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41","volume":"7965","year":"2013","bibbaseid":"golovach-heggernes-anincrementalpolynomialtimealgorithmtoenumerateallminimaledgedominatingsets-2013","role":"author","urls":{"Paper":"http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41"},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:44.109Z","downloads":0,"keywords":[],"search_terms":["incremental","polynomial","time","algorithm","enumerate","minimal","edge","dominating","sets","golovach","heggernes"],"title":"An incremental polynomial time algorithm to enumerate all minimal edge dominating sets","year":2013,"dataSources":["YRMeqhMHoNu9HzJoC"]}