BibTeX record journals/iandc/HartungNNS15

download as .bib file

@article{DBLP:journals/iandc/HartungNNS15,
  author       = {Sepp Hartung and
                  Andr{\'{e}} Nichterlein and
                  Rolf Niedermeier and
                  Ondrej Such{\'{y}}},
  title        = {A refined complexity analysis of degree anonymization in graphs},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {249--262},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.017},
  doi          = {10.1016/J.IC.2014.12.017},
  timestamp    = {Fri, 12 Feb 2021 22:15:57 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/HartungNNS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.