%0 Conference Paper %1 conf/wg/BellittoB18 %A Bellitto, Thomas %A Bergougnoux, Benjamin %B WG %D 2018 %E Brandstädt, Andreas %E Köhler, Ekkehard %E Meer, Klaus %I Springer %K dblp %P 40-51 %T On Minimum Connecting Transition Sets in Graphs. %U http://dblp.uni-trier.de/db/conf/wg/wg2018.html#BellittoB18 %V 11159 %@ 978-3-030-00256-5

@inproceedings{conf/wg/BellittoB18, added-at = {2018-09-03T00:00:00.000+0200}, author = {Bellitto, Thomas and Bergougnoux, Benjamin}, biburl = {https://www.bibsonomy.org/bibtex/2311499472013b8213b771124eba36c2e/dblp}, booktitle = {WG}, crossref = {conf/wg/2018}, editor = {Brandstädt, Andreas and Köhler, Ekkehard and Meer, Klaus}, ee = {https://doi.org/10.1007/978-3-030-00256-5_4}, interhash = {de598a02ebf2507bcdd7c1cd3f94ed3b}, intrahash = {311499472013b8213b771124eba36c2e}, isbn = {978-3-030-00256-5}, keywords = {dblp}, pages = {40-51}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:55:40.000+0200}, title = {On Minimum Connecting Transition Sets in Graphs.}, url = {http://dblp.uni-trier.de/db/conf/wg/wg2018.html#BellittoB18}, volume = 11159, year = 2018 }