Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell. Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?. In Joachim Gudmundsson, Julián Mestre, Taso Viglas, editors, Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings. Volume 7434 of Lecture Notes in Computer Science, pages 37-48, Springer, 2012. [doi]
@inproceedings{FloderusKLL12,
title = {Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?},
author = {Peter Floderus and Miroslaw Kowaluk and Andrzej Lingas and Eva-Marta Lundell},
year = {2012},
doi = {10.1007/978-3-642-32241-9_4},
url = {http://dx.doi.org/10.1007/978-3-642-32241-9_4},
researchr = {https://researchr.org/publication/FloderusKLL12},
cites = {0},
citedby = {0},
pages = {37-48},
booktitle = {Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
editor = {Joachim Gudmundsson and Julián Mestre and Taso Viglas},
volume = {7434},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-32240-2},
}