Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan. Finding topological subgraphs is fixed-parameter tractable. In Lance Fortnow, Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. pages 479-488, ACM, 2011. [doi]
@inproceedings{GroheKMW11,
title = {Finding topological subgraphs is fixed-parameter tractable},
author = {Martin Grohe and Ken-ichi Kawarabayashi and Dániel Marx and Paul Wollan},
year = {2011},
doi = {10.1145/1993636.1993700},
url = {http://doi.acm.org/10.1145/1993636.1993700},
researchr = {https://researchr.org/publication/GroheKMW11},
cites = {0},
citedby = {0},
pages = {479-488},
booktitle = {Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011},
editor = {Lance Fortnow and Salil P. Vadhan},
publisher = {ACM},
isbn = {978-1-4503-0691-1},
}