%0 Conference Paper %1 conf/iwoca/GolovachHK15 %A Golovach, Petr A. %A Heggernes, Pinar %A Kratsch, Dieter %B IWOCA %D 2015 %E Lipták, Zsuzsanna %E Smyth, William F. %I Springer %K dblp %P 235-247 %T Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. %U http://dblp.uni-trier.de/db/conf/iwoca/iwoca2015.html#GolovachHK15 %V 9538 %@ 978-3-319-29515-2

@inproceedings{conf/iwoca/GolovachHK15, added-at = {2018-11-02T00:00:00.000+0100}, author = {Golovach, Petr A. and Heggernes, Pinar and Kratsch, Dieter}, biburl = {https://www.bibsonomy.org/bibtex/2bad00e8f24d03f45e5a7f9b619e78de1/dblp}, booktitle = {IWOCA}, crossref = {conf/iwoca/2015}, editor = {Lipták, Zsuzsanna and Smyth, William F.}, ee = {https://doi.org/10.1007/978-3-319-29516-9_20}, interhash = {a4b26f14f1ed17984bc33701b9bfec4b}, intrahash = {bad00e8f24d03f45e5a7f9b619e78de1}, isbn = {978-3-319-29515-2}, keywords = {dblp}, pages = {235-247}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T12:54:13.000+0200}, title = {Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs.}, url = {http://dblp.uni-trier.de/db/conf/iwoca/iwoca2015.html#GolovachHK15}, volume = 9538, year = 2015 }