Aurélien Ooms

activity

20152021

k

-SUM using few linear queries

2 citations · 3 across the 5 of their papers we have counts for

collaborators

9 papers

cs.CG2021★ 1 cited

Improved Spanning on Theta-5

Prosenjit Bose, Darryl Hill, Aurélien Ooms

We show an upper bound of $\frac{s i n ( \frac{3 π}{10} )}{s i n ( \frac{2 π}{5} ) - s i n ( \frac{3 π}{10} )} < 5.70$ on the spanning ratio of $Θ_{5}$ -graphs, imp…

cs.DS2019

Sparse Regression via Range Counting

Jean Cardinal, Aurélien Ooms

The sparse regression problem, also known as best subset selection problem, can be cast as follows: Given a set $S$ of $n$ points in $R^{d}$ , a point $y \in R^{d}$ , an…

cs.DS2019

Encoding 3SUM

Sergio Cabello, Jean Cardinal, John Iacono +3

We consider the following problem: given three sets of real numbers, output a word-RAM data structure from which we can efficiently recover the sign of the sum of any triple of num…

cs.CG2018

Improved Bounds for Guarding Plane Graphs with Edges

Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms +1

An "edge guard set" of a plane graph $G$ is a subset $Γ$ of edges of $G$ such that each face of $G$ is incident to an endpoint of an edge in $Γ$ . Such a set is said to guard $G$ . W…

cs.CG2018

Subquadratic Encodings for Point Configurations

Jean Cardinal, Timothy M. Chan, John Iacono +2

For most algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial configuration of the points: the orientation o…

cs.CG2017

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain

Elena Arseneva, Man-Kwun Chiu, Matias Korman +5

We study the computation of the diameter and radius under the rectilinear link distance within a rectilinear polygonal domain of $n$ vertices and $h$ holes. We introduce a \emph{gr…