External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

A Refined Complexity Analysis of Degree Anonymization in Graphs

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]

Authors

Sepp Hartung

This author has not been identified. Look up 'Sepp Hartung' in Google

André Nichterlein

This author has not been identified. Look up 'André Nichterlein' in Google

Rolf Niedermeier

This author has not been identified. Look up 'Rolf Niedermeier' in Google

Ondrej Suchý

This author has not been identified. Look up 'Ondrej Suchý' in Google
runs on