Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger. Finding large degree-anonymous subgraphs is hard. Theoretical Computer Science, 622:90-110, 2016. [doi]
@article{BazganBHNW16,
title = {Finding large degree-anonymous subgraphs is hard},
author = {Cristina Bazgan and Robert Bredereck and Sepp Hartung and André Nichterlein and Gerhard J. Woeginger},
year = {2016},
doi = {10.1016/j.tcs.2016.02.004},
url = {http://dx.doi.org/10.1016/j.tcs.2016.02.004},
researchr = {https://researchr.org/publication/BazganBHNW16},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {622},
pages = {90-110},
}