@article{journals/jda/BonsmaBPP12,
  author = {Bonsma, Paul S. and Broersma, Hajo and Patel, Viresh and Pyatkin, Artem V.},
  ee = {http://dx.doi.org/10.1016/j.jda.2011.12.008},
  interhash = {8ca7bc7ae8afd1213da43828597626ba},
  intrahash = {3e5ee7dffedfdad3c55aa1fff0219518},
  journal = {J. Discrete Algorithms},
  pages = {136-149},
  title = {The complexity of finding uniform sparsest cuts in various graph classes.},
  url = {http://dblp.uni-trier.de/db/journals/jda/jda14.html#BonsmaBPP12},
  volume = 14,
  year = 2012
}

{"_id":{"_str":"52430439b1392ed1430016a7"},"__v":53,"authorIDs":["545735e62abc8e9f370001a2"],"author_short":["Bonsma, P. S.","Broersma, H.","Patel, V.","Pyatkin, A. V."],"bibbaseid":"bonsma-broersma-patel-pyatkin-thecomplexityoffindinguniformsparsestcutsinvariousgraphclasses-2012","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Bonsma"],"firstnames":["Paul","S."],"suffixes":[]},{"propositions":[],"lastnames":["Broersma"],"firstnames":["Hajo"],"suffixes":[]},{"propositions":[],"lastnames":["Patel"],"firstnames":["Viresh"],"suffixes":[]},{"propositions":[],"lastnames":["Pyatkin"],"firstnames":["Artem","V."],"suffixes":[]}],"ee":"http://dx.doi.org/10.1016/j.jda.2011.12.008","interhash":"8ca7bc7ae8afd1213da43828597626ba","intrahash":"3e5ee7dffedfdad3c55aa1fff0219518","journal":"J. Discrete Algorithms","pages":"136-149","title":"The complexity of finding uniform sparsest cuts in various graph classes.","url":"http://dblp.uni-trier.de/db/journals/jda/jda14.html#BonsmaBPP12","volume":"14","year":"2012","bibtex":"@article{journals/jda/BonsmaBPP12,\n author = {Bonsma, Paul S. and Broersma, Hajo and Patel, Viresh and Pyatkin, Artem V.},\n ee = {http://dx.doi.org/10.1016/j.jda.2011.12.008},\n interhash = {8ca7bc7ae8afd1213da43828597626ba},\n intrahash = {3e5ee7dffedfdad3c55aa1fff0219518},\n journal = {J. Discrete Algorithms},\n pages = {136-149},\n title = {The complexity of finding uniform sparsest cuts in various graph classes.},\n url = {http://dblp.uni-trier.de/db/journals/jda/jda14.html#BonsmaBPP12},\n volume = 14,\n year = 2012\n}\n\n","author_short":["Bonsma, P. S.","Broersma, H.","Patel, V.","Pyatkin, A. V."],"key":"journals/jda/BonsmaBPP12","id":"journals/jda/BonsmaBPP12","bibbaseid":"bonsma-broersma-patel-pyatkin-thecomplexityoffindinguniformsparsestcutsinvariousgraphclasses-2012","role":"author","urls":{"Link":"http://dx.doi.org/10.1016/j.jda.2011.12.008","Paper":"http://dblp.uni-trier.de/db/journals/jda/jda14.html#BonsmaBPP12"},"downloads":1},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/artem?items=1000","downloads":1,"keywords":[],"search_terms":["complexity","finding","uniform","sparsest","cuts","various","graph","classes","bonsma","broersma","patel","pyatkin"],"title":"The complexity of finding uniform sparsest cuts in various graph classes.","year":2012,"dataSources":["7supHakfuKN3wzsvy"]}