On the Complexity of Grammar-Based Compression over Fixed Alphabets. - Katrin Casel; Henning Fernau; Serge Gaspers; Benjamin Gras 002; Markus L. Schmid (ICALP, 2016)

Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel. - Christophe Crespelle; Benjamin Gras 002; Anthony Perez 001 (WG, 2021)

On the Complexity of Broadcast Domination and Multipacking in Digraphs. - Florent Foucaud; Benjamin Gras 002; Anthony Perez 001; Florian Sikora (Algorithmica, 2021)

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. - Katrin Casel; Henning Fernau; Serge Gaspers; Benjamin Gras 002; Markus L. Schmid (Theory Comput. Syst., 2021)

Enumerating Connected Dominating Sets. - Faisal N. Abu-Khzam; Henning Fernau; Benjamin Gras 002; Mathieu Liedloff; Kevin Mann (CoRR, 2022)

Enumerating Minimal Connected Dominating Sets. - Faisal N. Abu-Khzam; Henning Fernau; Benjamin Gras 002; Mathieu Liedloff; Kevin Mann (SIAM J. Discret. Math., 2025)