Laekhanukit, Bundit Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://drops.dagstuhl.de/opus/volltexte/2018/8741/ (出版社版)
http://drops.dagstuhl.de/doku/urheberrecht1.html (著作権譲渡合意書)
David, R., Karthik, C. S., & Laekhanukit, B. (2018). On the Complexity of Closest Pair via Polar-Pair of Point-Sets. In B., Speckmann, & C. D., Tóth (Eds.), 34th International Symposium on Computational Geometry (pp. 1-15). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2018.28.