John Iacono
Orcid: 0000-0001-8885-8172Affiliations:
- Université libre de Bruxelles, Brussels, Belgium
According to our database1,
John Iacono
authored at least 124 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Theor. Comput. Sci., 2024
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024
Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model.
Comput. Geom., 2023
Dynamic Schnyder woods.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023
2022
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Proceedings of the 3rd Symposium on Algorithmic Principles of Computer Systems, 2022
2021
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
Approximability of (Simultaneous) Class Cover for Boxes.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
2020
2019
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
Algorithmica, 2018
Proceedings of the 32nd International Conference on Supercomputing, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018
2017
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-<i>k</i> Queries.
ACM Trans. Algorithms, 2017
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017
Proceedings of the 33rd International Symposium on Computational Geometry, 2017
Nearest-Neighbor Search Under Uncertainty.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
2016
Algorithmica, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015
2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
2013
Why some heaps support constant-amortized-time decrease-key operations, and others do not
CoRR, 2013
Acta Informatica, 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
Proceedings of the Algorithms - ESA 2013, 2013
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
Proceedings of the Space-Efficient Data Structures, 2013
2012
ACM Trans. Algorithms, 2012
Int. J. Comput. Geom. Appl., 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011
2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
Proceedings of the Combinatorial Optimization and Applications, 2010
Proceedings of the Computational Geometry, Graphs and Applications, 2010
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
2009
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009
2008
Stat. Comput., 2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Partitioning a Polygon into Two Mirror Congruent Pieces.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
2007
Theor. Comput. Sci., 2007
2006
An <i>O</i>(<i>n</i> log <i>n</i>)-Time Algorithm for the Restriction Scaffold Assignment Problem.
J. Comput. Biol., 2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
Proceedings of the Algorithms, 2006
Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
2005
Discret. Comput. Geom., 2005
2004
2003
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
2000
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000