Andrzej Lingas, Martin Wahlen. On Exact Complexity of Subgraph Homeomorphism. In Jin-yi Cai, S. Barry Cooper, Hong Zhu, editors, Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings. Volume 4484 of Lecture Notes in Computer Science, pages 256-261, Springer, 2007. [doi]
@inproceedings{LingasW07, title = {On Exact Complexity of Subgraph Homeomorphism}, author = {Andrzej Lingas and Martin Wahlen}, year = {2007}, doi = {10.1007/978-3-540-72504-6_23}, url = {http://dx.doi.org/10.1007/978-3-540-72504-6_23}, researchr = {https://researchr.org/publication/LingasW07}, cites = {0}, citedby = {0}, pages = {256-261}, booktitle = {Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings}, editor = {Jin-yi Cai and S. Barry Cooper and Hong Zhu}, volume = {4484}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-72503-9}, }