default search action

combined dblp search
author search
venue search
publication search

ask others

"Solving Partition Problems Almost Always Requires Pushing Many Vertices ..."

Iyad Kanj et al. (2020)

> Home

Details and statistics

DOI: 10.1137/19M1239362

access: closed

type: Journal Article

metadata version: 2020-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/KanjKSL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/KanjKSL20
Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. 34(1): 640-681 (2020)

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.