@ARTICLE{NardelliPW2003Ja,
  author = {E. Nardelli and G. Proietti and P. Widmayer},
  title = {{F}inding the {M}ost {V}ital {N}ode of a {S}hortest {P}ath.},
  journal = {Theoretical Computer Science},
  year = {2003},
  volume = {296, No. 1},
  pages = {167-177}
}

{"_id":"SLDozdXyJLTPWdCFy","bibbaseid":"nardelli-proietti-widmayer-findingthemostvitalnodeofashortestpath-2003","author_short":["Nardelli, E.","Proietti, G.","Widmayer, P."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["E."],"propositions":[],"lastnames":["Nardelli"],"suffixes":[]},{"firstnames":["G."],"propositions":[],"lastnames":["Proietti"],"suffixes":[]},{"firstnames":["P."],"propositions":[],"lastnames":["Widmayer"],"suffixes":[]}],"title":"Finding the Most Vital Node of a Shortest Path.","journal":"Theoretical Computer Science","year":"2003","volume":"296, No. 1","pages":"167-177","bibtex":"@ARTICLE{NardelliPW2003Ja,\n author = {E. Nardelli and G. Proietti and P. Widmayer},\n title = {{F}inding the {M}ost {V}ital {N}ode of a {S}hortest {P}ath.},\n journal = {Theoretical Computer Science},\n year = {2003},\n volume = {296, No. 1},\n pages = {167-177}\n}\n\n","author_short":["Nardelli, E.","Proietti, G.","Widmayer, P."],"key":"NardelliPW2003Ja","id":"NardelliPW2003Ja","bibbaseid":"nardelli-proietti-widmayer-findingthemostvitalnodeofashortestpath-2003","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://polybox.ethz.ch/index.php/s/wa4X7mAfU4Cgo3p/download","dataSources":["R7QLFCx79AQPLx6QS"],"keywords":[],"search_terms":["finding","vital","node","shortest","path","nardelli","proietti","widmayer"],"title":"Finding the Most Vital Node of a Shortest Path.","year":2003}