[1] David Bremner, Dan Chen, John Iacono, Stefan Langerman, and Pat Morin. Output-sensitive algorithms for Tukey depth and related problems. Statistics and Computing, 2008. To appear. pdf
[2] Mihai Bădoiu, Richard Cole, Erik D. Demaine, and John Iacono. A unified access bound on comparison-based dynamic dictionaries. Theoretical Computer Science, 382(2):86, 2007. pdf
[3] Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, and Pat Morin. Geodesic ham-sandwich cuts. Discrete and Computational Geometry, 37(3):325-339, 2007. pdf
[4] Erik D. Demaine, John Iacono, and Stefan Langerman. Retroactive data structures. ACM Transactions on Algorithms, 3(2):325-339, 2007.
[5] Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pătraşcu. Dynamic optimality---almost. SIAM Journal on Computing, 37(1):240-251, 2007. pdf
[6] Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, and Godfried Toussaint. An $O(n \log n)$-time algorithm for the restriction scaffold assignment. Journal of Computational Biology, 13(4):979-989, 2006. pdf
[7] Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark Overmars, and Sue Whitesides. Separating point sets in polygonal environments. International Journal of Computational Geometry and Applications, 15(4):403-420, 2005. pdf
[8] John Iacono and Stefan Langerman. Queaps. Algorithmica, 42(1):49-56, 2005. pdf
[9] John Iacono. Key independent optimality. Algorithmica, 42(1):3-10, 2005. pdf
[10] David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, and Godfried Toussaint. Output-sensitive algorithms for computing nearest-neighbour decision boundaries. Discrete and Computational Geometry, 33(4):593-604, 2004. pdf
[11] Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary. Journal of Algorithms, 53(2):115-136, 2004. pdf
[12] John Iacono. Expected asymptotically optimal planar point location. Computational Geometry: Theory and Applications, 29(1):19-22, 2004.
[13] Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, and Godfried Toussaint. Space-efficient planar convex hull algorithms. Theoretical Computer Science, 321(1):25-40, 2004. pdf
[14] Erik Demaine, John Iacono, and Stefan Langerman. Proximate point searching. Computational Geometry: Theory and Applications, 28(1):29-40, 2004. pdf
[16] John Iacono and Stefan Langerman. Volume queries in polyhedra. In Discrete and Computational Geometry: Japanese Conference, Revised Selected Papers (LNCS 2098), pages 156-159, 2001. pdf
[18] David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Ileana Streinu, and Perouz Taslakian. Necklaces, convolutions, and X+Y. In European Symposium on Algorithms, pages 160-171, 2006. pdf
[19] Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, and Michiel Smid. Data structures for halfplane proximity queries and incremental Voronoi diagrams. In Latin American Theoretical Informatics (LNCS 3887), pages 80-92, 2006. pdf
[20] Boris Aronov, Alan R. Davis, John Iacono, and Albert Siu Cheong Yu. The complexity of diffuse reflections in a simple polygon. In Latin American Theoretical Informatics (LNCS 3887), pages 93-104, 2006. pdf
[21] Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pătraşcu. Dynamic optimality---almost. In IEEE Foundations of Computer Science, pages 484-490, 2004. pdf
[22] Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, and Pat Morin. Geodesic ham-sandwich cuts. In ACM Symposium on Computational Geometry, pages 1-9, 2004. pdf
[23] Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark Overmars, and Sue Whitesides. Separating point sets in polygonal environments. In ACM Symposium on Computational Geometry, pages 10-16, 2004. pdf
[24] Erik D. Demaine, J. Iacono, and S. Langerman. Retroactive data structures. In SIAM Symposium on Discrete Algorithms, pages 274-283, 2004. pdf
[25] Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, and Alejandro López-Ortiz. The cost of cache-oblivious searching. In IEEE Foundations of Computer Science, pages 271-282, 2003.
[26] David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, and Godfried Toussaint. Output-sensitive algorithms for computing nearest-neighbour decision boundaries. In Workshop on Algorithms and Data Structures (LNCS 2748), pages 251-461, 2003. pdf
[27] John Iacono. A 3-D Visualization of Kirkpatrick's planar point location algorithm. In ACM Symposium on Computational Geometry, page 377, 2003. Video on accompanying DVD.
[28] John Iacono and Stefan Langerman. Proximate planar point location. In ACM Symposium on Computational Geometry, pages 220-226, 2003.
[29] John Iacono and Stefan Langerman. Queaps. In International Symposium on Algorithms and Computation (LNCS 2518), pages 211-218, 2002. pdf
[30] John Iacono. Key independent optimality. In International Symposium on Algorithms and Computation (LNCS 2518), pages 25-31, 2002.
[31] Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, and Godfried Toussaint. In-place planar convex hull algorithms. In Latin American Theoretical Informatics (LNCS 2286), pages 494-507, 2002.
[32] Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary. In SIAM Symposium on Discrete Algorithms, pages 29-38, 2002.
[33] John Iacono. Alternatives to splay trees with $O(\log n)$ worst-case access times. In SIAM Symposium on Discrete Algorithms, pages 516-522, 2001.
[34] John Iacono. Optimal planar point location. In SIAM Symposium on Discrete Algorithms, pages 240-241, 2001.
[35] John Iacono. New upper bounds for pairing heaps. In Scandinavian Workshop on Algorithm Theory (LNCS 1851), pages 32-45, 2000. pdf
[37] Erik D. Demaine, Martin L. Demaine, John Iacono, and Stefan Langerman. Wrapping the Mozartkugel. In European Workshop on Computational Geometry, 2007.
[38] Erik D. Demaine, Martin L. Demaine, John Iacono, and Stefan Langerman. Wrapping Smooth Surfaces with Flat Paper. Computational Geometry: Theory and Applications, 2007.
[39] Dania El-Khechen, Thomas Fevens, John Iacono, and Gunther Rote. Paritioning a polygon into two congruent pieces. In Kyoto International Conference on Computational Geometry and Graph Theory, 2007. To appear.
[40] Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Dania El-Khechen, Robin Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, and Godfried T. Toussaint. Curves in the sand: algorithmic drawing. In Canadian Conference on Computational Geometry, pages 11-14, 2006.
[41] Dania El-Khechen, Thomas Fevens, and John Iacono. Partitioning a regular $n$-gon into $n+1$ convex congruent pieces is impossible, for sufficiently large $n$. In Canadian Conference on Computational Geometry, pages 173-176, 2006.
[42] Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, and Stefan Langerman. Where to build a temple, and where to dig to find one. In European Workshop on Computational Geometry, 2006. pdf
[43] Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, and Michiel Smid. Data structures for halfplane proximity queries and incremental Voronoi diagrams. In Fall Workshop on Computational Geometry, 2005.
[44] Boris Aronov, Alan R. Davis, John Iacono, and Albert Siu Cheong Yu. The complexity of diffuse reflections in a simple polygon. In Fall Workshop on Computational Geometry, 2005.
[45] Boris Aronov and John Iacono. Detecting duplicates among similar bit vectors (of course, with geometric applications). In Fall Workshop on Computational Geometry, pages 41-42, 2004. pdf
[46] Erik D. Demaine, John Iacono, and Stefan Langerman. Grid vertex-unfolding orthostacks. In Japan Conference on Discrete and Computational Geometry, pages 20-21, 2004. pdf
[47] John Iacono and Stefan Langerman. Proximate planar point location. In Fall Workshop on Computational Geometry, 2002.
[48] Prosenjit Bose, Erik D. Demaine, John Iacono, and Stefan Langerman. Quartering a square optimally. In Japan Conference on Discrete and Computational Geometry, pages 5-6, 2002.
[49] Erik Demaine, John Iacono, and Stefan Langerman. Proximate point searching. In Canadian Conference on Computational Geometry, pages 1-4, 2002. pdf
[50] John Iacono. Dynamic rectilinear point location using hashing. In Fall Workshop on Computational Geometry, 2001.
[51] Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, and Godfried Toussaint. Optimal in-place planar convex hull algorithms. In Fall Workshop on Computational Geometry, 2001.
[52] John Iacono and Stefan Langerman. Point location in axis-parallel hyperrectangles. In Japan Conference on Discrete and Computational Geometry, pages 44-45, 2001.
[53] John Iacono and Stefan Langerman. Volume queries in polyhedra. In Japan Conference on Discrete and Computational Geometry, pages 87-88, 2000.
[54] John Iacono. Optimal planar point location. In Fall Workshop on Computational Geometry, 2000.
[55] John Iacono and Stefan Langerman. Dynamic point location in fat hyperrectangles with integer coordinates. In Canadian Conference on Computational Geometry, pages 181-186, 2000.