Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette. On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science, 410(1):53-61, 2009. [doi]
@article{FellowsHRV09,
title = {On the parameterized complexity of multiple-interval graph problems},
author = {Michael R. Fellows and Danny Hermelin and Frances A. Rosamond and Stéphane Vialette},
year = {2009},
doi = {10.1016/j.tcs.2008.09.065},
url = {http://dx.doi.org/10.1016/j.tcs.2008.09.065},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/FellowsHRV09},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {410},
number = {1},
pages = {53-61},
}