@article{journals/cor/VentrescaA14,
  added-at = {2020-02-18T00:00:00.000+0100},
  author = {Ventresca, Mario and Aleman, Dionne M.},
  biburl = {https://www.bibsonomy.org/bibtex/211c2e9abcb9081b70645b4dafde19eb9/dblp},
  ee = {https://doi.org/10.1016/j.cor.2013.09.012},
  interhash = {a38178f41094aeb4e9853aef724395df},
  intrahash = {11c2e9abcb9081b70645b4dafde19eb9},
  journal = {Comput. Oper. Res.},
  keywords = {dblp},
  pages = {261-270},
  timestamp = {2020-02-19T11:48:07.000+0100},
  title = {A derandomized approximation algorithm for the critical node detection problem.},
  url = {http://dblp.uni-trier.de/db/journals/cor/cor43.html#VentrescaA14},
  volume = 43,
  year = 2014
}

{"_id":"HBoo3PBw5MsgP2YcM","bibbaseid":"ventresca-aleman-aderandomizedapproximationalgorithmforthecriticalnodedetectionproblem-2014","author_short":["Ventresca, M.","Aleman, D. M."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-02-18T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Ventresca"],"firstnames":["Mario"],"suffixes":[]},{"propositions":[],"lastnames":["Aleman"],"firstnames":["Dionne","M."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/211c2e9abcb9081b70645b4dafde19eb9/dblp","ee":"https://doi.org/10.1016/j.cor.2013.09.012","interhash":"a38178f41094aeb4e9853aef724395df","intrahash":"11c2e9abcb9081b70645b4dafde19eb9","journal":"Comput. Oper. Res.","keywords":"dblp","pages":"261-270","timestamp":"2020-02-19T11:48:07.000+0100","title":"A derandomized approximation algorithm for the critical node detection problem.","url":"http://dblp.uni-trier.de/db/journals/cor/cor43.html#VentrescaA14","volume":"43","year":"2014","bibtex":"@article{journals/cor/VentrescaA14,\n added-at = {2020-02-18T00:00:00.000+0100},\n author = {Ventresca, Mario and Aleman, Dionne M.},\n biburl = {https://www.bibsonomy.org/bibtex/211c2e9abcb9081b70645b4dafde19eb9/dblp},\n ee = {https://doi.org/10.1016/j.cor.2013.09.012},\n interhash = {a38178f41094aeb4e9853aef724395df},\n intrahash = {11c2e9abcb9081b70645b4dafde19eb9},\n journal = {Comput. Oper. Res.},\n keywords = {dblp},\n pages = {261-270},\n timestamp = {2020-02-19T11:48:07.000+0100},\n title = {A derandomized approximation algorithm for the critical node detection problem.},\n url = {http://dblp.uni-trier.de/db/journals/cor/cor43.html#VentrescaA14},\n volume = 43,\n year = 2014\n}\n\n","author_short":["Ventresca, M.","Aleman, D. M."],"key":"journals/cor/VentrescaA14","id":"journals/cor/VentrescaA14","bibbaseid":"ventresca-aleman-aderandomizedapproximationalgorithmforthecriticalnodedetectionproblem-2014","role":"author","urls":{"Link":"https://doi.org/10.1016/j.cor.2013.09.012","Paper":"http://dblp.uni-trier.de/db/journals/cor/cor43.html#VentrescaA14"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/mario%20ventresca?items=1000","dataSources":["RLFDMZMWW7Ps5vpgQ","Ck8iJJ5zmAj377iYj","aABj84ppQaei4P3aS"],"keywords":["dblp"],"search_terms":["derandomized","approximation","algorithm","critical","node","detection","problem","ventresca","aleman"],"title":"A derandomized approximation algorithm for the critical node detection problem.","year":2014}