Julien Bensmail

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 82

Top Topics

Polynomial Kernels

Connected Subgraphs

Bipartite Graph

Structural Properties

Top Venues

Discret. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Discuss. Math. Graph Theory

Publications

Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
On Inducing Degenerate Sums Through 2-Labellings. Graphs Comb. 40 (2) (2024)
Julien Bensmail, Pierre-Marie Marcille
An Improved Bound for Equitable Proper Labellings. IWOCA (2024)
Julien Bensmail
A notion of vertex equitability for proper labellings. Discret. Appl. Math. 346 (2024)
Julien Bensmail, Foivos Fioravantes
-labellings distinguishing by sums, multisets or products. Discuss. Math. Graph Theory 44 (3) (2024)
Julien Bensmail
condition for arbitrarily partitionable graphs. Discuss. Math. Graph Theory 44 (2) (2024)
Olivier Baudon, Julien Bensmail, Morgan Boivin
Interplays between variations of arbitrarily partitionable graphs under minimality constraints. Appl. Math. Comput. 475 (2024)
Julien Bensmail
On a graph labelling conjecture involving coloured labels. Discuss. Math. Graph Theory 44 (1) (2024)
Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen
Oriented total-coloring of oriented graphs. Discret. Math. 347 (12) (2024)
Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
Deciding the Erdős-Pósa Property in 3-Connected Digraphs. WG (2023)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
A Proof of the Multiplicative 1-2-3 Conjecture. Comb. 43 (1) (2023)
Júlio Araújo, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
On Finding the Best and Worst Orientations for the Metric Dimension. Algorithmica 85 (10) (2023)
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid
The Maker-Breaker Largest Connected Subgraph game. Theor. Comput. Sci. 943 (2023)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs. Theor. Comput. Sci. 939 (2023)
Julien Bensmail, Tapas Das, Dimitri Lajou, Soumen Nandi, Sagnik Sen
On the pushable chromatic number of various types of grids. Discret. Appl. Math. 329 (2023)
Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures. CALDAM (2023)
Julien Bensmail
Some properties of minimal arbitrarily partitionable graphs. Australas. J Comb. 86 (2023)
Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. Theor. Comput. Sci. 923 (2022)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
A Proof of the Multiplicative 1-2-3 Conjecture. CALDAM (2022)
Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse
Metric dimension: From graphs to oriented graphs. Discret. Appl. Math. 323 (2022)
Julien Bensmail
On the hardness of determining the irregularity strength of graphs. Theor. Comput. Sci. 937 (2022)
Julien Bensmail, Binlong Li
More aspects of arbitrarily partitionable graphs. Discuss. Math. Graph Theory 42 (4) (2022)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
Further evidence towards the multiplicative 1-2-3 Conjecture. Discret. Appl. Math. 307 (2022)
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
The Largest Connected Subgraph Game. Algorithmica 84 (9) (2022)
Julien Bensmail, Fionn Mc Inerney
On a vertex-capturing game. Theor. Comput. Sci. 923 (2022)
Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
Going Wide with the 1-2-3 Conjecture. Discret. Appl. Math. 320 (2022)
Julien Bensmail, Fionn Mc Inerney, Kasper Szabo Lyngsie
On {a, b}-edge-weightings of bipartite graphs with odd a, b. Discuss. Math. Graph Theory 42 (1) (2022)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
On a List Variant of the Multiplicative 1-2-3 Conjecture. Graphs Comb. 38 (3) (2022)
Julien Bensmail, Foivos Fioravantes, Nicolas Nisse
On Proper Labellings of Graphs with Minimum Label Sum. Algorithmica 84 (4) (2022)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
On the signed chromatic number of some classes of graphs. Discret. Math. 345 (2) (2022)
Julien Bensmail, Bi Li, Binlong Li
An Injective Version of the 1-2-3 Conjecture. Graphs Comb. 37 (1) (2021)
Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse
On minimizing the maximum color for the 1-2-3 Conjecture. Discret. Appl. Math. 289 (2021)
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
The Largest Connected Subgraph Game. WG (2021)
Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena
Pushable chromatic number of graphs with degree constraints. Discret. Math. 344 (1) (2021)
Julien Bensmail, Foivos Fioravantes
On BMRN*-colouring of planar digraphs. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney
On the Role of 3's for the 1-2-3 Conjecture. CIAC (2021)
Julien Bensmail, Fionn Mc Inerney
On Generalisations of the AVD Conjecture to Digraphs. Graphs Comb. 37 (2) (2021)
Alan Arroyo, Julien Bensmail, R. Bruce Richter
Extending Drawings of Graphs to Arrangements of Pseudolines. J. Comput. Geom. 12 (2) (2021)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
A proof of the Multiplicative 1-2-3 Conjecture. CoRR (2021)
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney
On the role of 3s for the 1-2-3 Conjecture. Theor. Comput. Sci. 892 (2021)
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
Further results on an equitable 1-2-3 Conjecture. Discret. Appl. Math. 297 (2021)
Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. CoRR (2021)
Julien Bensmail, Foivos Fioravantes, Nicolas Nisse
On Proper Labellings of Graphs with Minimum Label Sum. IWOCA (2020)
Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena
From light edges to strong edge-colouring of 1-planar graphs. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Sequential Metric Dimension. Algorithmica 82 (10) (2020)
Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen
Enumeration of edge-critical underlying absolute planar cliques for signed graphs. Australas. J Comb. 77 (2020)
Julien Bensmail, François Dross, Nicolas Nisse
Decomposing Degenerate Graphs into Locally Irregular Subgraphs. Graphs Comb. 36 (6) (2020)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
On the signed chromatic number of some classes of graphs. CoRR (2020)
Julien Bensmail, Kasper Szabo Lyngsie
1-2-3 Conjecture in digraphs: More results and directions. Discret. Appl. Math. 284 (2020)
Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena
Further Evidence Towards the Multiplicative 1-2-3 Conjecture. CoRR (2020)
Alan Arroyo, Julien Bensmail, R. Bruce Richter
Extending Drawings of Graphs to Arrangements of Pseudolines. SoCG (2020)
Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo S. Rocha
Backbone colouring and algorithms for TDMA scheduling. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Julien Bensmail, Jakub Przybylo
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture. Discret. Appl. Math. 268 (2019)
Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena
Edge weights and vertex colours: Minimizing sum count. Discret. Appl. Math. 270 (2019)
Julien Bensmail
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs. Discret. Appl. Math. 257 (2019)
Julien Bensmail
On the 2-edge-coloured chromatic number of grids. Australas. J Comb. 75 (2019)
Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse
Metric Dimension: from Graphs to Oriented Graphs. LAGOS (2019)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena
Pushable chromatic number of graphs with degree constraints. CoRR (2019)
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. Comb. 39 (2) (2019)
Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Julien Bensmail, Soumen Nandi, Sagnik Sen
Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63]. Discret. Appl. Math. 258 (2019)
Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
Sequential Metric Dimension. WAOA (2018)
Julien Bensmail, Nick Brettell
Orienting edges to fight fire in graphs. Australas. J Comb. 71 (2018)
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
On locally irregular decompositions and the 1-2 Conjecture in digraphs. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. Discret. Appl. Math. 251 (2018)
Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le
List coloring digraphs. J. Graph Theory 87 (4) (2018)
Julien Bensmail, Valentin Garnero, Nicolas Nisse
On improving matchings in trees, via bounded-length augmentations. Discret. Appl. Math. 250 (2018)
Julien Bensmail, Soumen Nandi, Sagnik Sen
Erratum for "On oriented cliques with respect to push operation". CoRR (2018)
Julien Bensmail, Soumen Nandi, Sagnik Sen
On oriented cliques with respect to push operation. Discret. Appl. Math. 232 (2017)
Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch, Valentin Weber
Recovery of disrupted airline operations using k-Maximum Matching in graphs. Electron. Notes Discret. Math. 62 (2017)
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé
A proof of the Barát-Thomassen conjecture. J. Comb. Theory, Ser. B 124 (2017)
Emma Barme, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
On a directed variation of the 1-2-3 and 1-2 Conjectures. Discret. Appl. Math. 217 (2017)
Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Julien Bensmail, Martin Merker, Carsten Thomassen
Decomposing graphs into a constant number of locally irregular subgraphs. Eur. J. Comb. 60 (2017)
Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le, Binlong Li, Nicolas Lichiardopol
Disjoint Cycles of Different Lengths in Graphs and Digraphs. Electron. J. Comb. 24 (4) (2017)
Julien Bensmail, Christopher Duffy, Sagnik Sen
Analogues of Cliques for (m, n)-Colored Mixed Graphs. Graphs Comb. 33 (4) (2017)
Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory 37 (1) (2017)
Julien Bensmail
-power cycles in cubic graphs. Discuss. Math. Graph Theory 37 (1) (2017)
Julien Bensmail, Romaric Duvignau, Sergey Kirgizov
The complexity of deciding whether a graph admits an orientation with fixed weak diameter. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
Strong edge-coloring of (3, Δ)-bipartite graphs. Discret. Math. 339 (1) (2016)
Julien Bensmail
On three polynomial kernels of sequences for arbitrarily partitionable graphs. Discret. Appl. Math. 202 (2016)
Julien Bensmail, Brett Stevens
Edge-partitioning graphs into regular and locally irregular components. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Julien Bensmail, Gabriel Renault
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs. Graphs Comb. 32 (5) (2016)
Julien Bensmail, Soumen Nandi, Sagnik Sen
On oriented cliques with respect to push operation. CoRR (2015)
Olivier Baudon, Julien Bensmail, Éric Sopena
An oriented version of the 1-2-3 Conjecture. Discuss. Math. Graph Theory 35 (1) (2015)
Olivier Baudon, Julien Bensmail, Éric Sopena
On the complexity of determining the irregular chromatic index of a graph. J. Discrete Algorithms 30 (2015)
Julien Bensmail
On the complexity of partitioning a graph into a few connected subgraphs. J. Comb. Optim. 30 (1) (2015)
Julien Bensmail, Marthe Bonamy, Hervé Hocquard
Strong edge coloring sparse graphs. Electron. Notes Discret. Math. 49 (2015)
Julien Bensmail, Nick Brettell
Orienting edges to fight fire in graphs. CoRR (2015)
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49 (2015)
Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
Partitioning powers of traceable or hamiltonian graphs. Theor. Comput. Sci. 520 (2014)
Julien Bensmail, Christopher Duffy, Sagnik Sen
On cliques of signed and switchable signed graphs. CoRR (2014)
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
Strong edge-colouring of sparse planar graphs. Discret. Appl. Math. 179 (2014)
Olivier Baudon, Julien Bensmail, Éric Sopena
Partitioning Harary graphs into connected subgraphs containing prescribed vertices. Discret. Math. Theor. Comput. Sci. 16 (3) (2014)
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
Strong edge-colouring of sparse planar graphs. CoRR (2014)
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
Strong edge-coloring of $(3, Δ)$-bipartite graphs. CoRR (2014)