BibTeX record journals/jda/BonsmaBPP12

download as .bib file

@article{DBLP:journals/jda/BonsmaBPP12,
  author       = {Paul S. Bonsma and
                  Hajo Broersma and
                  Viresh Patel and
                  Artem V. Pyatkin},
  title        = {The complexity of finding uniform sparsest cuts in various graph classes},
  journal      = {J. Discrete Algorithms},
  volume       = {14},
  pages        = {136--149},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2011.12.008},
  doi          = {10.1016/J.JDA.2011.12.008},
  timestamp    = {Tue, 16 Feb 2021 14:03:20 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BonsmaBPP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.