Dimitri Lajou

Orcid: 0000-0003-4757-0169

According to our database1, Dimitri Lajou authored at least 13 papers between 2019 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the pushable chromatic number of various types of grids.
Discret. Appl. Math., April, 2023

A Proof of the Multiplicative 1-2-3 Conjecture.
Comb., February, 2023

On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs.
Theor. Comput. Sci., 2023

2022
Between proper and strong edge-colorings of subcubic graphs.
J. Graph Theory, 2022

On a List Variant of the Multiplicative 1-2-3 Conjecture.
Graphs Comb., 2022

On Cartesian products of signed graphs.
Discret. Appl. Math., 2022

Further evidence towards the multiplicative 1-2-3 Conjecture.
Discret. Appl. Math., 2022

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity.
Algorithmica, 2022

2021
On various graph coloring problems. (Sur divers problèmes de coloration de graphes).
PhD thesis, 2021

Complexity and algorithms for injective edge-coloring in graphs.
Inf. Process. Lett., 2021

2020
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019
On the achromatic number of signed graphs.
Theor. Comput. Sci., 2019

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019


  Loading...