A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	Undefined/Unknown
Title of host publication	Proceedings 9th Annual European Symposium on Algorithms ESA 2001
Editors	F Meyer auf der Heide
Place of Publication	Berlin
Publisher	Springer
Pages	380-390
Number of pages	11
Publication status	Published - 2001

9th Annual European Symposium on Algorithms ESA 2001

Keywords

@inproceedings{062358e60602474fbc7d9425d46f0634,

title = "A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth",

keywords = "Wiskunde en Informatica (WIIN)",

author = "D.M. Thilikos and M.J. Serna and H.L. Bodlaender",

note = "9th Annual European Symposium on Algorithms ESA 2001",

year = "2001",

language = "Undefined/Unknown",

pages = "380--390",

editor = "\{Meyer auf der Heide\}, F",

booktitle = "Proceedings 9th Annual European Symposium on Algorithms ESA 2001",

publisher = "Springer",

}

A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. / Thilikos, D.M.; Serna, M.J.; Bodlaender, H.L.
Proceedings 9th Annual European Symposium on Algorithms ESA 2001. ed. / F Meyer auf der Heide. Berlin: Springer, 2001. p. 380-390.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth

AU - Thilikos, D.M.

AU - Serna, M.J.

AU - Bodlaender, H.L.

N1 - 9th Annual European Symposium on Algorithms ESA 2001

PY - 2001

Y1 - 2001

KW - Wiskunde en Informatica (WIIN)

M3 - Conference contribution

SP - 380

EP - 390

BT - Proceedings 9th Annual European Symposium on Algorithms ESA 2001

A2 - Meyer auf der Heide, F

PB - Springer

CY - Berlin

ER -