dblp.uni-trier.dewww.uni-trier.de

John Iacono Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
49EEErik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505
48EEBrad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon: Minimal Locked Trees. WADS 2009: 61-73
47EESébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, Triangulation, and Point Location in Planar Subdivisions CoRR abs/0901.1908: (2009)
46EEErik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke: Continuous Blooming of Convex Polyhedra CoRR abs/0906.2461: (2009)
45EEGreg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman: Detecting all regular polygons in a point set CoRR abs/0908.2442: (2009)
44EEGreg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Minimum feature size preserving decompositions CoRR abs/0908.2493: (2009)
2008
43 Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote: Partitioning a Polygon into Two Mirror Congruent Pieces. CCCG 2008
42EESébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Distribution-sensitive point location in convex subdivisions. SODA 2008: 912-921
41EEDavid Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin: Output-sensitive algorithms for Tukey depth and related problems. Statistics and Computing 18(3): 259-266 (2008)
2007
40EEErik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. ACM Transactions on Algorithms 3(2): (2007)
39EEProsenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic Ham-Sandwich Cuts. Discrete & Computational Geometry 37(3): 325-339 (2007)
38EEErik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)
37EEMihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2): 86-96 (2007)
2006
36EEMirela 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, Godfried T. Toussaint: Curves in the Sand: Algorithmic Drawing. CCCG 2006
35EEDania El-Khechen, Thomas Fevens, John Iacono: Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n. CCCG 2006
34EEDavid Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian: Necklaces, Convolutions, and X + Y. ESA 2006: 160-171
33EEBoris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. LATIN 2006: 80-92
32EEBoris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu: The Complexity of Diffuse Reflections in a Simple Polygon. LATIN 2006: 93-104
31EEJustin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint: An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem. Journal of Computational Biology 13(4): 979-989 (2006)
2005
30EEJohn Iacono: Key-Independent Optimality. Algorithmica 42(1): 3-10 (2005)
29EEJohn Iacono, Stefan Langerman: Queaps. Algorithmica 42(1): 49-56 (2005)
28EEJustin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint: An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment CoRR abs/cs/0507013: (2005)
27EEBoris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams CoRR abs/cs/0512091: (2005)
26EEDavid Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint: Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discrete & Computational Geometry 33(4): 593-604 (2005)
25EEErik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating Point Sets in Polygonal Environments. Int. J. Comput. Geometry Appl. 15(4): 403-420 (2005)
2004
24EEErik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality -- Almost. FOCS 2004: 484-490
23EEErik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82
22EEErik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. SODA 2004: 281-290
21EEProsenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004: 1-9
20EEErik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating point sets in polygonal environments. Symposium on Computational Geometry 2004: 10-16
19EEErik D. Demaine, John Iacono, Stefan Langerman: Worst-Case Optimal Tree Layout in a Memory Hierarchy CoRR cs.DS/0410048: (2004)
18EEErik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. Comput. Geom. 28(1): 29-40 (2004)
17EEJohn Iacono: Expected asymptotically optimal planar point location. Comput. Geom. 29(1): 19-22 (2004)
16EEMichael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2): 115-136 (2004)
15EEHervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004)
2003
14EEMichael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz: The Cost of Cache-Oblivious Searching. FOCS 2003: 271-282
13EEJohn Iacono, Stefan Langerman: Proximate planar point location. Symposium on Computational Geometry 2003: 220-226
12EEJohn Iacono: A 3-D visualization of kirkpatrick's planar point location algorithm. Symposium on Computational Geometry 2003: 377
11EEDavid Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint: Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS 2003: 451-461
2002
10EEErik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. CCCG 2002: 1-4
9EEJohn Iacono, Stefan Langerman: Queaps. ISAAC 2002: 211-218
8EEJohn Iacono: Key Independent Optimality. ISAAC 2002: 25-31
7EEHervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507
6EEMichael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. SODA 2002: 29-38
2001
5EEJohn Iacono: Optimal planar point location. SODA 2001: 340-341
4EEJohn Iacono: Alternatives to splay trees with O(log n) worst-case access times. SODA 2001: 516-522
2000
3EEJohn Iacono, Stefan Langerman: Dynamic point location in fat hyperrectangles with integer coordinates. CCCG 2000
2EEJohn Iacono, Stefan Langerman: Volume Queries in Polyhedra. JCDCG 2000: 156-159
1EEJohn Iacono: Improved Upper Bounds for Pairing Heaps. SWAT 2000: 32-45

Coauthor Index

1Greg Aloupis [44] [45]
2Boris Aronov [27] [32] [33]
3Mihai Badoiu [37]
4Brad Ballinger [48]
5Michael A. Bender [6] [14] [16]
6Prosenjit Bose [21] [27] [33] [39]
7David Bremner [11] [26] [34] [41]
8Gerth Stølting Brodal [14]
9Hervé Brönnimann [7] [15]
10Jean Cardinal [45]
11Timothy M. Chan [34]
12David Charlton [48]
13Dan Chen [41]
14Justin Colannino [28] [31]
15Richard Cole [37]
16Sébastien Collette [42] [45] [47]
17Mirela Damian (Mirela Damian-Iordache) [28] [31] [36]
18Alan R. Davis [32]
19Erik D. Demaine [10] [11] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [33] [34] [36] [37] [38] [39] [40] [44] [46] [48] [49]
20Martin L. Demaine [36] [44] [46] [48]
21Ziyang Duan [6] [16]
22Vida Dujmovic [36] [42] [44] [47]
23Dania El-Khechen [35] [36] [43]
24Jeff Erickson [11] [20] [25] [26] [34]
25Rolf Fagerberg [14]
26Thomas Fevens [35] [43]
27Robin Y. Flatland [36]
28Dongdong Ge [14]
29Joachim Gudmundsson [27] [33]
30Dion Harmon [24] [38] [49]
31Vi Hart [46]
32Simai He [14]
33Haodong Hu [14]
34Ferran Hurtado [20] [21] [25] [28] [31] [34] [39]
35Daniel Kane [49]
36Jyrki Katajainen [7] [15]
37Stefan Langerman [2] [3] [9] [10] [11] [13] [18] [19] [20] [21] [22] [23] [25] [26] [27] [29] [33] [34] [36] [39] [40] [41] [42] [45] [46] [47]
38Ching-Hao Liu [48]
39Alejandro López-Ortiz [14]
40Henk Meijer [20] [25] [28] [31] [36]
41Pat Morin [7] [11] [15] [21] [26] [39] [41] [42] [47]
42Jason Morrison [7] [15]
43Joseph O'Rourke [46]
44Mark H. Overmars [20] [25]
45Mihai Patrascu [24] [38] [49]
46Sheung-Hung Poon [48]
47Suneeta Ramaswami [28] [31] [36]
48Günter Rote [43]
49Michiel H. M. Smid [27] [33]
50Diane L. Souvaine [36]
51Perouz Taslakian [34] [36]
52Godfried T. Toussaint [7] [11] [15] [26] [28] [31] [36]
53Sue Whitesides [20] [25]
54Jing Wu [6] [16]
55Albert Siu Cheong Yu [32]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)