Metric dimension on sparse graphs and its applications to zero forcing sets. - Nicolas Bousquet 001; Quentin Deschamps; Aline Parreau; Ignacio M. Pelayo (CoRR, 2021)

Metric Dimension Parameterized by Treewidth in Chordal Graphs. - Nicolas Bousquet 001; Quentin Deschamps; Aline Parreau (WG, 2023)

Locating-dominating sets: From graphs to oriented graphs. - Nicolas Bousquet 001; Quentin Deschamps; Tuomo Lehtilä; Aline Parreau (Discret. Math., 2023)

Dimension métrique et coloration dans les graphes peu denses. (Combinatorial and Algorithmics apects of Metric dimension). - Quentin Deschamps (2023)

Improved square coloring of planar graphs. - Nicolas Bousquet 001; Quentin Deschamps; Lucas de Meyer; Théo Pierron (Discret. Math., 2023)

Strengthening a Theorem of Meyniel. - Quentin Deschamps; Carl Feghali; Frantisek Kardos; Clément Legrand-Duchesne; Théo Pierron (SIAM J. Discret. Math., 2023)

Partitioning into degenerate graphs in linear time. - Timothée Corsini; Quentin Deschamps; Carl Feghali; Daniel Gonçalves; Hélène Langlois; Alexandre Talon (Eur. J. Comb., 2023)

Square Coloring Planar Graphs with Automatic Discharging. - Nicolas Bousquet 001; Quentin Deschamps; Lucas de Meyer; Théo Pierron (SIAM J. Discret. Math., 2024)

The tape reconfiguration problem and its consequences for dominating set reconfiguration. - Nicolas Bousquet 001; Quentin Deschamps; Arnaud Mary; Amer E. Mouawad; Théo Pierron (CoRR, 2025)