215 citations · 441 across the 50 of their papers we have counts for
4 papers · 1 filter
Solving -SUM using few linear queries
Jean Cardinal, John Iacono, Aurélien Ooms
The -SUM problem is given input real numbers to determine whether any of them sum to zero. The problem is of tremendous importance in the emerging field of complexity th…
On the shelling antimatroids of split graphs
Jean Cardinal, Jean-Paul Doignon, Keno Merckx
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset…
Ramsey-type theorems for lines in 3-space
Jean Cardinal, Michael S. Payne, Noam Solomon
We prove geometric Ramsey-type statements on collections of lines in 3-space. These statements give guarantees on the size of a clique or an independent set in (hyper)graphs induce…
Recognition and Complexity of Point Visibility Graphs
Jean Cardinal, Udo Hoffmann
A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding…