Hanno Lefmann, Niels Schmitt. A Deterministic Polynomial Time Algorithm for Heilbronn s Problem in Dimension Three. In Sergio Rajsbaum, editor, LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings. Volume 2286 of Lecture Notes in Computer Science, pages 165-180, Springer, 2002. [doi]
@inproceedings{LefmannS02:0, title = {A Deterministic Polynomial Time Algorithm for Heilbronn s Problem in Dimension Three}, author = {Hanno Lefmann and Niels Schmitt}, year = {2002}, url = {http://link.springer.de/link/service/series/0558/bibs/2286/22860165.htm}, researchr = {https://researchr.org/publication/LefmannS02%3A0}, cites = {0}, citedby = {0}, pages = {165-180}, booktitle = {LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings}, editor = {Sergio Rajsbaum}, volume = {2286}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-43400-3}, }