BibTeX record conf/cocoon/NardelliPW01

download as .bib file

@inproceedings{DBLP:conf/cocoon/NardelliPW01,
  author       = {Enrico Nardelli and
                  Guido Proietti and
                  Peter Widmayer},
  editor       = {Jie Wang},
  title        = {Finding the Most Vital Node of a Shortest Path},
  booktitle    = {Computing and Combinatorics, 7th Annual International Conference,
                  {COCOON} 2001, Guilin, China, August 20-23, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2108},
  pages        = {278--287},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-44679-6\_31},
  doi          = {10.1007/3-540-44679-6\_31},
  timestamp    = {Thu, 23 Jun 2022 19:56:48 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/NardelliPW01.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.