John Iacono's Publications

John Iacono's Publications

Edited Volumes

[0] Frank Dehne, John Iacono, and Jörg-Rüdiger Sack. Algorithms and Data Structures --- 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings. 2011. Springer, Lecture Notes in Computer Science, Volume 6844, 718 pages.

Journal publications

[1] 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. Algorithmica. Accepted and posted on publisher's web site.

[2] Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, and Pat Morin. Oja centers and centers of gravity. Comput. Geom., 46(2):140-147, 2013.

[3] Amr Elmasry, Arash Farzan, and John Iacono. On the hierarchy of distribution-sensitive properties for data structures. Acta Informatica, 50(4):289-295, 2013.

[4] Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacrist\'an Adinolfi, Diane L. Souvaine, and Ryuhei Uehara. Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim., 25(2):208-233, 2013.

[5] Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik Demaine, Robin Flatland, John Iacono, and Stefanie Wuhrer. Efficient Reconfiguration for Lattice-Based Robots. Computational Geometry: Theory and Applications, 46(8):917-928, 2013.

[6] Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacrist\'an Adinolfi, Maria Saumell, and David R. Wood. Proximity graphs: E, delta, Delta, Xi and omega. Int. J. Comput. Geometry Appl., 22(5):439-470, 2012.

[7] Amr Elmasry, Arash Farzan, and John Iacono. A Priority Queue with the Time-Finger Property. Journal of Discrete Algorithms, 16:206-212, 2012.

[8] John Iacono and Wolfgang Mulzer. A static optimality Transformation with Applications to Planar Point Location. International Journal of Computational Geometry and Applications, 22(4):327-340, 2012.

[9] Sébastien Collette, Vida Dujmović, John Iacono, Stefan Langerman, and Pat Morin. Entropy, Triangulation, and Point Location in Planar Subdivisions. ACM Transactions on Algorithms, 8(3)

[10] Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, and Joseph O'Rourke. Continuous Blooming of Convex Polyhedra. Graphs and Combinatorics, 27(3):363-376, 2011.

[11] 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. Algorithmica, 61(2):463-505, 2011.

[12] Erik D. Demaine, John Iacono, and Stefan Langerman. Grid vertex-unfolding orthostacks. International Journal of Computational Geometry and Applications, 20(1):245-254, 2010. pdf

[13] Erik D. Demaine, Martin L. Demaine, John Iacono, and Stefan Langerman. Wrapping spheres with flat paper. Computational Geometry: Theory and Applications, 42(8):748-757, 2009.

[14] John Iacono. Editorial. Computational Geometry: Theory and Applications. (1):1, 2009.

[15] David Bremner, Dan Chen, John Iacono, Stefan Langerman, and Pat Morin. Output-sensitive algorithms for Tukey depth and related problems. Statistics and Computing, 18(3):259-266, 2008. pdf

[16] Mihai Bădoiu, Richard Cole, Erik D. Demaine, and John Iacono. A unified access bound on comparison-based dynamic dictionaries. Theorertical Computer Science, 382(2):86, 2007. pdf

[17] 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

[18] Erik D. Demaine, John Iacono, and Stefan Langerman. Retroactive data structures. ACM Transactions on Algorithms, 3(2):325-339, 2007.

[19] 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

[20] 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

[21] 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

[22] John Iacono and Stefan Langerman. Queaps. Algorithmica, 42(1):49-56, 2005. pdf

[23] John Iacono. Key independent optimality. Algorithmica, 42(1):3-10, 2005. pdf

[24] 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

[25] 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

[26] John Iacono. Expected asymptotically optimal planar point location. Computational Geometry: Theory and Applications, 29(1):19-22, 2004.

[27] 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

[28] Erik Demaine, John Iacono, and Stefan Langerman. Proximate point searching. Computational Geometry: Theory and Applications, 28(1):29-40, 2004. pdf

Journal Submissions

[29] Amr Elmasry, Arash Farzan, and John Iacono. A Unifying Property for Distribution-Sensitive Priority Queues. Acta Informatica. Fully accepted. Awaiting publication.

[30] John Iacono. Constant time insertion in pairing heaps. Algorithmica. Submitted.

[31] Erik D. Demaine, John Iacono, and Stefan Langerman. Worst-case optimal tree layout in a memory hierarchy. Algorithmica. Accepted.

Articles in refereed volumes

[32] John Iacono. In Pursuit of the Dynamic Optimality Conjecture. In Space-Efficient Data Structures, Streams, and Algorithms --- Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (LNCS 8066), pages 236-250, 2013. Invited paper.

[33] Greg Aloupis, Erik Demaine, Martin Demaine, Vida Dujmović, and John Iacono. Meshes preserving minimum feature size. In Computational Geometry: XIV Spanish Meeting on Computational Geometry, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcal‡ de Henares, Spain, June 27-30, 2011, Revised Selected Papers (LNCS 7579), pages 258-273, 2012.

[34] Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douieb, Vida Dujmovic, John Iacono, Stefan Langerman, and Pat Morin. Common Unfoldings of Polyominoes and Polycubes. In CGGA (LNCS 7033), pages 44-54, 2010.

[35] Erik D. Demaine, John Iacono, and Stefan Langerman. Grid vertex-unfolding orthostacks. In Discrete and Computational Geometry: Japanese Conference, Revised Selected Papers (LNCS 3742), pages 76-82, 2005. pdf

[36] 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

Articles in refereed conference proceedings

[37] Greg Aloupis, John Iacono, Stefan Langerman, Ozgur Ozkan, and Stefanie Wuhrer. The Complexity of Order Type Isomorphism. In Symposium on Discrete Algorithms (SODA), 2014. To appear.

[38] Erik D. Demaine, John Iacono, Stefan Langerman, and Ozgur Ozkan. Combining Binary Search Trees. In International Colloquium on Automata, Languages and Programming (ICALP) (1), pages 388-399, 2013.

[39] Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, and Srinivasa Rao Satti. Encodings for Range Selection and Top-k Queries. In European Symposium on Algorithms (ESA), pages 553-564, 2013.

[40] Sebastien Collette, John Iacono, and Stefan Langerman. Confluent Persistence Revisited. In Symposium on Discrete Algorithms (SODA), pages 593-601, 2012.

[41] John Iacono and Mihai Patrascu. Using Hashing to Solve the Dictionary Problem (In External Memory). In Symposium on Discrete Algorithms (SODA), pages 570-582, 2012.

[42] Mordecai Golin, John Iacono, Danny Krizanc, Rajeev Raman, and Srinivasa Rao Satti. Encoding 2-D Range Maximum Queries. In International Symposium on Algorithms and Computation (ISAAC), pages 180-189, 2011.

[43] John Iacono. A static optimality Transformation with Applications to Planar Point Location. In Symposium on Computational Geometry (SoCG), pages 21-26, 2011.

[44] Amr Elmasry, Arash Farzan, and John Iacono. Priority Queues with Multiple Time Fingers. In International Workshop on Combinatorial Algorithms (IWOCA), pages 209-222, 2011.

[45] Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, and J. Ian Munro. Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. In Symposium on Discrete Algorithms (SODA), pages 1448-1456, 2010.

[46] John Iacono and Özgür Özkan. Mergeable Dictionaries. In International Colloquium on Automata, Languages and Programming (ICALP) (1), pages 164-175, 2010.

[47] Andrej Brodnik and John Iacono. Unit-time predecessor queries on massive data sets. In International Symposium on Algorithms and Computation (ISAAC, LNCS 6506), pages 133-144, 2010.

[48] Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik Demaine, Robin Flatland, John Iacono, and Stefanie Wuhrer. Efficient Reconfiguration for Lattice-Based Modular Robots. In European Conference on Mobile Robotics (ECMR), pages 81-86, 2009.

[49] Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, and Sheung-Hung Poon. Minimal Locked Trees. In WADS, pages 61-73, 2009.

[50] Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, and Mihai Patrascu. The geometry of binary search trees. In Symposium on Discrete Algorithms (SODA), pages 496-505, 2009.

[51] Sébastien Collette, Vida Dujmović , John Iacono , Stefan Langerman , and Pat Morin. Distribution-Sensitive Point Location in Convex Subdivisions. In Symposium on Discrete Algorithms (SODA), pages 912-921, 2008.

[52] 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 (ESA), pages 160-171, 2006. pdf

[53] 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 (LATIN, LNCS 3887), pages 80-92, 2006. pdf

[54] 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 (LATIN, LNCS 3887), pages 93-104, 2006. pdf

[55] Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pătraşcu. Dynamic optimality---almost. In Foundations of Computer Science (FOCS), pages 484-490, 2004. pdf

[56] Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, and Pat Morin. Geodesic ham-sandwich cuts. In Symposium on Computational Geometry (SoCG), pages 1-9, 2004. pdf

[57] 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 Symposium on Computational Geometry (SoCG), pages 10-16, 2004. pdf

[58] Erik D. Demaine, J. Iacono, and S. Langerman. Retroactive data structures. In Symposium on Discrete Algorithms (SODA), pages 274-283, 2004. pdf

[59] 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 Foundations of Computer Science (FOCS), pages 271-282, 2003.

[60] 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 (WADS, LNCS 2748), pages 251-461, 2003. pdf

[61] John Iacono. A 3-D Visualization of Kirkpatrick's planar point location algorithm. In Symposium on Computational Geometry (SoCG), page 377, 2003. Video on accompanying DVD.

[62] John Iacono and Stefan Langerman. Proximate planar point location. In Symposium on Computational Geometry (SoCG), pages 220-226, 2003.

[63] John Iacono and Stefan Langerman. Queaps. In International Symposium on Algorithms and Computation (ISAAC, LNCS 2518), pages 211-218, 2002. pdf

[64] John Iacono. Key independent optimality. In International Symposium on Algorithms and Computation (ISAAC, LNCS 2518), pages 25-31, 2002.

[65] 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 (LATIN, LNCS 2286), pages 494-507, 2002.

[66] Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary. In Symposium on Discrete Algorithms (SODA), pages 29-38, 2002.

[67] John Iacono. Alternatives to splay trees with $O(\log n)$ worst-case access times. In Symposium on Discrete Algorithms (SODA), pages 516-522, 2001.

[68] John Iacono. Optimal planar point location. In Symposium on Discrete Algorithms (SODA), pages 240-241, 2001.

[69] John Iacono. New upper bounds for pairing heaps. In Scandinavian Workshop on Algorithm Theory (SWAT, LNCS 1851), pages 32-45, 2000. pdf

Other conference papers

[70] Boris Aronov, John Iacono, Ozgur Ozkan, and Mark Yagnatinsky. How to Cover Most of a Point Set with a V-Shape of Minimum Width. In Canadian Conference on Computational Geometry (CCCG), 2013.

[71] Greg Aloupis, John Iacono, Stefan Langerman, Ozgur Ozkan, and Stefanie Wuhrer. The Complexity of Order Type Isomorphism. In Fall workshop on computational geometry, 2013. To appear.

[72] Greg Aloupis, Muriel Dulieu, John Iacono, Stefan Langerman, Ozgur Ozkan, Suneeta Ramaswami, and Stefanie Wuhrer. Order type invariant labeling and comparison of point sets. In European workshop on computational geometry (EUROCG), 2012.

[73] Oswin Aichholszer, Sarah R. Allen, Greg Aloupis, Luis Barba, Prosenjit Bose, Jean Lou de Carufel , John Iacono, Stefan Langerman, and Diane Souvaine. Sum of Squared Edges for MST of a Point Set in a Unit Square. In Fall workshop on computational geometry, 2012.

[74] Boris Aronov, John Iacono, and Mark Yagnatinsky. Finding the thinnest V-shape with few outliers. In Fall workshop on computational geometry, 2012.

[75] Sarah R. Allen and John Iacono. Packing Identical Simple Polygons is NP-hard. In Fall workshop on computational geometry, 2012.

[76] John Iacono and Kostyantyn Mazur. Tactix on an S-shaped Board. In Fall workshop on computational geometry, 2012.

[77] Greg Aloupis, John Iacono, Jonathan Lenchner, and Ozgur Ozkan. Locating a Line at Unit Distance with two Agents. In Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG), 2012.

[78] Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristan, Maria Saumell, and David R. Wood. Proximity graphs: E, delta, Delta, Xi and omega. In European conference on computational geometry (EUROCG), 2012.

[79] Greg Aloupis, Erik Demaine, Martin Demaine, Vida Dujmović, and John Iacono. Meshes preserving minimum feature size. In Encuentros de Geometría Computacional, 2011.

[80] John Iacono and Mihai Patrascu. Using Hashing to Solve the Dictionary Problem (In External Memory). In Workshop on Massive Data Structures, 2011.

[81] Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, and J. Ian Munro. Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. In Workshop on Massive Data Algorithmics, 2010.

[82] Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacrist\'an Adinolfi, Diane L. Souvaine, and Ryuhei Uehara. Coverage with k-Transmitters in the Presence of Obstacles. In COCOA (2) (LNCS 6509), pages 1-15, 2010.

[83] Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, and Pat Morin. Oja medians and centers of gravity. In Canadian Conference on Computational Geometry (CCCG), pages 147-150, 2010.

[84] Andrej Brodnik and John Iacono. Unit-time predecessor queries on massive data sets. In Workshop on Massive Data Algorithmics, 2010.

[85] Dania El-Khechen, Muriel Dulieu, John Iacono, and Nikolaj van Omme. Packing 2x2 squares is NP-complete. In Canadian Conference on Computational Geometry (CCCG), pages 33-36, 2009.

[86] Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, and Joseph O'Rourke. Continuous Blooming of Convex Polyhedra. Japan Conference on Computational Geometry and Graphs. , 2009.

[87] Dania El-Khechen, John Iacono, Thomas Fevens, and Günter Rote. Partitioning a Polygon into Two Mirror Congruent Pieces. In Canadian Conference on Computational Geometry (CCCG), 2008.

[88] Sébastien Collette, Vida Dujmović , John Iacono , Stefan Langerman , and Pat Morin. Distribution-Sensitive Point Location in Convex Subdivisions. In Fall workshop on computational geometry, 2007.

[89] Erik D. Demaine, Martin L. Demaine, John Iacono, and Stefan Langerman. Wrapping the Mozartkugel. In European Workshop on Computational Geometry, 2007.

[90] 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.

[91] 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.

[92] 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.

[93] 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

[94] 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.

[95] 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.

[96] 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

[97] 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

[98] John Iacono and Stefan Langerman. Proximate planar point location. In Fall Workshop on Computational Geometry, 2002.

[99] 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.

[100] Erik Demaine, John Iacono, and Stefan Langerman. Proximate point searching. In Canadian Conference on Computational Geometry (CCCG), pages 1-4, 2002. pdf

[101] John Iacono. Dynamic rectilinear point location using hashing. In Fall Workshop on Computational Geometry, 2001.

[102] 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.

[103] John Iacono and Stefan Langerman. Point location in axis-parallel hyperrectangles. In Japan Conference on Discrete and Computational Geometry, pages 44-45, 2001.

[104] John Iacono and Stefan Langerman. Volume queries in polyhedra. In Japan Conference on Discrete and Computational Geometry, pages 87-88, 2000.

[105] John Iacono. Optimal planar point location. In Fall Workshop on Computational Geometry, 2000.

[106] John Iacono and Stefan Langerman. Dynamic point location in fat hyperrectangles with integer coordinates. In Canadian Conference on Computational Geometry, pages 181-186, 2000.

arXiv

[107] John Iacono. Why some heaps support constant-amortized-time decrease-key operations, and others do not. CoRR, arXiv. (abs/1302.6641), 2013.

[108] John Howat, John Iacono, and Pat Morin. The Fresh-Finger Property. CoRR, arXiv. (abs/1302.6914), 2013.

[109] Prosenjit Bose, Karim Douieb, John Iacono, and Stefan Langerman. The Power and Limitations of Static Binary Search Trees with Lazy Finger. CoRR, arXiv. (abs/1304.6897), 2013.

[110] Erik D. Demaine, John Iacono, Stefan Langerman, and Ozgur Ozkan. Combining Binary Search Trees. CoRR, arXiv. (abs/1304.7604), 2013.

[111] John Iacono. In pursuit of the dynamic optimality conjecture. CoRR, arXiv. (abs/1306.0207), 2013.

[112] David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, and Perouz Taslakian. Necklaces, Convolutions, and X+Y. CoRR, arXiv. (abs/1212.4771), 2012.

[113] Sarah R. Allen and John Iacono. Packing Identical Simple Polygons is NP-hard. CoRR, arXiv. (CoRR) abs/1209.5307, 2012.

[114] Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, and S. Srinivasa Rao. Encoding 2-D Range Maximum Queries. CoRR, abs/1109.2885, 2011.

[115] John Iacono. A static optimality Transformation with Applications to Planar Point Location. arXiv, 1104.5597, 2011.

[116] John Iacono. Improved Upper Bounds for Pairing Heaps. arXiv, 1110.4428, 2011.

[117] Sebastien Collette, John Iacono, and Stefan Langerman. Confluent Persistence Revisited. CoRR, arXiv:1104.3045, 2011.

[118] John Iacono and Mihai Patrascu. Using Hashing to Solve the Dictionary Problem (In External Memory). CoRR, arXiv:1104.2799, 2011.

[119] Amr Elmasry, Arash Farzan, and John Iacono. Title: Priority Queues with Multiple Time Fingers. CoRR, arXiv:1009.5538, 2011.

[120] John Iacono and Özgür Özkan. Mergeable Dictionaries. CoRR, abs/1002.4248, 2010.

[121] Sébastien Collette, Vida Dujmović, John Iacono, Stefan Langerman, and Pat Morin. Entropy, Triangulation, and Point Location in Planar Subdivisions. CoRR, abs/0901.1908, 2009.

[122] Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, and Joseph O'Rourke. Continuous Blooming of Convex Polyhedra. CoRR, abs/0906.2461, 2009.

[123] Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, and Stefan Langerman. Detecting all regular polygons in a point set. CoRR, abs/0908.2442, 2009.

[124] Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, and John Iacono. Minimum feature size preserving decompositions. CoRR, abs/0908.2493, 2009.

[125] Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, and Godfried T. Toussaint. An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment. CoRR, abs/cs/0507013, 2005.

[126] Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, and Michiel H. M. Smid. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. CoRR, abs/cs/0512091, 2005.

[127] Erik D. Demaine, John Iacono, and Stefan Langerman. Worst-Case Optimal Tree Layout in External Memory. CoRR, cs.DS/0410048, 2004. Updated 2011.

Ph.D. Thesis

[128] John Iacono. Distribution Sensitive Data Structures. Ph.D. Thesis. Rutgers, The State University of New Jersey, Graduate School---New Brunswick. 2001.


Linked publications are preliminary versions that may differ from the actual published version.