On the Decision Tree Complexity of $k$-SUM. - Jean Cardinal; Aurélien Ooms (CoRR, 2015)

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

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

More Turán-Type Theorems for Triangles in Convex Point Sets. - Boris Aronov; Vida Dujmovic; Pat Morin; Aurélien Ooms; Luís Fernando Schultz Xavier da Silveira (Electron. J. Comb., 2019)

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

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

Improved Bounds for Guarding Plane Graphs with Edges. - Ahmad Biniaz; Prosenjit Bose; Aurélien Ooms; Sander Verdonschot (Graphs Comb., 2019)

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

Sparse Regression via Range Counting. - Jean Cardinal; Aurélien Ooms (SWAT, 2020)

Improved Bounds on the Spanning Ratio of the Theta-5-Graph. - Prosenjit Bose; Darryl Hill; Aurélien Ooms (WADS, 2021)

Rectilinear link diameter and radius in a rectilinear polygonal domain. - Elena Arseneva; Man-Kwun Chiu; Matias Korman; Aleksandar Markovic 001; Yoshio Okamoto; Aurélien Ooms; André van Renssen; Marcel Roeloffzen (Comput. Geom., 2021)

Improved Spanning on Theta-5. - Prosenjit Bose; Darryl Hill; Aurélien Ooms (CoRR, 2021)

Algorithms for approximate sparse regression and nearest induced hulls. - Jean Cardinal; Aurélien Ooms (J. Comput. Geom., 2022)

Improved spanning ratio of the Theta-5 graph. - Prosenjit Bose; Darryl Hill; Aurélien Ooms (J. Comput. Geom., 2024)