Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (IPEC, 2019)

On the achromatic number of signed graphs. - Dimitri Lajou (Theor. Comput. Sci., 2019)

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. - Dibyayan Chakraborty; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Dimitri Lajou; Bodhayan Roy (ISAAC, 2020)

Complexity and algorithms for injective edge-coloring in graphs. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou (Inf. Process. Lett., 2021)

On various graph coloring problems. (Sur divers problèmes de coloration de graphes). - Dimitri Lajou (2021)

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (Algorithmica, 2022)

Further evidence towards the multiplicative 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou; Éric Sopena (Discret. Appl. Math., 2022)

On Cartesian products of signed graphs. - Dimitri Lajou (Discret. Appl. Math., 2022)

On a List Variant of the Multiplicative 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou; Éric Sopena (Graphs Comb., 2022)

Between proper and strong edge-colorings of subcubic graphs. - Hervé Hocquard; Dimitri Lajou; Borut Luzar (J. Graph Theory, 2022)

On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou (Theor. Comput. Sci., 2023)

A Proof of the Multiplicative 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Dimitri Lajou; Éric Sopena (Comb., 2023)

On the pushable chromatic number of various types of grids. - Julien Bensmail; Tapas Das; Dimitri Lajou; Soumen Nandi; Sagnik Sen 001 (Discret. Appl. Math., 2023)