Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Dimitri Lajou
Observed name:
Lajou, Dimitri
Institutions:
Centre National de la Recherche Scientifique,
Laboratoire Bordelais de Recherche en Informatique,
Institut Polytechnique de Bordeaux
Observed institutions:
École Normale Supérieure de Lyon,
Centre National de la Recherche Scientifique,
Université de Bordeaux,
Laboratoire Bordelais de Recherche en Informatique,
Institut Polytechnique de Bordeaux
ORCID:
0000-0003-4757-0169
Observed ORCID:
0000-0003-4757-0169
OpenAlex ID:
A5072234016
Complexity and algorithms for injective edge-coloring in graphs
2021
·
Florent Foucaud
, Hervé Hocquard
, et al.
·
Information Processing Letters
·
26
PDF
Between proper and strong edge‐colorings of subcubic graphs
2022
·
Herve Hocquard
, Dimitri Lajou
, et al.
·
Journal of Graph Theory
·
13
PDF
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs
2020
·
Chakraborty, Dibyayan
, Das, Sandip
, et al.
·
White Rose Research Online (University of Leeds, The University of Sheffield, University of York)
·
8
PDF
A Proof of the Multiplicative 1-2-3 Conjecture
2023
·
Julien Bensmail
, Hervé Hocquard
, et al.
·
COMBINATORICA
·
7
PDF
Further evidence towards the multiplicative 1-2-3 Conjecture
2021
·
Julien Bensmail
, Hervé Hocquard
, et al.
·
Discrete Applied Mathematics
·
6
On Cartesian products of signed graphs
2021
·
Dimitri Lajou
·
Discrete Applied Mathematics
·
6
Between Proper and Strong Edge-Colorings of Subcubic Graphs
2020
·
Hervé Hocquard
, Dimitri Lajou
, et al.
·
Lecture notes in computer science
·
6
On the pushable chromatic number of various types of grids
2023
·
Julien Bensmail
, Tapas Das
, et al.
·
Discrete Applied Mathematics
·
5
PDF
Algorithms and complexity for geodetic sets on interval and chordal graphs
2026
·
Dibyayan Chakraborty
, Sandip Das
, et al.
·
Information and Computation
·
3
PDF
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
2022
·
Florent Foucaud
, Hervé Hocquard
, et al.
·
Algorithmica
·
3
PDF
On the achromatic number of signed graphs
2019
·
Dimitri Lajou
·
Theoretical Computer Science
·
3
PDF
On a List Variant of the Multiplicative 1-2-3 Conjecture
2022
·
Julien Bensmail
, Hervé Hocquard
, et al.
·
Graphs and Combinatorics
·
2
PDF
A Proof of the Multiplicative 1-2-3 Conjecture
2022
·
Julien Bensmail
, Hervé Hocquard
, et al.
·
Lecture notes in computer science
·
2
On various graph coloring problems
2021
·
Dimitri Lajou
·
theses.fr (ABES)
·
1
PDF
On Cartesian Products of Signed Graphs
2020
·
Dimitri Lajou
·
Lecture notes in computer science
·
1
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs
2022
·
Julien Bensmail
, Hervé Hocquard
, et al.
·
Theoretical Computer Science
PDF
On the algorithmic complexity of determining the avd and nsd chromatic indices of graphs
2022
·
Bensmail, Julien
, Hocquard, Hervé
, et al.
·
HAL
On Cartesian products of signed graphs
2020
·
Lajou, Dimitri
·
arXiv (Cornell University)
PDF
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems
2019
·
Foucaud, Florent
, Hocquard, Hervé
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Show more works
View as search
Works count:
19
Citation count:
92
H-index:
6
I10-index:
2
Year
Topic
Type