Dimitri Lajou

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