Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Paul S. Bonsma

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Viresh Patel

> Home > Persons > Paul S. Bonsma

Publications

2012
[j14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jda/BonsmaBPP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BonsmaBPP12
Paul S. 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)
2010
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/iwoca/BonsmaBPP10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/BonsmaBPP10
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
The Complexity Status of Problems Related to Sparsest Cuts. IWOCA 2010: 125-135

a service of

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.