Marcin Pilipczuk, Magnus Wahlström. W[1]-hard, even for four terminal pairs. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. pages 1167-1178, SIAM, 2016. [doi]
@inproceedings{PilipczukW16, title = {W[1]-hard, even for four terminal pairs}, author = {Marcin Pilipczuk and Magnus Wahlström}, year = {2016}, doi = {10.1137/1.9781611974331.ch81}, url = {http://dx.doi.org/10.1137/1.9781611974331.ch81}, researchr = {https://researchr.org/publication/PilipczukW16}, cites = {0}, citedby = {0}, pages = {1167-1178}, booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016}, editor = {Robert Krauthgamer}, publisher = {SIAM}, isbn = {978-1-61197-433-1}, }