@inproceedings{ dblp3398339,
  title = {A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane},
  author = {Kasturi R. Varadarajan},
  author_short = {Varadarajan, K. R.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {1998},
  key = {dblp3398339},
  id = {dblp3398339},
  biburl = {http://www.dblp.org/rec/bibtex/conf/focs/Varadarajan98},
  url = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743466},
  conference = {FOCS},
  pages = {320-331},
  text = {FOCS 1998:320-331},
  booktitle = {Proceedings of Foundations of Computer Science (FOCS)}
}

{"_id":{"_str":"529bbc0f9eb585cc26000faa"},"__v":0,"authorIDs":[],"author_short":["Varadarajan, K. R."],"bibbaseid":"varadarajan-adivideandconqueralgorithmformincostperfectmatchingintheplane-1998","bibdata":{"html":"<div class=\"bibbase_paper\"> \n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"dblp3398339\"> </a>A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane.</span>\n\t<span class=\"bibbase_paper_author\">\nVaradarajan, K. R.</span>\n\t<!-- <span class=\"bibbase_paper_year\">1998</span>. -->\n</span>\n\n\n\nIn\n<i>Proceedings of Foundations of Computer Science (FOCS)</i>, page 320-331, 1998.\n\n\n\n\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n <!-- <i -->\n <!-- onclick=\"javascript:log_download('varadarajan-adivideandconqueralgorithmformincostperfectmatchingintheplane-1998', 'http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743466')\">DEBUG -->\n <!-- </i> -->\n\n <a href=\"http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743466\"\n onclick=\"javascript:log_download('varadarajan-adivideandconqueralgorithmformincostperfectmatchingintheplane-1998', 'http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743466')\">\n <img src=\"http://bibbase.org/img/filetypes/blank.png\"\n\t alt=\"A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane [.743466]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\" ><span class=\"bibbase_icon_text\">Paper</span></a> \n &nbsp;\n \n \n <a href=\"javascript:showBib('dblp3398339')\"\n class=\"bibbase link\">\n <!-- <img src=\"http://bibbase.org/img/filetypes/bib.png\" -->\n\t<!-- alt=\"A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane [bib]\" -->\n\t<!-- class=\"bibbase_icon\" -->\n\t<!-- style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\"><span class=\"bibbase_icon_text\">Bibtex</span> -->\n BibTeX\n <i class=\"fa fa-caret-down\"></i></a>\n \n \n \n \n\n \n \n \n</span>\n\n<div class=\"well well-small bibbase\" id=\"bib_dblp3398339\"\n style=\"display:none\">\n <pre>@inproceedings{ dblp3398339,\n title = {A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane},\n author = {Kasturi R. Varadarajan},\n author_short = {Varadarajan, K. R.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {1998},\n key = {dblp3398339},\n id = {dblp3398339},\n biburl = {http://www.dblp.org/rec/bibtex/conf/focs/Varadarajan98},\n url = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743466},\n conference = {FOCS},\n pages = {320-331},\n text = {FOCS 1998:320-331},\n booktitle = {Proceedings of Foundations of Computer Science (FOCS)}\n}</pre>\n</div>\n\n\n\n</div>\n","downloads":0,"bibbaseid":"varadarajan-adivideandconqueralgorithmformincostperfectmatchingintheplane-1998","urls":{"Paper":"http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743466"},"role":"author","bibtex":"@inproceedings{ dblp3398339,\n title = {A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane},\n author = {Kasturi R. Varadarajan},\n author_short = {Varadarajan, K. R.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {1998},\n key = {dblp3398339},\n id = {dblp3398339},\n biburl = {http://www.dblp.org/rec/bibtex/conf/focs/Varadarajan98},\n url = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743466},\n conference = {FOCS},\n pages = {320-331},\n text = {FOCS 1998:320-331},\n booktitle = {Proceedings of Foundations of Computer Science (FOCS)}\n}","booktitle":"Proceedings of Foundations of Computer Science (FOCS)","text":"FOCS 1998:320-331","pages":"320-331","conference":"FOCS","url":"http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743466","biburl":"http://www.dblp.org/rec/bibtex/conf/focs/Varadarajan98","id":"dblp3398339","key":"dblp3398339","year":"1998","type":"inproceedings","bibtype":"inproceedings","author_short":["Varadarajan, K. R."],"author":["Kasturi R. Varadarajan"],"title":"A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane"},"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/focs/Varadarajan98","downloads":0,"search_terms":["divide","conquer","algorithm","min","cost","perfect","matching","plane","varadarajan"],"title":"A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane","year":1998,"dataSources":["98W3oqGNjvqMYybaE"]}