%0 Journal Article %1 journals/algorithmica/JohnsonPP20 %A Johnson, Matthew %A Paesani, Giacomo %A Paulusma, Daniël %D 2020 %J Algorithmica %K dblp %N 1 %P 20-40 %T Connected Vertex Cover for (sP1+P5)-Free Graphs. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica82.html#JohnsonPP20 %V 82

@article{journals/algorithmica/JohnsonPP20, added-at = {2020-06-16T00:00:00.000+0200}, author = {Johnson, Matthew and Paesani, Giacomo and Paulusma, Daniël}, biburl = {https://www.bibsonomy.org/bibtex/27ca62aa1a99dfc50a17830d675480789/dblp}, ee = {https://doi.org/10.1007/s00453-019-00601-9}, interhash = {31c0d17121432d2880a40e476f1d32b3}, intrahash = {7ca62aa1a99dfc50a17830d675480789}, journal = {Algorithmica}, keywords = {dblp}, number = 1, pages = {20-40}, timestamp = {2020-06-17T11:45:04.000+0200}, title = {Connected Vertex Cover for (sP1+P5)-Free Graphs.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica82.html#JohnsonPP20}, volume = 82, year = 2020 }