@inproceedings{DBLP:conf/soda/EppsteinE93,
  author    = {David Eppstein and
               Jeff Erickson},
  title     = {Iterated Nearest Neighbors and Finding Minimal Polytopes},
  booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 25-27 January 1993, Austin, Texas.},
  pages     = {64--73},
  year      = {1993},
  crossref  = {DBLP:conf/soda/1993},
  url       = {http://dl.acm.org/citation.cfm?id=313559.313612},
  timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/EppsteinE93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":{"_str":"529bab499eb585cc26000ef0"},"__v":0,"authorIDs":[],"author_short":["Eppstein, D.","Erickson, J."],"bibbaseid":"eppstein-erickson-iteratednearestneighborsandfindingminimalpolytopes-1993","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["David"],"propositions":[],"lastnames":["Eppstein"],"suffixes":[]},{"firstnames":["Jeff"],"propositions":[],"lastnames":["Erickson"],"suffixes":[]}],"title":"Iterated Nearest Neighbors and Finding Minimal Polytopes","booktitle":"Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas.","pages":"64--73","year":"1993","crossref":"DBLP:conf/soda/1993","url":"http://dl.acm.org/citation.cfm?id=313559.313612","timestamp":"Tue, 21 Nov 2017 00:00:00 +0100","biburl":"https://dblp.org/rec/bib/conf/soda/EppsteinE93","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/soda/EppsteinE93,\n author = {David Eppstein and\n Jeff Erickson},\n title = {Iterated Nearest Neighbors and Finding Minimal Polytopes},\n booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete\n Algorithms, 25-27 January 1993, Austin, Texas.},\n pages = {64--73},\n year = {1993},\n crossref = {DBLP:conf/soda/1993},\n url = {http://dl.acm.org/citation.cfm?id=313559.313612},\n timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},\n biburl = {https://dblp.org/rec/bib/conf/soda/EppsteinE93},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Eppstein, D.","Erickson, J."],"key":"DBLP:conf/soda/EppsteinE93","id":"DBLP:conf/soda/EppsteinE93","bibbaseid":"eppstein-erickson-iteratednearestneighborsandfindingminimalpolytopes-1993","role":"author","urls":{"Paper":"http://dl.acm.org/citation.cfm?id=313559.313612"},"downloads":0},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/e/JeffErickson.bib","downloads":0,"search_terms":["iterated","nearest","neighbors","finding","minimal","polytopes","eppstein","erickson"],"title":"Iterated Nearest Neighbors and Finding Minimal Polytopes","year":1993,"keywords":[],"dataSources":["B2t5ThadzZEEe7GQd"]}