Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Paul Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin. The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms, 14:136-149, 2012. [doi]
Abstract is missing.