Hans Raj Tiwary, Khaled M. Elbassioni. On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. In Monique Teillaud, editor, Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008. pages 192-198, ACM, 2008. [doi]
@inproceedings{TiwaryE08,
title = {On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism},
author = {Hans Raj Tiwary and Khaled M. Elbassioni},
year = {2008},
doi = {10.1145/1377676.1377707},
url = {http://doi.acm.org/10.1145/1377676.1377707},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/TiwaryE08},
cites = {0},
citedby = {0},
pages = {192-198},
booktitle = {Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008},
editor = {Monique Teillaud},
publisher = {ACM},
isbn = {978-1-60558-071-5},
}