@inproceedings{ conf/approx/DaniMO12,
  added-at = {2012-08-12T00:00:00.000+0200},
  author = {Dani, Varsha and Moore, Cristopher and Olson, Anna},
  biburl = {http://www.bibsonomy.org/bibtex/2067171c6c53f42f7f9fbac752ed73a73/dblp},
  booktitle = {APPROX-RANDOM},
  crossref = {conf/approx/2012},
  editor = {Gupta, Anupam and Jansen, Klaus and Rolim, José D. P. and Servedio, Rocco A.},
  ee = {http://dx.doi.org/10.1007/978-3-642-32512-0_43},
  interhash = {91e26e21a59759d031bd99f2ebae94c9},
  intrahash = {067171c6c53f42f7f9fbac752ed73a73},
  isbn = {978-3-642-32511-3},
  keywords = {dblp},
  pages = {505-516},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Tight Bounds on the Threshold for Permuted k-Colorability.},
  url = {http://dblp.uni-trier.de/db/conf/approx/approx2012.html#DaniMO12},
  volume = {7408},
  year = {2012}
}

{"_id":"KX8AD5pBbCWzYpQ5q","bibbaseid":"dani-moore-olson-tightboundsonthethresholdforpermutedkcolorability-2012","downloads":0,"creationDate":"2015-03-12T16:55:36.673Z","title":"Tight Bounds on the Threshold for Permuted k-Colorability.","author_short":["Dani, V.","Moore, C.","Olson, A."],"year":2012,"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/moore?items=1000","bibdata":{"added-at":"2012-08-12T00:00:00.000+0200","author":["Dani, Varsha","Moore, Cristopher","Olson, Anna"],"author_short":["Dani, V.","Moore, C.","Olson, A."],"bibtex":"@inproceedings{ conf/approx/DaniMO12,\n added-at = {2012-08-12T00:00:00.000+0200},\n author = {Dani, Varsha and Moore, Cristopher and Olson, Anna},\n biburl = {http://www.bibsonomy.org/bibtex/2067171c6c53f42f7f9fbac752ed73a73/dblp},\n booktitle = {APPROX-RANDOM},\n crossref = {conf/approx/2012},\n editor = {Gupta, Anupam and Jansen, Klaus and Rolim, José D. P. and Servedio, Rocco A.},\n ee = {http://dx.doi.org/10.1007/978-3-642-32512-0_43},\n interhash = {91e26e21a59759d031bd99f2ebae94c9},\n intrahash = {067171c6c53f42f7f9fbac752ed73a73},\n isbn = {978-3-642-32511-3},\n keywords = {dblp},\n pages = {505-516},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n title = {Tight Bounds on the Threshold for Permuted k-Colorability.},\n url = {http://dblp.uni-trier.de/db/conf/approx/approx2012.html#DaniMO12},\n volume = {7408},\n year = {2012}\n}","bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bibtex/2067171c6c53f42f7f9fbac752ed73a73/dblp","booktitle":"APPROX-RANDOM","crossref":"conf/approx/2012","editor":["Gupta, Anupam","Jansen, Klaus","Rolim, José D. P.","Servedio, Rocco A."],"editor_short":["Gupta, A.","Jansen, K.","Rolim, J.<nbsp>D.<nbsp>P.","Servedio, R.<nbsp>A."],"ee":"http://dx.doi.org/10.1007/978-3-642-32512-0_43","id":"conf/approx/DaniMO12","interhash":"91e26e21a59759d031bd99f2ebae94c9","intrahash":"067171c6c53f42f7f9fbac752ed73a73","isbn":"978-3-642-32511-3","key":"conf/approx/DaniMO12","keywords":"dblp","pages":"505-516","publisher":"Springer","series":"Lecture Notes in Computer Science","title":"Tight Bounds on the Threshold for Permuted k-Colorability.","type":"inproceedings","url":"http://dblp.uni-trier.de/db/conf/approx/approx2012.html#DaniMO12","volume":"7408","year":"2012","bibbaseid":"dani-moore-olson-tightboundsonthethresholdforpermutedkcolorability-2012","role":"author","urls":{"Link":"http://dx.doi.org/10.1007/978-3-642-32512-0_43","Paper":"http://dblp.uni-trier.de/db/conf/approx/approx2012.html#DaniMO12"},"keyword":["dblp"],"downloads":0},"search_terms":["tight","bounds","threshold","permuted","colorability","dani","moore","olson"],"keywords":["dblp"],"authorIDs":[],"dataSources":["CNaPQFuj8cuTCPAK7"]}