Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý. A Refined Complexity Analysis of Degree Anonymization in Graphs. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Volume 7966 of Lecture Notes in Computer Science, pages 594-606, Springer, 2013. [doi]
@inproceedings{HartungNNS13,
title = {A Refined Complexity Analysis of Degree Anonymization in Graphs},
author = {Sepp Hartung and André Nichterlein and Rolf Niedermeier and Ondrej Suchý},
year = {2013},
doi = {10.1007/978-3-642-39212-2_52},
url = {http://dx.doi.org/10.1007/978-3-642-39212-2_52},
researchr = {https://researchr.org/publication/HartungNNS13},
cites = {0},
citedby = {0},
pages = {594-606},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II},
editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg},
volume = {7966},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-39211-5},
}