BibTeX record conf/alenex/BergaminiBCMM16

download as .bib file

@inproceedings{DBLP:conf/alenex/BergaminiBCMM16,
  author    = {Elisabetta Bergamini and
               Michele Borassi and
               Pierluigi Crescenzi and
               Andrea Marino and
               Henning Meyerhenke},
  title     = {Computing Top-\emph{k} Closeness Centrality Faster in Unweighted Graphs},
  booktitle = {Proceedings of the Eighteenth Workshop on Algorithm Engineering and
               Experiments, {ALENEX} 2016, Arlington, Virginia, USA, January 10,
               2016},
  pages     = {68--80},
  year      = {2016},
  crossref  = {DBLP:conf/alenex/2016},
  url       = {https://doi.org/10.1137/1.9781611974317.6},
  doi       = {10.1137/1.9781611974317.6},
  timestamp = {Fri, 19 May 2017 01:26:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/alenex/BergaminiBCMM16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2016,
  editor    = {Michael T. Goodrich and
               Michael Mitzenmacher},
  title     = {Proceedings of the Eighteenth Workshop on Algorithm Engineering and
               Experiments, {ALENEX} 2016, Arlington, Virginia, USA, January 10,
               2016},
  publisher = {{SIAM}},
  year      = {2016},
  url       = {https://doi.org/10.1137/1.9781611974317},
  doi       = {10.1137/1.9781611974317},
  isbn      = {978-1-61197-431-7},
  timestamp = {Fri, 19 May 2017 01:26:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/alenex/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics