%0 Conference Paper %1 conf/icalp/GolovachHKV13 %A Golovach, Petr A. %A Heggernes, Pinar %A Kratsch, Dieter %A Villanger, Yngve %B ICALP (1) %D 2013 %E Fomin, Fedor V. %E Freivalds, Rusins %E Kwiatkowska, Marta Z. %E Peleg, David %I Springer %K dblp %P 485-496 %T An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. %U http://dblp.uni-trier.de/db/conf/icalp/icalp2013-1.html#GolovachHKV13 %V 7965 %@ 978-3-642-39205-4

@inproceedings{conf/icalp/GolovachHKV13, added-at = {2018-11-02T00:00:00.000+0100}, author = {Golovach, Petr A. and Heggernes, Pinar and Kratsch, Dieter and Villanger, Yngve}, biburl = {https://www.bibsonomy.org/bibtex/29e5821f0b4159f5b4bca964ef52f2d66/dblp}, booktitle = {ICALP (1)}, crossref = {conf/icalp/2013-1}, editor = {Fomin, Fedor V. and Freivalds, Rusins and Kwiatkowska, Marta Z. and Peleg, David}, ee = {https://doi.org/10.1007/978-3-642-39206-1_41}, interhash = {9d40551a6f5c425f28cb0ec78864d54d}, intrahash = {9e5821f0b4159f5b4bca964ef52f2d66}, isbn = {978-3-642-39205-4}, keywords = {dblp}, pages = {485-496}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T16:28:06.000+0200}, title = {An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets.}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2013-1.html#GolovachHKV13}, volume = 7965, year = 2013 }