Dynamic point location in fat hyperrectangles with integer coordinates. - John Iacono; Stefan Langerman (CCCG, 2000)

Volume Queries in Polyhedra. - John Iacono; Stefan Langerman (JCDCG, 2000)

Improved Upper Bounds for Pairing Heaps. - John Iacono (SWAT, 2000)

Optimal planar point location. - John Iacono (SODA, 2001)

Alternatives to splay trees with O(log n) worst-case access times. - John Iacono (SODA, 2001)

In-Place Planar Convex Hull Algorithms. - Hervé Brönnimann; John Iacono; Jyrki Katajainen; Pat Morin; Jason Morrison; Godfried T. Toussaint (LATIN, 2002)

A 3-D visualization of kirkpatrick's planar point location algorithm. - John Iacono (SCG, 2003)

Proximate planar point location. - John Iacono; Stefan Langerman (SCG, 2003)

Proximate point searching. - Erik D. Demaine; John Iacono; Stefan Langerman (Comput. Geom., 2004)

Expected asymptotically optimal planar point location. - John Iacono (Comput. Geom., 2004)

Worst-Case Optimal Tree Layout in a Memory Hierarchy - Erik D. Demaine; John Iacono; Stefan Langerman (CoRR, 2004)

A locality-preserving cache-oblivious dynamic dictionary. - Michael A. Bender; Ziyang Duan; John Iacono; Jing Wu (J. Algorithms, 2004)

Space-efficient planar convex hull algorithms. - Hervé Brönnimann; John Iacono; Jyrki Katajainen; Pat Morin; Jason Morrison; Godfried T. Toussaint (Theor. Comput. Sci., 2004)

Key-Independent Optimality. - John Iacono (Algorithmica, 2005)

Queaps. - John Iacono; Stefan Langerman (Algorithmica, 2005)

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment - Justin Colannino; Mirela Damian; Ferran Hurtado; John Iacono; Henk Meijer; Suneeta Ramaswami; Godfried T. Toussaint (CoRR, 2005)

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. - David Bremner; Erik D. Demaine; Jeff Erickson 001; John Iacono; Stefan Langerman; Pat Morin; Godfried T. Toussaint (Discret. Comput. Geom., 2005)

Separating Point Sets in Polygonal Environments. - Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Henk Meijer; Mark H. Overmars; Sue Whitesides (Int. J. Comput. Geom. Appl., 2005)

Curves in the Sand: Algorithmic Drawing. - Mirela Damian; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Dania El-Khechen; Robin Y. Flatland; John Iacono; Stefan Langerman; Henk Meijer; Suneeta Ramaswami; Diane L. Souvaine; Perouz Taslakian; et al. (CCCG, 2006)

Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n. - Dania El-Khechen; Thomas Fevens; John Iacono (CCCG, 2006)

Necklaces, Convolutions, and X + Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Perouz Taslakian (ESA, 2006)

The Complexity of Diffuse Reflections in a Simple Polygon. - Boris Aronov; Alan R. Davis; John Iacono; Albert Siu Cheong Yu (LATIN, 2006)

An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem. - Justin Colannino; Mirela Damian; Ferran Hurtado; John Iacono; Henk Meijer; Suneeta Ramaswami; Godfried T. Toussaint (J. Comput. Biol., 2006)

Geodesic Ham-Sandwich Cuts. - Prosenjit Bose; Erik D. Demaine; Ferran Hurtado; John Iacono; Stefan Langerman; Pat Morin (Discret. Comput. Geom., 2007)

Dynamic Optimality - Almost. - Erik D. Demaine; Dion Harmon; John Iacono; Mihai Patrascu (SIAM J. Comput., 2007)

Retroactive data structures. - Erik D. Demaine; John Iacono; Stefan Langerman (ACM Trans. Algorithms, 2007)

A unified access bound on comparison-based dynamic dictionaries. - Mihai Badoiu; Richard Cole 001; Erik D. Demaine; John Iacono (Theor. Comput. Sci., 2007)

Partitioning a Polygon into Two Mirror Congruent Pieces. - Dania El-Khechen; John Iacono; Thomas Fevens; Günter Rote (CCCG, 2008)

Distribution-sensitive point location in convex subdivisions. - Sébastien Collette; Vida Dujmovic; John Iacono; Stefan Langerman; Pat Morin (SODA, 2008)

Output-sensitive algorithms for Tukey depth and related problems. - David Bremner; Dan Chen 003; John Iacono; Stefan Langerman; Pat Morin (Stat. Comput., 2008)

Packing 2×2 unit squares into grid polygons is NP-complete. - Dania El-Khechen; Muriel Dulieu; John Iacono; Nikolaj van Omme (CCCG, 2009)

The geometry of binary search trees. - Erik D. Demaine; Dion Harmon; John Iacono; Daniel Kane 001; Mihai Patrascu (SODA, 2009)

Minimal Locked Trees. - Brad Ballinger; David Charlton; Erik D. Demaine; Martin L. Demaine; John Iacono; Ching-Hao Liu; Sheung-Hung Poon (WADS, 2009)

Wrapping spheres with flat paper. - Erik D. Demaine; Martin L. Demaine; John Iacono; Stefan Langerman (Comput. Geom., 2009)

Detecting all regular polygons in a point set - Greg Aloupis; Jean Cardinal; Sébastien Collette; John Iacono; Stefan Langerman (CoRR, 2009)

Minimum feature size preserving decompositions - Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; John Iacono (CoRR, 2009)

Oja medians and centers of gravity. - Dan Chen 003; Olivier Devillers; John Iacono; Stefan Langerman; Pat Morin (CCCG, 2010)

Common Unfoldings of Polyominoes and Polycubes. - Greg Aloupis; Prosenjit Bose; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Karim Douïeb; Vida Dujmovic; John Iacono; Stefan Langerman; Pat Morin (CGGA, 2010)

Coverage with k-Transmitters in the Presence of Obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (COCOA (2), 2010)

Mergeable Dictionaries. - John Iacono; Özgür Özkan (ICALP (1), 2010)

Unit-Time Predecessor Queries on Massive Data Sets. - Andrej Brodnik; John Iacono (ISAAC (1), 2010)

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. - Gerth Stølting Brodal; Erik D. Demaine; Jeremy T. Fineman; John Iacono; Stefan Langerman; J. Ian Munro (SODA, 2010)

Editorial. - John Iacono (Comput. Geom., 2010)

Priority Queues with Multiple Time Fingers - Amr Elmasry; Arash Farzan; John Iacono (CoRR, 2010)

Grid Vertex-Unfolding Orthostacks. - Erik D. Demaine; John Iacono; Stefan Langerman (Int. J. Comput. Geom. Appl., 2010)

A static optimality transformation with applications to planar point location. - John Iacono (SCG, 2011)

Encoding 2D Range Maximum Queries. - Mordecai J. Golin; John Iacono; Danny Krizanc; Rajeev Raman; S. Srinivasa Rao 001 (ISAAC, 2011)

A Unifying Property for Distribution-Sensitive Priority Queues. - Amr Elmasry; Arash Farzan; John Iacono (IWOCA, 2011)

Meshes Preserving Minimum Feature Size. - Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; John Iacono (EGC, 2011)

The Cost of Cache-Oblivious Searching. - Michael A. Bender; Gerth Stølting Brodal; Rolf Fagerberg; Dongdong Ge; Simai He; Haodong Hu; John Iacono; Alejandro López-Ortiz (Algorithmica, 2011)

Using Hashing to Solve the Dictionary Problem (In External Memory) - John Iacono; Mihai Patrascu (CoRR, 2011)

Encoding 2-D Range Maximum Queries - Mordecai J. Golin; John Iacono; Danny Krizanc; Rajeev Raman; S. Srinivasa Rao 001 (CoRR, 2011)

Continuous Blooming of Convex Polyhedra. - Erik D. Demaine; Martin L. Demaine; Vi Hart; John Iacono; Stefan Langerman; Joseph O'Rourke (Graphs Comb., 2011)

Confluent persistence revisited. - Sébastien Collette; John Iacono; Stefan Langerman (SODA, 2012)

Using hashing to solve the dictionary problem. - John Iacono; Mihai Patrascu (SODA, 2012)

Packing identical simple polygons is NP-hard - Sarah R. Allen; John Iacono (CoRR, 2012)

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; John Iacono; Stefan Langerman; Henk Meijer; Vera Sacristán Adinolfi; Maria Saumell; David R. Wood (Int. J. Comput. Geom. Appl., 2012)

A Static Optimality Transformation with Applications to Planar Point Location. - John Iacono; Wolfgang Mulzer (Int. J. Comput. Geom. Appl., 2012)

A priority queue with the time-finger property. - Amr Elmasry; Arash Farzan; John Iacono (J. Discrete Algorithms, 2012)

Entropy, triangulation, and point location in planar subdivisions. - Sébastien Collette; Vida Dujmovic; John Iacono; Stefan Langerman; Pat Morin (ACM Trans. Algorithms, 2012)

In Pursuit of the Dynamic Optimality Conjecture. - John Iacono (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

How to Cover Most of a Point Set with a V-Shape of Minimum Width. - Boris Aronov; John Iacono; Özgür Özkan; Mark V. Yagnatinsky (CCCG, 2013)

Encodings for Range Selection and Top-k Queries. - Roberto Grossi; John Iacono; Gonzalo Navarro 001; Rajeev Raman; Srinivasa Rao Satti (ESA, 2013)

Combining Binary Search Trees. - Erik D. Demaine; John Iacono; Stefan Langerman; Özgür Özkan (ICALP (1), 2013)

On the hierarchy of distribution-sensitive properties for data structures. - Amr Elmasry; Arash Farzan; John Iacono (Acta Informatica, 2013)

Efficient reconfiguration of lattice-based modular robots. - Greg Aloupis; Nadia M. Benbernou; Mirela Damian; Erik D. Demaine; Robin Y. Flatland; John Iacono; Stefanie Wuhrer (Comput. Geom., 2013)

Oja centers and centers of gravity. - Dan Chen 003; Olivier Devillers; John Iacono; Stefan Langerman; Pat Morin (Comput. Geom., 2013)

The Complexity of Order Type Isomorphism. - Greg Aloupis; John Iacono; Stefan Langerman; Özgür Özkan (CoRR, 2013)

Why some heaps support constant-amortized-time decrease-key operations, and others do not - John Iacono (CoRR, 2013)

The Fresh-Finger Property - John Howat; John Iacono; Pat Morin (CoRR, 2013)

Coverage with k-transmitters in the presence of obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (J. Comb. Optim., 2013)

Cache-Oblivious Persistence. - Pooya Davoodi; Jeremy T. Fineman; John Iacono; Özgür Özkan (ESA, 2014)

Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. - John Iacono; Özgür Özkan (ICALP (1), 2014)

Necklaces, Convolutions, and X+Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Mihai Patrascu; Perouz Taslakian (Algorithmica, 2014)

Foreword. - Frank Dehne; John Iacono (Comput. Geom., 2014)

A Tight Lower Bound for Decrease-Key in the Pure Heap Model. - John Iacono; Özgür Özkan (CoRR, 2014)

Range Minimum Query Indexes in Higher Dimensions. - Pooya Davoodi; John Iacono; Gad M. Landau; Moshe Lewenstein (CPM, 2015)

Worst-Case Optimal Tree Layout in External Memory. - Erik D. Demaine; John Iacono; Stefan Langerman (Algorithmica, 2015)

A Linear Potential Function for Pairing Heaps. - John Iacono; Mark V. Yagnatinsky (COCOA, 2016)

Solving k-SUM Using Few Linear Queries. - Jean Cardinal; John Iacono; Aurélien Ooms (ESA, 2016)

Weighted dynamic finger in binary search trees. - John Iacono; Stefan Langerman (SODA, 2016)

The Power and Limitations of Static Binary Search Trees with Lazy Finger. - Prosenjit Bose; Karim Douïeb; John Iacono; Stefan Langerman (Algorithmica, 2016)

Encoding 2D range maximum queries. - Mordecai J. Golin; John Iacono; Danny Krizanc; Rajeev Raman; Srinivasa Rao Satti; Sunil M. Shende (Theor. Comput. Sci., 2016)

Nearest-Neighbor Search Under Uncertainty. - Boris Aronov; John Iacono; Khadijeh Sheikhan (CCCG, 2017)

Subquadratic Algorithms for Algebraic Generalizations of 3SUM. - Luis Barba; Jean Cardinal; John Iacono; Stefan Langerman; Aurélien Ooms; Noam Solomon (SoCG, 2017)

Searching Edges in the Overlap of Two Plane Graphs. - John Iacono; Elena Khramtcova; Stefan Langerman (WADS, 2017)

An Efficient Multiway Mergesort for GPU Architectures. - Henri Casanova; John Iacono; Ben Karsin; Nodari Sitchinava; Volker Weichert (CoRR, 2017)

Incremental Voronoi Diagrams. - Sarah R. Allen; Luis Barba; John Iacono; Stefan Langerman (Discret. Comput. Geom., 2017)

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries. - Roberto Grossi; John Iacono; Gonzalo Navarro 001; Rajeev Raman; S. Srinivasa Rao 001 (ACM Trans. Algorithms, 2017)

Compatible Paths on Labelled Point Sets. - Elena Arseneva; Yeganeh Bahoo; Ahmad Biniaz; Pilar Cano; Farah Chanchary; John Iacono; Kshitij Jain 001; Anna Lubiw; Debajyoti Mondal; Khadijeh Sheikhan; Csaba D. Tóth (CCCG, 2018)

Dynamic Trees with Almost-Optimal Access Cost. - Mordecai J. Golin; John Iacono; Stefan Langerman; J. Ian Munro; Yakov Nekrich (ESA, 2018)

Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs. - Ben Karsin; Volker Weichert; Henri Casanova; John Iacono; Nodari Sitchinava (ICS, 2018)

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. - Boris Aronov; Prosenjit Bose; Erik D. Demaine; Joachim Gudmundsson; John Iacono; Stefan Langerman; Michiel H. M. Smid (Algorithmica, 2018)

Encoding nearest larger values. - Michael Hoffmann 002; John Iacono; Patrick K. Nicholson; Rajeev Raman (Theor. Comput. Sci., 2018)

External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. - John Iacono; Riko Jacob; Konstantinos Tsakalidis (ESA, 2019)

External Memory Planar Point Location with Fast Updates. - John Iacono; Ben Karsin; Grigorios Koumoutsos (ISAAC, 2019)

Locality. - John Iacono; Varunkumar Jayapaul; Ben Karsin (CoRR, 2019)

Encoding 3SUM. - Sergio Cabello; Jean Cardinal; John Iacono; Stefan Langerman; Pat Morin; Aurélien Ooms (CoRR, 2019)

A parallel priority queue with fast updates for GPU architectures. - John Iacono; Ben Karsin; Nodari Sitchinava (CoRR, 2019)

Subquadratic Algorithms for Algebraic 3SUM. - Luis Barba; Jean Cardinal; John Iacono; Stefan Langerman; Aurélien Ooms; Noam Solomon (Discret. Comput. Geom., 2019)

Subquadratic encodings for point configurations. - Jean Cardinal; Timothy M. Chan; John Iacono; Stefan Langerman; Aurélien Ooms (J. Comput. Geom., 2019)

Dynamic Geometric Independent Set. - Sujoy Bhore; Jean Cardinal; John Iacono; Grigorios Koumoutsos (CoRR, 2020)

Spanning Properties of Theta-Theta-6. - Mirela Damian; John Iacono; Andrew Winslow (Graphs Comb., 2020)

Sublinear Explicit Incremental Planar Voronoi Diagrams. - Elena Arseneva; John Iacono; Grigorios Koumoutsos; Stefan Langerman; Boris Zolotov (J. Inf. Process., 2020)

Approximability of (Simultaneous) Class Cover for Boxes. - Jean Cardinal; Justin Dallant; John Iacono (CCCG, 2021)

An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. - Jean Cardinal; Justin Dallant; John Iacono (ESA, 2021)

Worst-Case Efficient Dynamic Geometric Independent Set. - Jean Cardinal; John Iacono; Grigorios Koumoutsos (ESA, 2021)

Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. - Jean Cardinal; John Iacono (SOSA, 2021)

Scalable Data Structures (Dagstuhl Seminar 21071). - Gerth Stølting Brodal; John Iacono; Markus E. Nebel; Vijaya Ramachandran (Dagstuhl Reports, 2021)

Belga B-Trees. - Erik D. Demaine; John Iacono; Grigorios Koumoutsos; Stefan Langerman (Theory Comput. Syst., 2021)

Locality-of-Reference Optimality of Cache-Oblivious Algorithms. - Peyman Afshani; John Iacono; Varunkumar Jayapaul; Ben Karsin; Nodari Sitchinava (APOCS, 2022)

External-Memory Dictionaries with Worst-Case Update Cost. - Rathish Das; John Iacono; Yakov Nekrich (ISAAC, 2022)

Fragile complexity of adaptive algorithms. - Prosenjit Bose; Pilar Cano; Rolf Fagerberg; John Iacono; Riko Jacob; Stefan Langerman (Theor. Comput. Sci., 2022)

Dynamic Schnyder woods. - Pilar Cano; Sujoy Bhore; Prosenjit Bose; Jean Cardinal; John Iacono (CCCG, 2023)

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. - Boris Aronov; Mark de Berg; Jean Cardinal; Esther Ezra; John Iacono; Micha Sharir (Comput. Geom., 2023)

Scalable Data Structures (Dagstuhl Seminar 23211). - Gerth Stølting Brodal; John Iacono; László Kozma 002; Vijaya Ramachandran; Justin Dallant (Dagstuhl Reports, 2023)

Competitive Online Search Trees on Trees. - Prosenjit Bose; Jean Cardinal; John Iacono; Grigorios Koumoutsos; Stefan Langerman (ACM Trans. Algorithms, 2023)

Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. - Sébastien Collette; John Iacono (SODA, 2024)

A General Technique for Searching in Implicit Sets via Function Inversion. - Boris Aronov; Jean Cardinal; Justin Dallant; John Iacono (SOSA, 2024)

Vertex Ranking of Degenerate Graphs. - John Iacono; Piotr Micek; Pat Morin; Bruce A. Reed (CoRR, 2024)

How fast can we play Tetris greedily with rectangular pieces? - Justin Dallant; John Iacono (Theor. Comput. Sci., 2024)

The Complexity of Order Type Isomorphism. - Greg Aloupis; John Iacono; Stefan Langerman; Özgür Özkan; Stefanie Wuhrer (Discret. Comput. Geom., 2024)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time. - John Iacono; Yakov Nekrich (SoCG, 2025)

Fast and Simple Sorting Using Partial Information. - Bernhard Haeupler; Richard Hladík; John Iacono; Václav Rozhon; Robert E. Tarjan; Jakub Tetek (SODA, 2025)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs. - Ahmad Biniaz; Prosenjit Bose; Chaeyoon Chung; Jean-Lou De Carufel; John Iacono; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth (WADS, 2025)

Conditional Lower Bounds for Dynamic Geometric Measure Problems. - Justin Dallant; John Iacono (ACM Trans. Algorithms, 2025)

An Improved Bound for Plane Covering Paths. - Hugo A. Akitaya; Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Cyril Gavoille; John Iacono; Linda Kleist; Michiel Smid; Diane L. Souvaine; Leonidas Theocharous (CoRR, 2025)