The minimum k-way cut of bounded size is fixed-parameter tractable

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Standard

The minimum k-way cut of bounded size is fixed-parameter tractable. / Kawarabayashi, Ken-ichi; Thorup, Mikkel.

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. ed. / Rafail Ostrovsky. IEEE, 2011. p. 160-169.

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Harvard

Kawarabayashi, K & Thorup, M 2011, The minimum k-way cut of bounded size is fixed-parameter tractable. in R Ostrovsky (ed.), 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. IEEE, pp. 160-169, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, California, United States, 22/10/2011. https://doi.org/10.1109/FOCS.2011.53

APA

Kawarabayashi, K., & Thorup, M. (2011). The minimum k-way cut of bounded size is fixed-parameter tractable. In R. Ostrovsky (Ed.), 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (pp. 160-169). IEEE. https://doi.org/10.1109/FOCS.2011.53

Vancouver

Kawarabayashi K, Thorup M. The minimum k-way cut of bounded size is fixed-parameter tractable. In Ostrovsky R, editor, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. IEEE. 2011. p. 160-169 https://doi.org/10.1109/FOCS.2011.53

Author

Kawarabayashi, Ken-ichi ; Thorup, Mikkel. / The minimum k-way cut of bounded size is fixed-parameter tractable. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. editor / Rafail Ostrovsky. IEEE, 2011. pp. 160-169

Bibtex

@inproceedings{806c88dac5034269988f0df36835008f,
title = "The minimum k-way cut of bounded size is fixed-parameter tractable",
author = "Ken-ichi Kawarabayashi and Mikkel Thorup",
year = "2011",
doi = "10.1109/FOCS.2011.53",
language = "English",
isbn = "978-1-4577-1843-4",
pages = "160--169",
editor = "Ostrovsky, {Rafail }",
booktitle = "2011 IEEE 52nd Annual Symposium on Foundations of Computer Science",
publisher = "IEEE",
note = "null ; Conference date: 22-10-2011 Through 25-10-2011",

}

RIS

TY - GEN

T1 - The minimum k-way cut of bounded size is fixed-parameter tractable

AU - Kawarabayashi, Ken-ichi

AU - Thorup, Mikkel

N1 - Conference code: 52

PY - 2011

Y1 - 2011

U2 - 10.1109/FOCS.2011.53

DO - 10.1109/FOCS.2011.53

M3 - Article in proceedings

SN - 978-1-4577-1843-4

SP - 160

EP - 169

BT - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science

A2 - Ostrovsky, Rafail

PB - IEEE

Y2 - 22 October 2011 through 25 October 2011

ER -

ID: 45529472