Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý. A refined complexity analysis of degree anonymization in graphs. Inf. Comput., 243:249-262, 2015. [doi]
@article{HartungNNS15,
title = {A refined complexity analysis of degree anonymization in graphs},
author = {Sepp Hartung and André Nichterlein and Rolf Niedermeier and Ondrej Suchý},
year = {2015},
doi = {10.1016/j.ic.2014.12.017},
url = {http://dx.doi.org/10.1016/j.ic.2014.12.017},
researchr = {https://researchr.org/publication/HartungNNS15},
cites = {0},
citedby = {0},
journal = {Inf. Comput.},
volume = {243},
pages = {249-262},
}