@article{DBLP:journals/corr/BasavarajuMRS17,
  author    = {Manu Basavaraju and
               Pranabendu Misra and
               M. S. Ramanujan and
               Saket Saurabh},
  title     = {On finding highly connected spanning subgraphs},
  journal   = {CoRR},
  volume    = {abs/1701.02853},
  year      = {2017},
  url       = {http://arxiv.org/abs/1701.02853},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/BasavarajuMRS17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

{"_id":"GGh63CJTJTpppLphQ","bibbaseid":"basavaraju-misra-ramanujan-saurabh-onfindinghighlyconnectedspanningsubgraphs-2017","downloads":0,"creationDate":"2017-10-05T10:55:41.307Z","title":"On finding highly connected spanning subgraphs","author_short":["Basavaraju, M.","Misra, P.","Ramanujan, M. S.","Saurabh, S."],"year":2017,"bibtype":"article","biburl":"https://www2.warwick.ac.uk/fac/sci/dcs/people/ramanujan_sridharan/publications/ramanujan-m_s_2.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Manu"],"propositions":[],"lastnames":["Basavaraju"],"suffixes":[]},{"firstnames":["Pranabendu"],"propositions":[],"lastnames":["Misra"],"suffixes":[]},{"firstnames":["M.","S."],"propositions":[],"lastnames":["Ramanujan"],"suffixes":[]},{"firstnames":["Saket"],"propositions":[],"lastnames":["Saurabh"],"suffixes":[]}],"title":"On finding highly connected spanning subgraphs","journal":"CoRR","volume":"abs/1701.02853","year":"2017","url":"http://arxiv.org/abs/1701.02853","timestamp":"Wed, 07 Jun 2017 01:00:00 +0200","biburl":"http://dblp.uni-trier.de/rec/bib/journals/corr/BasavarajuMRS17","bibsource":"dblp computer science bibliography, http://dblp.org","bibtex":"@article{DBLP:journals/corr/BasavarajuMRS17,\n author = {Manu Basavaraju and\n Pranabendu Misra and\n M. S. Ramanujan and\n Saket Saurabh},\n title = {On finding highly connected spanning subgraphs},\n journal = {CoRR},\n volume = {abs/1701.02853},\n year = {2017},\n url = {http://arxiv.org/abs/1701.02853},\n timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/BasavarajuMRS17},\n bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n","author_short":["Basavaraju, M.","Misra, P.","Ramanujan, M. S.","Saurabh, S."],"key":"DBLP:journals/corr/BasavarajuMRS17","id":"DBLP:journals/corr/BasavarajuMRS17","bibbaseid":"basavaraju-misra-ramanujan-saurabh-onfindinghighlyconnectedspanningsubgraphs-2017","role":"author","urls":{"Paper":"http://arxiv.org/abs/1701.02853"},"downloads":0,"html":""},"search_terms":["finding","highly","connected","spanning","subgraphs","basavaraju","misra","ramanujan","saurabh"],"keywords":[],"authorIDs":[],"dataSources":["PcRMxrFhXmTXzZCRh"]}