Optimality of Geometric Local Search. - Bruno Jartoux; Nabil H. Mustafa (SoCG, 2018)

On combinatorial approximation algorithms in geometry. (Sur les algorithmes d'approximation combinatoires en géométrie). - Bruno Jartoux (2018)

Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. - Kunal Dutta; Arijit Ghosh; Bruno Jartoux; Nabil H. Mustafa (Discret. Comput. Geom., 2019)

The ε-t-Net Problem. - Noga Alon; Bruno Jartoux; Chaya Keller; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Comput. Geom., 2022)

A Tight Analysis of Geometric Local Search. - Bruno Jartoux; Nabil H. Mustafa (Discret. Comput. Geom., 2022)

On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs. - Bruno Jartoux; Chaya Keller; Shakhar Smorodinsky; Yelena Yuditsky (SIAM J. Discret. Math., 2022)

The Visuo-Haptic Illusions Toolkit. - Benoît Christophe Geslain; Bruno Jartoux; Gilles Bailly (IHM (Adjunct), 2024)

Counting kernels in directed graphs with arbitrary orientations. - Bruno Jartoux (Discret. Appl. Math., 2024)

Conflict-Free Colouring of Subsets. - Bruno Jartoux; Chaya Keller; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Comput. Geom., 2024)