@inproceedings{conf/mfcs/BravermanLSVY15,
  added-at = {2017-05-25T00:00:00.000+0200},
  author = {Braverman, Vladimir and Liu, Zaoxing and Singh, Tejasvam and Vinodchandran, N. V. and Yang, Lin F.},
  biburl = {https://www.bibsonomy.org/bibtex/2e551b8c152456c9724dcf3732e161d28/dblp},
  booktitle = {MFCS (2)},
  crossref = {conf/mfcs/2015-2},
  editor = {Italiano, Giuseppe F. and Pighizzini, Giovanni and Sannella, Donald},
  ee = {https://doi.org/10.1007/978-3-662-48054-0_13},
  interhash = {c4f922ee925ae41b0fcf5d40cd102640},
  intrahash = {e551b8c152456c9724dcf3732e161d28},
  isbn = {978-3-662-48053-3},
  keywords = {dblp},
  pages = {151-162},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T18:11:44.000+0200},
  title = {New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory.},
  url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2015-2.html#BravermanLSVY15},
  volume = 9235,
  year = 2015
}

{"_id":"z7norHAs4Deh8c7Li","bibbaseid":"braverman-liu-singh-vinodchandran-yang-newboundsforthecliquegapproblemusinggraphdecompositiontheory-2015","authorIDs":[],"author_short":["Braverman, V.","Liu, Z.","Singh, T.","Vinodchandran, N. V.","Yang, L. F."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-25T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Braverman"],"firstnames":["Vladimir"],"suffixes":[]},{"propositions":[],"lastnames":["Liu"],"firstnames":["Zaoxing"],"suffixes":[]},{"propositions":[],"lastnames":["Singh"],"firstnames":["Tejasvam"],"suffixes":[]},{"propositions":[],"lastnames":["Vinodchandran"],"firstnames":["N.","V."],"suffixes":[]},{"propositions":[],"lastnames":["Yang"],"firstnames":["Lin","F."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2e551b8c152456c9724dcf3732e161d28/dblp","booktitle":"MFCS (2)","crossref":"conf/mfcs/2015-2","editor":[{"propositions":[],"lastnames":["Italiano"],"firstnames":["Giuseppe","F."],"suffixes":[]},{"propositions":[],"lastnames":["Pighizzini"],"firstnames":["Giovanni"],"suffixes":[]},{"propositions":[],"lastnames":["Sannella"],"firstnames":["Donald"],"suffixes":[]}],"ee":"https://doi.org/10.1007/978-3-662-48054-0_13","interhash":"c4f922ee925ae41b0fcf5d40cd102640","intrahash":"e551b8c152456c9724dcf3732e161d28","isbn":"978-3-662-48053-3","keywords":"dblp","pages":"151-162","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T18:11:44.000+0200","title":"New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory.","url":"http://dblp.uni-trier.de/db/conf/mfcs/mfcs2015-2.html#BravermanLSVY15","volume":"9235","year":"2015","bibtex":"@inproceedings{conf/mfcs/BravermanLSVY15,\n added-at = {2017-05-25T00:00:00.000+0200},\n author = {Braverman, Vladimir and Liu, Zaoxing and Singh, Tejasvam and Vinodchandran, N. V. and Yang, Lin F.},\n biburl = {https://www.bibsonomy.org/bibtex/2e551b8c152456c9724dcf3732e161d28/dblp},\n booktitle = {MFCS (2)},\n crossref = {conf/mfcs/2015-2},\n editor = {Italiano, Giuseppe F. and Pighizzini, Giovanni and Sannella, Donald},\n ee = {https://doi.org/10.1007/978-3-662-48054-0_13},\n interhash = {c4f922ee925ae41b0fcf5d40cd102640},\n intrahash = {e551b8c152456c9724dcf3732e161d28},\n isbn = {978-3-662-48053-3},\n keywords = {dblp},\n pages = {151-162},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T18:11:44.000+0200},\n title = {New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory.},\n url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2015-2.html#BravermanLSVY15},\n volume = 9235,\n year = 2015\n}\n\n","author_short":["Braverman, V.","Liu, Z.","Singh, T.","Vinodchandran, N. V.","Yang, L. F."],"editor_short":["Italiano, G. F.","Pighizzini, G.","Sannella, D."],"key":"conf/mfcs/BravermanLSVY15","id":"conf/mfcs/BravermanLSVY15","bibbaseid":"braverman-liu-singh-vinodchandran-yang-newboundsforthecliquegapproblemusinggraphdecompositiontheory-2015","role":"author","urls":{"Link":"https://doi.org/10.1007/978-3-662-48054-0_13","Paper":"http://dblp.uni-trier.de/db/conf/mfcs/mfcs2015-2.html#BravermanLSVY15"},"keyword":["dblp"],"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/yang lin?items=1000","creationDate":"2019-08-22T03:53:53.905Z","downloads":0,"keywords":["dblp"],"search_terms":["new","bounds","clique","gap","problem","using","graph","decomposition","theory","braverman","liu","singh","vinodchandran","yang"],"title":"New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory.","year":2015,"dataSources":["a57oXwvfTysj8WtNo"]}