On cliques of signed and switchable signed graphs. - Julien Bensmail; Christopher Duffy 001; Sagnik Sen 001 (CoRR, 2014)

Strong edge-colouring of sparse planar graphs. - Julien Bensmail; Ararat Harutyunyan; Hervé Hocquard; Petru Valicov (Discret. Appl. Math., 2014)

On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. - Olivier Baudon; Julien Bensmail; Rafal Kalinowski; Antoni Marczyk; Jakub Przybylo; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2014)

Partitioning Harary graphs into connected subgraphs containing prescribed vertices. - Olivier Baudon; Julien Bensmail; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2014)

Partitioning powers of traceable or hamiltonian graphs. - Olivier Baudon; Julien Bensmail; Jakub Przybylo; Mariusz Wozniak (Theor. Comput. Sci., 2014)

An oriented version of the 1-2-3 Conjecture. - Olivier Baudon; Julien Bensmail; Éric Sopena (Discuss. Math. Graph Theory, 2015)

On decomposing regular graphs into locally irregular subgraphs. - Olivier Baudon; Julien Bensmail; Jakub Przybylo; Mariusz Wozniak (Eur. J. Comb., 2015)

Strong edge coloring sparse graphs. - Julien Bensmail; Marthe Bonamy; Hervé Hocquard (Electron. Notes Discret. Math., 2015)

On the complexity of partitioning a graph into a few connected subgraphs. - Julien Bensmail (J. Comb. Optim., 2015)

On the complexity of determining the irregular chromatic index of a graph. - Olivier Baudon; Julien Bensmail; Éric Sopena (J. Discrete Algorithms, 2015)

On three polynomial kernels of sequences for arbitrarily partitionable graphs. - Julien Bensmail (Discret. Appl. Math., 2016)

Strong edge-coloring of (3, Δ)-bipartite graphs. - Julien Bensmail; Aurélie Lagoutte; Petru Valicov (Discret. Math., 2016)

The complexity of deciding whether a graph admits an orientation with fixed weak diameter. - Julien Bensmail; Romaric Duvignau; Sergey Kirgizov (Discret. Math. Theor. Comput. Sci., 2016)

Edge-partitioning graphs into regular and locally irregular components. - Julien Bensmail; Brett Stevens (Discret. Math. Theor. Comput. Sci., 2016)

Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs. - Julien Bensmail; Gabriel Renault (Graphs Comb., 2016)

Disjoint Cycles of Different Lengths in Graphs and Digraphs. - Julien Bensmail; Ararat Harutyunyan; Ngoc-Khang Le; Binlong Li; Nicolas Lichiardopol (Electron. J. Comb., 2017)

On a directed variation of the 1-2-3 and 1-2 Conjectures. - Emma Barme; Julien Bensmail; Jakub Przybylo; Mariusz Wozniak (Discret. Appl. Math., 2017)

On oriented cliques with respect to push operation. - Julien Bensmail; Soumen Nandi; Sagnik Sen 001 (Discret. Appl. Math., 2017)

Structural properties of recursively partitionable graphs with connectivity 2. - Olivier Baudon; Julien Bensmail; Florent Foucaud; Monika Pilsniak (Discuss. Math. Graph Theory, 2017)

On q-power cycles in cubic graphs. - Julien Bensmail (Discuss. Math. Graph Theory, 2017)

On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture. - Julien Bensmail; Mohammed Senhaji; Kasper Szabo Lyngsie (Discret. Math. Theor. Comput. Sci., 2017)

Decomposing graphs into a constant number of locally irregular subgraphs. - Julien Bensmail; Martin Merker; Carsten Thomassen (Eur. J. Comb., 2017)

Recovery of disrupted airline operations using k-Maximum Matching in graphs. - Julien Bensmail; Valentin Garnero; Nicolas Nisse; Alexandre Salch; Valentin Weber (Electron. Notes Discret. Math., 2017)

Analogues of Cliques for (m, n)-Colored Mixed Graphs. - Julien Bensmail; Christopher Duffy 001; Sagnik Sen 001 (Graphs Comb., 2017)

A proof of the Barát-Thomassen conjecture. - Julien Bensmail; Ararat Harutyunyan; Tien-Nam Le; Martin Merker; Stéphan Thomassé (J. Comb. Theory B, 2017)

Orienting edges to fight fire in graphs. - Julien Bensmail; Nick Brettell (Australas. J Comb., 2018)

Erratum for "On oriented cliques with respect to push operation". - Julien Bensmail; Soumen Nandi; Sagnik Sen 001 (CoRR, 2018)

Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. - Olivier Baudon; Julien Bensmail; Mohammed Senhaji; Éric Sopena (Discret. Appl. Math., 2018)

On improving matchings in trees, via bounded-length augmentations. - Julien Bensmail; Valentin Garnero; Nicolas Nisse (Discret. Appl. Math., 2018)

On locally irregular decompositions and the 1-2 Conjecture in digraphs. - Olivier Baudon; Julien Bensmail; Jakub Przybylo; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2018)

List coloring digraphs. - Julien Bensmail; Ararat Harutyunyan; Ngoc-Khang Le (J. Graph Theory, 2018)

On the 2-edge-coloured chromatic number of grids. - Julien Bensmail (Australas. J Comb., 2019)

Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. - Julien Bensmail; Ararat Harutyunyan; Tien-Nam Le; Stéphan Thomassé (Comb., 2019)

Edge weights and vertex colours: Minimizing sum count. - Olivier Baudon; Julien Bensmail; Hervé Hocquard; Mohammed Senhaji; Éric Sopena (Discret. Appl. Math., 2019)

A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs. - Julien Bensmail (Discret. Appl. Math., 2019)

Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63]. - Julien Bensmail; Soumen Nandi; Sagnik Sen 001 (Discret. Appl. Math., 2019)

Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture. - Julien Bensmail; Jakub Przybylo (Discret. Appl. Math., 2019)

A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. - Olivier Baudon; Julien Bensmail; Tom Davot; Hervé Hocquard; Jakub Przybylo; Mohammed Senhaji; Éric Sopena; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2019)

Backbone colouring and algorithms for TDMA scheduling. - Julien Bensmail; Thibaut Blanc; Nathann Cohen; Frédéric Havet; Leonardo S. Rocha 001 (Discret. Math. Theor. Comput. Sci., 2019)

A contribution to distinguishing labellings of graphs. - Julien Bensmail (2020)

Enumeration of edge-critical underlying absolute planar cliques for signed graphs. - Julien Bensmail; Soumen Nandi; Mithun Roy; Sagnik Sen 001 (Australas. J Comb., 2020)

Sequential Metric Dimension. - Julien Bensmail; Dorian Mazauric; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (Algorithmica, 2020)

1-2-3 Conjecture in digraphs: More results and directions. - Julien Bensmail; Kasper Szabo Lyngsie (Discret. Appl. Math., 2020)

From light edges to strong edge-colouring of 1-planar graphs. - Julien Bensmail; François Dross; Hervé Hocquard; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2020)

Decomposing Degenerate Graphs into Locally Irregular Subgraphs. - Julien Bensmail; François Dross; Nicolas Nisse (Graphs Comb., 2020)

On the Role of 3's for the 1-2-3 Conjecture. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney (CIAC, 2021)

Further results on an equitable 1-2-3 Conjecture. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse (Discret. Appl. Math., 2021)

On minimizing the maximum color for the 1-2-3 Conjecture. - Julien Bensmail; Bi Li 004; Binlong Li; Nicolas Nisse (Discret. Appl. Math., 2021)

Pushable chromatic number of graphs with degree constraints. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Soumyajit Paul; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2021)

On BMRN*-colouring of planar digraphs. - Julien Bensmail; Foivos Fioravantes (Discret. Math. Theor. Comput. Sci., 2021)

On Generalisations of the AVD Conjecture to Digraphs. - Julien Bensmail; Fionn Mc Inerney (Graphs Comb., 2021)

An Injective Version of the 1-2-3 Conjecture. - Julien Bensmail; Bi Li 004; Binlong Li (Graphs Comb., 2021)

Extending Drawings of Graphs to Arrangements of Pseudolines. - Alan Arroyo; Julien Bensmail; R. Bruce Richter (J. Comput. Geom., 2021)

On the role of 3s for the 1-2-3 Conjecture. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney (Theor. Comput. Sci., 2021)

The Largest Connected Subgraph Game. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse (Algorithmica, 2022)

On Proper Labellings of Graphs with Minimum Label Sum. - Julien Bensmail; Foivos Fioravantes; Nicolas Nisse (Algorithmica, 2022)

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

Going Wide with the 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Pierre-Marie Marcille (Discret. Appl. Math., 2022)

Metric dimension: From graphs to oriented graphs. - Julien Bensmail; Fionn Mc Inerney; Nicolas Nisse (Discret. Appl. Math., 2022)

On the signed chromatic number of some classes of graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2022)

On {a, b}-edge-weightings of bipartite graphs with odd a, b. - Julien Bensmail; Fionn Mc Inerney; Kasper Szabo Lyngsie (Discuss. Math. Graph Theory, 2022)

More aspects of arbitrarily partitionable graphs. - Julien Bensmail; Binlong Li (Discuss. Math. Graph Theory, 2022)

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

On the hardness of determining the irregularity strength of graphs. - Julien Bensmail (Theor. Comput. Sci., 2022)

Generalising the achromatic number to Zaslavsky's colourings of signed graphs. - Julien Bensmail; François Dross; Nacim Oijid; Éric Sopena (Theor. Comput. Sci., 2022)

On a vertex-capturing game. - Julien Bensmail; Fionn Mc Inerney (Theor. Comput. Sci., 2022)

The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures. - Julien Bensmail; Hervé Hocquard; Pierre-Marie Marcille (CALDAM, 2023)

Deciding the Erdős-Pósa Property in 3-Connected Digraphs. - Julien Bensmail; Victor A. Campos; Ana Karolinna Maia; Nicolas Nisse; Ana Silva 001 (WG, 2023)

The Maker-Breaker Largest Connected Subgraph game. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid (Theor. Comput. Sci., 2023)

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)

Some properties of minimal arbitrarily partitionable graphs. - Julien Bensmail (Australas. J Comb., 2023)

On Finding the Best and Worst Orientations for the Metric Dimension. - Júlio Araújo 001; Julien Bensmail; Victor A. Campos; Frédéric Havet; Ana Karolinna Maia; Nicolas Nisse; Ana Silva 001 (Algorithmica, 2023)

An Improved Bound for Equitable Proper Labellings. - Julien Bensmail; Pierre-Marie Marcille (IWOCA, 2024)

Interplays between variations of arbitrarily partitionable graphs under minimality constraints. - Olivier Baudon; Julien Bensmail; Morgan Boivin (Appl. Math. Comput., 2024)

A notion of vertex equitability for proper labellings. - Julien Bensmail (Discret. Appl. Math., 2024)

Oriented total-coloring of oriented graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Ayan Nandy; Théo Pierron; Swathy Prabhu; Sagnik Sen 001 (Discret. Math., 2024)

On a graph labelling conjecture involving coloured labels. - Julien Bensmail (Discuss. Math. Graph Theory, 2024)

A sigma3 condition for arbitrarily partitionable graphs. - Julien Bensmail (Discuss. Math. Graph Theory, 2024)

On proper 2-labellings distinguishing by sums, multisets or products. - Julien Bensmail; Foivos Fioravantes (Discuss. Math. Graph Theory, 2024)

On Inducing Degenerate Sums Through 2-Labellings. - Julien Bensmail; Hervé Hocquard; Pierre-Marie Marcille (Graphs Comb., 2024)

Partitioning vertices and edges of graphs into connected subgraphs. - Olivier Baudon; Julien Bensmail; Lyn Vayssieres (Appl. Math. Comput., 2025)

On 1-2-3 Conjecture-like problems in 2-edge-coloured graphs. - Julien Bensmail; Hervé Hocquard; Clara Marcille; Sven Meyer (Discret. Math., 2025)

Maximising 1’s through proper labellings. - Julien Bensmail (Discuss. Math. Graph Theory, 2025)

Adding direction constraints to the 1-2-3 Conjecture. - Julien Bensmail; Hervé Hocquard; Clara Marcille (Theor. Comput. Sci., 2025)

Highly irregular graph decompositions. - Julien Bensmail; Malory Marin; Leandro Montero; Alexandre Talon (Theor. Comput. Sci., 2025)

Making Graphs Irregular through Irregularising Walks. - Julien Bensmail; Romain Bourneuf; Paul Colinot; Samuel Humeau 002; Timothée Martinod (CoRR, 2025)

Irregularity Notions for Digraphs. - Julien Bensmail; Thomas Filasto; Hervé Hocquard; Clara Marcille (Graphs Comb., 2025)