Vikraman Arvind, Gaurav Rattan. The Parameterized Complexity of Geometric Graph Isomorphism. Algorithmica, 75(2):258-276, 2016. [doi]
@article{ArvindR16-0,
title = {The Parameterized Complexity of Geometric Graph Isomorphism},
author = {Vikraman Arvind and Gaurav Rattan},
year = {2016},
doi = {10.1007/s00453-015-0024-8},
url = {http://dx.doi.org/10.1007/s00453-015-0024-8},
researchr = {https://researchr.org/publication/ArvindR16-0},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {258-276},
}