Dimitri Lajou

Publication Activity (10 Years)

Years Active: 2019-2023
Publications (10 Years): 22

Top Topics

Parameterized Complexity

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
A Proof of the Multiplicative 1-2-3 Conjecture. Comb. 43 (1) (2023)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs. Theor. Comput. Sci. 939 (2023)
Julien Bensmail, Tapas Das, Dimitri Lajou, Soumen Nandi, Sagnik Sen
On the pushable chromatic number of various types of grids. Discret. Appl. Math. 329 (2023)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
A Proof of the Multiplicative 1-2-3 Conjecture. CALDAM (2022)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
Further evidence towards the multiplicative 1-2-3 Conjecture. Discret. Appl. Math. 307 (2022)
Dimitri Lajou
On Cartesian products of signed graphs. Discret. Appl. Math. 319 (2022)
Hervé Hocquard, Dimitri Lajou, Borut Luzar
Between proper and strong edge-colorings of subcubic graphs. J. Graph Theory 101 (4) (2022)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
On a List Variant of the Multiplicative 1-2-3 Conjecture. Graphs Comb. 38 (3) (2022)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica 84 (5) (2022)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
Complexity and algorithms for injective edge-coloring in graphs. Inf. Process. Lett. 170 (2021)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
Complexity and algorithms for injective edge-coloring in graphs. CoRR (2021)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
A proof of the Multiplicative 1-2-3 Conjecture. CoRR (2021)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC (2020)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR (2020)
Hervé Hocquard, Dimitri Lajou, Borut Luzar
Between Proper and Strong Edge-Colorings of Subcubic Graphs. IWOCA (2020)
Hervé Hocquard, Dimitri Lajou, Borut Luzar
Between proper and strong edge-colorings of subcubic graphs. CoRR (2020)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
Further Evidence Towards the Multiplicative 1-2-3 Conjecture. CoRR (2020)
Dimitri Lajou
On Cartesian Products of Signed Graphs. CALDAM (2020)
Dimitri Lajou
On the achromatic number of signed graphs. Theor. Comput. Sci. 759 (2019)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR (2019)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC (2019)
Dimitri Lajou
On the achromatic number of signed graphs. CoRR (2019)