@article{journals/networks/KleinKRR04,
  added-at = {2015-08-31T00:00:00.000+0200},
  author = {Klein, Philip N. and Krishnan, Radha and Raghavachari, Balaji and Ravi, R.},
  biburl = {http://www.bibsonomy.org/bibtex/29a343f3c1b7c7430ca4c449c6817a168/dblp},
  ee = {http://dx.doi.org/10.1002/net.20031},
  interhash = {9c02832b6837cbe35a8eff7432ebbea3},
  intrahash = {9a343f3c1b7c7430ca4c449c6817a168},
  journal = {Networks},
  keywords = {dblp},
  number = 3,
  pages = {203-215},
  timestamp = {2015-09-01T11:33:44.000+0200},
  title = {Approximation algorithms for finding low-degree subgraphs.},
  url = {http://dblp.uni-trier.de/db/journals/networks/networks44.html#KleinKRR04},
  volume = 44,
  year = 2004
}

{"_id":"AoAM6hEG5yP9c5p8b","bibbaseid":"klein-krishnan-raghavachari-ravi-approximationalgorithmsforfindinglowdegreesubgraphs-2004","downloads":0,"creationDate":"2016-10-11T08:28:53.539Z","title":"Approximation algorithms for finding low-degree subgraphs.","author_short":["Klein, P. N.","Krishnan, R.","Raghavachari, B.","Ravi, R."],"year":2004,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/krishnan?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2015-08-31T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Klein"],"firstnames":["Philip","N."],"suffixes":[]},{"propositions":[],"lastnames":["Krishnan"],"firstnames":["Radha"],"suffixes":[]},{"propositions":[],"lastnames":["Raghavachari"],"firstnames":["Balaji"],"suffixes":[]},{"propositions":[],"lastnames":["Ravi"],"firstnames":["R."],"suffixes":[]}],"biburl":"http://www.bibsonomy.org/bibtex/29a343f3c1b7c7430ca4c449c6817a168/dblp","ee":"http://dx.doi.org/10.1002/net.20031","interhash":"9c02832b6837cbe35a8eff7432ebbea3","intrahash":"9a343f3c1b7c7430ca4c449c6817a168","journal":"Networks","keywords":"dblp","number":"3","pages":"203-215","timestamp":"2015-09-01T11:33:44.000+0200","title":"Approximation algorithms for finding low-degree subgraphs.","url":"http://dblp.uni-trier.de/db/journals/networks/networks44.html#KleinKRR04","volume":"44","year":"2004","bibtex":"@article{journals/networks/KleinKRR04,\n added-at = {2015-08-31T00:00:00.000+0200},\n author = {Klein, Philip N. and Krishnan, Radha and Raghavachari, Balaji and Ravi, R.},\n biburl = {http://www.bibsonomy.org/bibtex/29a343f3c1b7c7430ca4c449c6817a168/dblp},\n ee = {http://dx.doi.org/10.1002/net.20031},\n interhash = {9c02832b6837cbe35a8eff7432ebbea3},\n intrahash = {9a343f3c1b7c7430ca4c449c6817a168},\n journal = {Networks},\n keywords = {dblp},\n number = 3,\n pages = {203-215},\n timestamp = {2015-09-01T11:33:44.000+0200},\n title = {Approximation algorithms for finding low-degree subgraphs.},\n url = {http://dblp.uni-trier.de/db/journals/networks/networks44.html#KleinKRR04},\n volume = 44,\n year = 2004\n}\n\n","author_short":["Klein, P. N.","Krishnan, R.","Raghavachari, B.","Ravi, R."],"key":"journals/networks/KleinKRR04","id":"journals/networks/KleinKRR04","bibbaseid":"klein-krishnan-raghavachari-ravi-approximationalgorithmsforfindinglowdegreesubgraphs-2004","role":"author","urls":{"Link":"http://dx.doi.org/10.1002/net.20031","Paper":"http://dblp.uni-trier.de/db/journals/networks/networks44.html#KleinKRR04"},"keyword":["dblp"],"downloads":0},"search_terms":["approximation","algorithms","finding","low","degree","subgraphs","klein","krishnan","raghavachari","ravi"],"keywords":["dblp"],"authorIDs":[],"dataSources":["xsmEhpcqYQxeyggwv"]}