Julien Bensmail

111 papers A* 1B 4C 4Journal 99Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
An improved bound for equitable proper labellings.
Discret. Math.
Julien Bensmail, Clara Marcille
2026 B conf
Graph Irregularity via Edge Deletions.
WALCOM
Julien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille, Nacim Oijid
2026 J jnl
Making graphs irregular through irregularising walks.
Theor. Comput. Sci.
Julien Bensmail, Romain Bourneuf, Paul Colinot, Samuel Humeau, Timothée Martinod
2026 J jnl
The strong ( 2 , 2 ) -Conjecture for more classes of graphs.
Discret. Appl. Math.
Olivier Baudon, Julien Bensmail, Morgan Boivin, Igor Grzelec, Clara Marcille
2026 J jnl
Toughness properties of arbitrarily partitionable graphs.
Discret. Appl. Math.
Julien Bensmail
2025 J jnl
Adding direction constraints to the 1-2-3 Conjecture.
Theor. Comput. Sci.
Julien Bensmail, Hervé Hocquard, Clara Marcille
2025 J jnl
Graph Irregularity via Edge Deletions.
CoRR
Julien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille, Nacim Oijid
2025 J jnl
Highly irregular graph decompositions.
Theor. Comput. Sci.
Julien Bensmail, Malory Marin, Leandro Montero, Alexandre Talon
2025 J jnl
Irregularity Notions for Digraphs.
Graphs Comb.
Julien Bensmail, Thomas Filasto, Hervé Hocquard, Clara Marcille
2025 J jnl
Making Graphs Irregular through Irregularising Walks.
CoRR
Julien Bensmail, Romain Bourneuf, Paul Colinot, Samuel Humeau, Timothée Martinod
2025 J jnl
Maximising 1’s through proper labellings.
Discuss. Math. Graph Theory
Julien Bensmail
2025 J jnl
On 1-2-3 Conjecture-like problems in 2-edge-coloured graphs.
Discret. Math.
Julien Bensmail, Hervé Hocquard, Clara Marcille, Sven Meyer
2025 J jnl
Partitioning vertices and edges of graphs into connected subgraphs.
Appl. Math. Comput.
Olivier Baudon, Julien Bensmail, Lyn Vayssieres
2025 J jnl
Pushing Vertices to Make Graphs Irregular.
Discret. Math. Theor. Comput. Sci.
Julien Bensmail, Clara Marcille, Mano Orenga
2024 J jnl
A
Discuss. Math. Graph Theory
Julien Bensmail
2024 J jnl
A notion of vertex equitability for proper labellings.
Discret. Appl. Math.
Julien Bensmail
2024 C conf
An Improved Bound for Equitable Proper Labellings.
IWOCA
Julien Bensmail, Pierre-Marie Marcille
2024 J jnl
Interplays between variations of arbitrarily partitionable graphs under minimality constraints.
Appl. Math. Comput.
Olivier Baudon, Julien Bensmail, Morgan Boivin
2024 J jnl
On Inducing Degenerate Sums Through 2-Labellings.
Graphs Comb.
Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
2024 J jnl
On a graph labelling conjecture involving coloured labels.
Discuss. Math. Graph Theory
Julien Bensmail
2024 J jnl
On proper
Discuss. Math. Graph Theory
Julien Bensmail, Foivos Fioravantes
2024 J jnl
Oriented total-coloring of oriented graphs.
Discret. Math.
Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen
2023 J jnl
A Proof of the Multiplicative 1-2-3 Conjecture.
Comb.
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2023 B conf
Deciding the Erdős-Pósa Property in 3-Connected Digraphs.
WG
Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
2023 J jnl
On Finding the Best and Worst Orientations for the Metric Dimension.
Algorithmica
Júlio Araújo, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
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
2023 J jnl
Some properties of minimal arbitrarily partitionable graphs.
Australas. J Comb.
Julien Bensmail
2023 J jnl
The Maker-Breaker Largest Connected Subgraph game.
Theor. Comput. Sci.
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid
2023 — conf
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures.
CALDAM
Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
2022 — conf
A Proof of the Multiplicative 1-2-3 Conjecture.
CALDAM
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
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
Generalising the achromatic number to Zaslavsky's colourings of signed graphs.
Theor. Comput. Sci.
Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena
2022 J jnl
Going Wide with the 1-2-3 Conjecture.
Discret. Appl. Math.
Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
2022 J jnl
Metric dimension: From graphs to oriented graphs.
Discret. Appl. Math.
Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse
2022 J jnl
More aspects of arbitrarily partitionable graphs.
Discuss. Math. Graph Theory
Julien Bensmail, Binlong Li
2022 J jnl
On Proper Labellings of Graphs with Minimum Label Sum.
Algorithmica
Julien Bensmail, Foivos Fioravantes, Nicolas Nisse
2022 J jnl
On a List Variant of the Multiplicative 1-2-3 Conjecture.
Graphs Comb.
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2022 J jnl
On a vertex-capturing game.
Theor. Comput. Sci.
Julien Bensmail, Fionn Mc Inerney
2022 J jnl
On the hardness of determining the irregularity strength of graphs.
Theor. Comput. Sci.
Julien Bensmail
2022 J jnl
On the signed chromatic number of some classes of graphs.
Discret. Math.
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
2022 J jnl
On {a, b}-edge-weightings of bipartite graphs with odd a, b.
Discuss. Math. Graph Theory
Julien Bensmail, Fionn Mc Inerney, Kasper Szabo Lyngsie
2022 J jnl
The Largest Connected Subgraph Game.
Algorithmica
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
2021 J jnl
A proof of the Multiplicative 1-2-3 Conjecture.
CoRR
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2021 J jnl
An Injective Version of the 1-2-3 Conjecture.
Graphs Comb.
Julien Bensmail, Bi Li, Binlong Li
2021 J jnl
Extending Drawings of Graphs to Arrangements of Pseudolines.
J. Comput. Geom.
Alan Arroyo, Julien Bensmail, R. Bruce Richter
2021 J jnl
Further results on an equitable 1-2-3 Conjecture.
Discret. Appl. Math.
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
2021 J jnl
Generalising the achromatic number to Zaslavsky's colourings of signed graphs.
CoRR
Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena
2021 J jnl
On BMRN*-colouring of planar digraphs.
Discret. Math. Theor. Comput. Sci.
Julien Bensmail, Foivos Fioravantes
2021 J jnl
On Generalisations of the AVD Conjecture to Digraphs.
Graphs Comb.
Julien Bensmail, Fionn Mc Inerney
2021 J jnl
On minimizing the maximum color for the 1-2-3 Conjecture.
Discret. Appl. Math.
Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse
2021 C conf
On the Role of 3's for the 1-2-3 Conjecture.
CIAC
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney
2021 J jnl
On the role of 3s for the 1-2-3 Conjecture.
Theor. Comput. Sci.
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney
2021 J jnl
Pushable chromatic number of graphs with degree constraints.
Discret. Math.
Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena
2021 B conf
The Largest Connected Subgraph Game.
WG
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
2020 J jnl
1-2-3 Conjecture in digraphs: More results and directions.
Discret. Appl. Math.
Julien Bensmail, Kasper Szabo Lyngsie
2020 — book
A contribution to distinguishing labellings of graphs.
Julien Bensmail
2020 J jnl
Decomposing Degenerate Graphs into Locally Irregular Subgraphs.
Graphs Comb.
Julien Bensmail, François Dross, Nicolas Nisse
2020 J jnl
Enumeration of edge-critical underlying absolute planar cliques for signed graphs.
Australas. J Comb.
Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen
2020 A* conf
Extending Drawings of Graphs to Arrangements of Pseudolines.
SoCG
Alan Arroyo, Julien Bensmail, R. Bruce Richter
2020 J jnl
From light edges to strong edge-colouring of 1-planar graphs.
Discret. Math. Theor. Comput. Sci.
Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena
2020 J jnl
Further Evidence Towards the Multiplicative 1-2-3 Conjecture.
CoRR
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
2020 C conf
On Proper Labellings of Graphs with Minimum Label Sum.
IWOCA
Julien Bensmail, Foivos Fioravantes, Nicolas Nisse
2020 J jnl
On the signed chromatic number of some classes of graphs.
CoRR
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
2020 J jnl
Sequential Metric Dimension.
Algorithmica
Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
2019 J jnl
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs.
Discret. Appl. Math.
Julien Bensmail
2019 J jnl
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.
Discret. Math. Theor. Comput. Sci.
Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2019 J jnl
Backbone colouring and algorithms for TDMA scheduling.
Discret. Math. Theor. Comput. Sci.
Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo S. Rocha
2019 J jnl
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture.
Discret. Appl. Math.
Julien Bensmail, Jakub Przybylo
2019 J jnl
Edge weights and vertex colours: Minimizing sum count.
Discret. Appl. Math.
Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena
2019 J jnl
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture.
Comb.
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé
2019 J jnl
Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63].
Discret. Appl. Math.
Julien Bensmail, Soumen Nandi, Sagnik Sen
2019 C conf
Metric Dimension: from Graphs to Oriented Graphs.
LAGOS
Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse
2019 J jnl
On the 2-edge-coloured chromatic number of grids.
Australas. J Comb.
Julien Bensmail
2019 J jnl
Pushable chromatic number of graphs with degree constraints.
CoRR
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena
2018 J jnl
Erratum for "On oriented cliques with respect to push operation".
CoRR
Julien Bensmail, Soumen Nandi, Sagnik Sen
2018 J jnl
List coloring digraphs.
J. Graph Theory
Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le
2018 J jnl
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture.
Discret. Appl. Math.
Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena
2018 J jnl
On improving matchings in trees, via bounded-length augmentations.
Discret. Appl. Math.
Julien Bensmail, Valentin Garnero, Nicolas Nisse
2018 J jnl
On locally irregular decompositions and the 1-2 Conjecture in digraphs.
Discret. Math. Theor. Comput. Sci.
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2018 J jnl
Orienting edges to fight fire in graphs.
Australas. J Comb.
Julien Bensmail, Nick Brettell
2018 B conf
Sequential Metric Dimension.
WAOA
Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
2017 J jnl
A proof of the Barát-Thomassen conjecture.
J. Comb. Theory B
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé
2017 J jnl
Analogues of Cliques for (m, n)-Colored Mixed Graphs.
Graphs Comb.
Julien Bensmail, Christopher Duffy, Sagnik Sen
2017 J jnl
Decomposing graphs into a constant number of locally irregular subgraphs.
Eur. J. Comb.
Julien Bensmail, Martin Merker, Carsten Thomassen
2017 J jnl
Disjoint Cycles of Different Lengths in Graphs and Digraphs.
Electron. J. Comb.
Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le, Binlong Li, Nicolas Lichiardopol
2017 J jnl
On
Discuss. Math. Graph Theory
Julien Bensmail
2017 J jnl
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture.
Discret. Math. Theor. Comput. Sci.
Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie
2017 J jnl
On a directed variation of the 1-2-3 and 1-2 Conjectures.
Discret. Appl. Math.
Emma Barme, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2017 J jnl
On oriented cliques with respect to push operation.
Discret. Appl. Math.
Julien Bensmail, Soumen Nandi, Sagnik Sen
2017 J jnl
Recovery of disrupted airline operations using k-Maximum Matching in graphs.
Electron. Notes Discret. Math.
Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch, Valentin Weber
2017 J jnl
Structural properties of recursively partitionable graphs with connectivity 2.
Discuss. Math. Graph Theory
Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
2016 J jnl
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs.
Graphs Comb.
Julien Bensmail, Gabriel Renault
2016 J jnl
Edge-partitioning graphs into regular and locally irregular components.
Discret. Math. Theor. Comput. Sci.
Julien Bensmail, Brett Stevens
2016 J jnl
On three polynomial kernels of sequences for arbitrarily partitionable graphs.
Discret. Appl. Math.
Julien Bensmail
2016 J jnl
Strong edge-coloring of (3, Δ)-bipartite graphs.
Discret. Math.
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
2016 J jnl
The complexity of deciding whether a graph admits an orientation with fixed weak diameter.
Discret. Math. Theor. Comput. Sci.
Julien Bensmail, Romaric Duvignau, Sergey Kirgizov
2015 J jnl
An oriented version of the 1-2-3 Conjecture.
Discuss. Math. Graph Theory
Olivier Baudon, Julien Bensmail, Éric Sopena
2015 J jnl
On decomposing regular graphs into locally irregular subgraphs.
Eur. J. Comb.
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2015 J jnl
On oriented cliques with respect to push operation.
CoRR
Julien Bensmail, Soumen Nandi, Sagnik Sen
2015 J jnl
On the complexity of determining the irregular chromatic index of a graph.
J. Discrete Algorithms
Olivier Baudon, Julien Bensmail, Éric Sopena
2015 J jnl
On the complexity of partitioning a graph into a few connected subgraphs.
J. Comb. Optim.
Julien Bensmail
2015 J jnl
Orienting edges to fight fire in graphs.
CoRR
Julien Bensmail, Nick Brettell
2015 J jnl
Strong edge coloring sparse graphs.
Electron. Notes Discret. Math.
Julien Bensmail, Marthe Bonamy, Hervé Hocquard
2014 J jnl
On cliques of signed and switchable signed graphs.
CoRR
Julien Bensmail, Christopher Duffy, Sagnik Sen
2014 J jnl
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.
Discret. Math. Theor. Comput. Sci.
Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak
2014 J jnl
Partitioning Harary graphs into connected subgraphs containing prescribed vertices.
Discret. Math. Theor. Comput. Sci.
Olivier Baudon, Julien Bensmail, Éric Sopena
2014 J jnl
Partitioning powers of traceable or hamiltonian graphs.
Theor. Comput. Sci.
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2014 J jnl
Strong edge-coloring of $(3, Δ)$-bipartite graphs.
CoRR
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
2014 J jnl
Strong edge-colouring of sparse planar graphs.
CoRR
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
2014 J jnl
Strong edge-colouring of sparse planar graphs.
Discret. Appl. Math.
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov