Markus Sortland Dregi, Daniel Lokshtanov. Parameterized Complexity of Bandwidth on Trees. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Volume 8572 of Lecture Notes in Computer Science, pages 405-416, Springer, 2014. [doi]
@inproceedings{DregiL14,
title = {Parameterized Complexity of Bandwidth on Trees},
author = {Markus Sortland Dregi and Daniel Lokshtanov},
year = {2014},
doi = {10.1007/978-3-662-43948-7_34},
url = {http://dx.doi.org/10.1007/978-3-662-43948-7_34},
researchr = {https://researchr.org/publication/DregiL14},
cites = {0},
citedby = {0},
pages = {405-416},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I},
editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias},
volume = {8572},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-662-43947-0},
}