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]
Abstract is missing.