The Complexity of Order Type Isomorphism

Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer. The Complexity of Order Type Isomorphism. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. pages 405-415, SIAM, 2014. [doi]

@inproceedings{AloupisILOW14,
  title = {The Complexity of Order Type Isomorphism},
  author = {Greg Aloupis and John Iacono and Stefan Langerman and Özgür Özkan and Stefanie Wuhrer},
  year = {2014},
  doi = {10.1137/1.9781611973402.30},
  url = {http://dx.doi.org/10.1137/1.9781611973402.30},
  researchr = {https://researchr.org/publication/AloupisILOW14},
  cites = {0},
  citedby = {0},
  pages = {405-415},
  booktitle = {Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014},
  editor = {Chandra Chekuri},
  publisher = {SIAM},
  isbn = {978-1-61197-340-2},
}