@inproceedings{conf/foci/Ombuki-BermanV07,
  added-at = {2017-05-17T00:00:00.000+0200},
  author = {Ombuki-Berman, Beatrice M. and Ventresca, Mario},
  biburl = {https://www.bibsonomy.org/bibtex/28a7a373f09cd9a8fc858951763c75310/dblp},
  booktitle = {FOCI},
  crossref = {conf/foci/2007},
  ee = {https://doi.org/10.1109/FOCI.2007.372179},
  interhash = {ce49b8b5b6f3887e0d141d132c740ac9},
  intrahash = {8a7a373f09cd9a8fc858951763c75310},
  isbn = {1-4244-0703-6},
  keywords = {dblp},
  pages = {267-274},
  publisher = {IEEE},
  timestamp = {2019-10-17T22:12:27.000+0200},
  title = {Search Difficulty of Two-Connected Ring-based Topological Network Designs.},
  url = {http://dblp.uni-trier.de/db/conf/foci/foci2007.html#Ombuki-BermanV07},
  year = 2007
}

{"_id":"eDi8EeZAvRoyz4Mqf","bibbaseid":"ombukiberman-ventresca-searchdifficultyoftwoconnectedringbasedtopologicalnetworkdesigns-2007","author_short":["Ombuki-Berman, B. M.","Ventresca, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-17T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Ombuki-Berman"],"firstnames":["Beatrice","M."],"suffixes":[]},{"propositions":[],"lastnames":["Ventresca"],"firstnames":["Mario"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/28a7a373f09cd9a8fc858951763c75310/dblp","booktitle":"FOCI","crossref":"conf/foci/2007","ee":"https://doi.org/10.1109/FOCI.2007.372179","interhash":"ce49b8b5b6f3887e0d141d132c740ac9","intrahash":"8a7a373f09cd9a8fc858951763c75310","isbn":"1-4244-0703-6","keywords":"dblp","pages":"267-274","publisher":"IEEE","timestamp":"2019-10-17T22:12:27.000+0200","title":"Search Difficulty of Two-Connected Ring-based Topological Network Designs.","url":"http://dblp.uni-trier.de/db/conf/foci/foci2007.html#Ombuki-BermanV07","year":"2007","bibtex":"@inproceedings{conf/foci/Ombuki-BermanV07,\n added-at = {2017-05-17T00:00:00.000+0200},\n author = {Ombuki-Berman, Beatrice M. and Ventresca, Mario},\n biburl = {https://www.bibsonomy.org/bibtex/28a7a373f09cd9a8fc858951763c75310/dblp},\n booktitle = {FOCI},\n crossref = {conf/foci/2007},\n ee = {https://doi.org/10.1109/FOCI.2007.372179},\n interhash = {ce49b8b5b6f3887e0d141d132c740ac9},\n intrahash = {8a7a373f09cd9a8fc858951763c75310},\n isbn = {1-4244-0703-6},\n keywords = {dblp},\n pages = {267-274},\n publisher = {IEEE},\n timestamp = {2019-10-17T22:12:27.000+0200},\n title = {Search Difficulty of Two-Connected Ring-based Topological Network Designs.},\n url = {http://dblp.uni-trier.de/db/conf/foci/foci2007.html#Ombuki-BermanV07},\n year = 2007\n}\n\n","author_short":["Ombuki-Berman, B. M.","Ventresca, M."],"key":"conf/foci/Ombuki-BermanV07","id":"conf/foci/Ombuki-BermanV07","bibbaseid":"ombukiberman-ventresca-searchdifficultyoftwoconnectedringbasedtopologicalnetworkdesigns-2007","role":"author","urls":{"Link":"https://doi.org/10.1109/FOCI.2007.372179","Paper":"http://dblp.uni-trier.de/db/conf/foci/foci2007.html#Ombuki-BermanV07"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/mario ventresca?items=1000","dataSources":["RLFDMZMWW7Ps5vpgQ","Ck8iJJ5zmAj377iYj","aABj84ppQaei4P3aS"],"keywords":["dblp"],"search_terms":["search","difficulty","two","connected","ring","based","topological","network","designs","ombuki-berman","ventresca"],"title":"Search Difficulty of Two-Connected Ring-based Topological Network Designs.","year":2007}