3 citations · 4 across the 7 of their papers we have counts for
9 papers
Data-Driven Classifications of Video Game Vocabulary
Nicolas Grelier, Stéphane Kaufmann
As a novel and fast-changing field, the video game industry does not have a fixed and well-defined vocabulary. In particular, game genres are of interest: No two experts seem to ag…
Well-Separation and Hyperplane Transversals in High Dimensions
Helena Bergold, Daniel Bertschinger, Nicolas Grelier +2
A family of point sets in dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong ass…
Nearest-Neighbor Decompositions of Drawings
Jonas Cleve, Nicolas Grelier, Kristin Knorr +3
Let be a set of straight-line segments in the plane, potentially crossing, and let be a positive integer. We denote by the union of the endpoints of the strai…
Computing a maximum clique in geometric superclasses of disk graphs
Nicolas Grelier
In the 90's Clark, Colbourn and Johnson wrote a seminal paper where they proved that maximum clique can be solved in polynomial time in unit disk graphs. Since then, the complexity…
Maximum Clique in Disk-Like Intersection Graphs
Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow
We study the complexity of Maximum Clique in intersection graphs of convex objects in the plane. On the algorithmic side, we extend the polynomial-time algorithm for unit disks [Cl…
Hardness and Approximation of Minimum Convex Partition
Nicolas Grelier
We consider the Minimum Convex Partition problem: Given a set P of n points in the plane, draw a plane graph G on P, with positive minimum degree, such that G partitions the convex…
On the VC-dimension of half-spaces with respect to convex sets
Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow +1
A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists a halfspace h that f…
A neighborhood-preserving translation operator on graphs
Bastien Pasdeloup, Vincent Gripon, Jean-Charles Vialatte +2
In this paper, we introduce translation operators on graphs. Contrary to spectrally-defined translations in the framework of graph signal processing, our operators mimic neighborho…
Neighborhood-Preserving Translations on Graphs
Nicolas Grelier, Bastien Pasdeloup, Jean-Charles Vialatte +1
In many domains (e.g. Internet of Things, neuroimaging) signals are naturally supported on graphs. These graphs usually convey information on similarity between the values taken by…