International audienceThe existence of Macbeath regions is a classical theorem in convex geometry [13], with recent applications in discrete and computational geometry. In this paper, we initiate the study of Macbeath regions in a combinatorial setting—and not only for the Lebesgue measure as is the case in the classical theorem—and establish near-optimal bounds for several basic geometric set systems
AbstractIn this article, we generalize a localization theorem of Lovász and Simonovits [Random walks...
International audienceIn this article, we generalize a localization theorem of Lovasz and Simonovits...
This thesis mainly focuses on geometric measure theory with applications to some shape optimization ...
International audienceThe existence of Macbeath regions is a classical theorem in convex geometry [1...
International audienceThe existence of Macbeath regions is a classical theorem in convex geometry ("...
The existence of Macbeath regions is a classical theorem in convex geometry (“A Theorem on non-homog...
The analysis of approximation techniques is a key topic in computational geometry, both for practica...
International audienceThe packing lemma of Haussler states that given a set system $(X, R)$ with bou...
The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if eve...
We study the connections between three seemingly different combinatorial structures - uniform bracke...
This note considers some set-theoretic relationships for various subsets implied by Multiple Compari...
Abstract Given a set of n axis-parallel rectangles in the plane, finding a maximum independent set (...
International audienceThe VC-dimension of a set system is a way to capture its complexity and has be...
Let M be a set of positive integers. A set S of nonnegative integers is called an M‐set if a and b∈S...
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become...
AbstractIn this article, we generalize a localization theorem of Lovász and Simonovits [Random walks...
International audienceIn this article, we generalize a localization theorem of Lovasz and Simonovits...
This thesis mainly focuses on geometric measure theory with applications to some shape optimization ...
International audienceThe existence of Macbeath regions is a classical theorem in convex geometry [1...
International audienceThe existence of Macbeath regions is a classical theorem in convex geometry ("...
The existence of Macbeath regions is a classical theorem in convex geometry (“A Theorem on non-homog...
The analysis of approximation techniques is a key topic in computational geometry, both for practica...
International audienceThe packing lemma of Haussler states that given a set system $(X, R)$ with bou...
The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if eve...
We study the connections between three seemingly different combinatorial structures - uniform bracke...
This note considers some set-theoretic relationships for various subsets implied by Multiple Compari...
Abstract Given a set of n axis-parallel rectangles in the plane, finding a maximum independent set (...
International audienceThe VC-dimension of a set system is a way to capture its complexity and has be...
Let M be a set of positive integers. A set S of nonnegative integers is called an M‐set if a and b∈S...
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become...
AbstractIn this article, we generalize a localization theorem of Lovász and Simonovits [Random walks...
International audienceIn this article, we generalize a localization theorem of Lovasz and Simonovits...
This thesis mainly focuses on geometric measure theory with applications to some shape optimization ...