default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulien Bensmail
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2020
[b1]Julien Bensmail:
A contribution to distinguishing labellings of graphs. University of Côte d'Azur, Nice, France, 2020
Journal Articles
- 2025
- [j76]Julien Bensmail, Hervé Hocquard, Clara Marcille:
Adding direction constraints to the 1-2-3 Conjecture. Theor. Comput. Sci. 1025: 114985 (2025) - 2024
- [j75]Olivier Baudon, Julien Bensmail, Morgan Boivin:
Interplays between variations of arbitrarily partitionable graphs under minimality constraints. Appl. Math. Comput. 475: 128753 (2024) - [j74]Julien Bensmail:
A notion of vertex equitability for proper labellings. Discret. Appl. Math. 346: 228-247 (2024) - [j73]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): 114174 (2024) - [j72]Julien Bensmail
:
On a graph labelling conjecture involving coloured labels. Discuss. Math. Graph Theory 44(1): 231 (2024) - [j71]Julien Bensmail:
A \sigma3 condition for arbitrarily partitionable graphs. Discuss. Math. Graph Theory 44(2): 755 (2024) - [j70]Julien Bensmail, Foivos Fioravantes:
On proper 2-labellings distinguishing by sums, multisets or products. Discuss. Math. Graph Theory 44(3): 863 (2024) - [j69]Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
On Inducing Degenerate Sums Through 2-Labellings. Graphs Comb. 40(2): 23 (2024) - 2023
- [j68]Julien Bensmail:
Some properties of minimal arbitrarily partitionable graphs. Australas. J Comb. 86: 149-168 (2023) - [j67]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): 2962-3002 (2023) - [j66]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A Proof of the Multiplicative 1-2-3 Conjecture. Comb. 43(1): 37-55 (2023) - [j65]Julien Bensmail, Tapas Das, Dimitri Lajou, Soumen Nandi, Sagnik Sen:
On the pushable chromatic number of various types of grids. Discret. Appl. Math. 329: 140-154 (2023) - [j64]Julien Bensmail, Hervé Hocquard, Dimitri Lajou:
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs. Theor. Comput. Sci. 939: 105-118 (2023) - [j63]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid:
The Maker-Breaker Largest Connected Subgraph game. Theor. Comput. Sci. 943: 102-120 (2023) - 2022
- [j62]Julien Bensmail, Foivos Fioravantes, Nicolas Nisse:
On Proper Labellings of Graphs with Minimum Label Sum. Algorithmica 84(4): 1030-1063 (2022) - [j61]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. Algorithmica 84(9): 2533-2555 (2022) - [j60]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
Further evidence towards the multiplicative 1-2-3 Conjecture. Discret. Appl. Math. 307: 135-144 (2022) - [j59]Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
Going Wide with the 1-2-3 Conjecture. Discret. Appl. Math. 320: 15-32 (2022) - [j58]Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse:
Metric dimension: From graphs to oriented graphs. Discret. Appl. Math. 323: 28-42 (2022) - [j57]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): 112664 (2022) - [j56]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): 159-185 (2022) - [j55]Julien Bensmail, Binlong Li:
More aspects of arbitrarily partitionable graphs. Discuss. Math. Graph Theory 42(4): 1237-1261 (2022) - [j54]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
On a List Variant of the Multiplicative 1-2-3 Conjecture. Graphs Comb. 38(3): 88 (2022) - [j53]Julien Bensmail, Fionn Mc Inerney:
On a vertex-capturing game. Theor. Comput. Sci. 923: 27-46 (2022) - [j52]Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena:
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. Theor. Comput. Sci. 923: 196-221 (2022) - [j51]Julien Bensmail:
On the hardness of determining the irregularity strength of graphs. Theor. Comput. Sci. 937: 96-107 (2022) - 2021
- [j50]Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse:
On minimizing the maximum color for the 1-2-3 Conjecture. Discret. Appl. Math. 289: 32-51 (2021) - [j49]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
Further results on an equitable 1-2-3 Conjecture. Discret. Appl. Math. 297: 1-20 (2021) - [j48]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): 112151 (2021) - [j47]Julien Bensmail, Foivos Fioravantes:
On BMRN*-colouring of planar digraphs. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j46]Julien Bensmail, Bi Li, Binlong Li:
An Injective Version of the 1-2-3 Conjecture. Graphs Comb. 37(1): 281-311 (2021) - [j45]Julien Bensmail, Fionn Mc Inerney:
On Generalisations of the AVD Conjecture to Digraphs. Graphs Comb. 37(2): 545-558 (2021) - [j44]Alan Arroyo, Julien Bensmail, R. Bruce Richter:
Extending Drawings of Graphs to Arrangements of Pseudolines. J. Comput. Geom. 12(2): 3-24 (2021) - [j43]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney:
On the role of 3s for the 1-2-3 Conjecture. Theor. Comput. Sci. 892: 238-257 (2021) - 2020
- [j42]Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen:
Enumeration of edge-critical underlying absolute planar cliques for signed graphs. Australas. J Comb. 77: 117-135 (2020) - [j41]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. Algorithmica 82(10): 2867-2901 (2020) - [j40]Julien Bensmail, Kasper Szabo Lyngsie:
1-2-3 Conjecture in digraphs: More results and directions. Discret. Appl. Math. 284: 124-137 (2020) - [j39]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) - [j38]Julien Bensmail, François Dross, Nicolas Nisse:
Decomposing Degenerate Graphs into Locally Irregular Subgraphs. Graphs Comb. 36(6): 1869-1889 (2020) - 2019
- [j37]Julien Bensmail:
On the 2-edge-coloured chromatic number of grids. Australas. J Comb. 75: 365-384 (2019) - [j36]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): 239-263 (2019) - [j35]Julien Bensmail:
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs. Discret. Appl. Math. 257: 31-39 (2019) - [j34]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: 276-278 (2019) - [j33]Julien Bensmail, Jakub Przybylo:
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture. Discret. Appl. Math. 268: 1-9 (2019) - [j32]Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena:
Edge weights and vertex colours: Minimizing sum count. Discret. Appl. Math. 270: 13-24 (2019) - [j31]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) - [j30]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) - 2018
- [j29]Julien Bensmail, Nick Brettell:
Orienting edges to fight fire in graphs. Australas. J Comb. 71: 12-42 (2018) - [j28]Julien Bensmail, Valentin Garnero, Nicolas Nisse:
On improving matchings in trees, via bounded-length augmentations. Discret. Appl. Math. 250: 110-129 (2018) - [j27]Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena:
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. Discret. Appl. Math. 251: 83-92 (2018) - [j26]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) - [j25]Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le:
List coloring digraphs. J. Graph Theory 87(4): 492-508 (2018) - 2017
- [j24]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): 4 (2017) - [j23]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: 123-131 (2017) - [j22]Julien Bensmail, Soumen Nandi, Sagnik Sen:
On oriented cliques with respect to push operation. Discret. Appl. Math. 232: 50-63 (2017) - [j21]Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak:
Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory 37(1): 89-115 (2017) - [j20]Julien Bensmail:
On q-power cycles in cubic graphs. Discuss. Math. Graph Theory 37(1): 211-220 (2017) - [j19]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) - [j18]Julien Bensmail, Martin Merker, Carsten Thomassen:
Decomposing graphs into a constant number of locally irregular subgraphs. Eur. J. Comb. 60: 124-134 (2017) - [j17]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: 3-8 (2017) - [j16]Julien Bensmail, Christopher Duffy, Sagnik Sen:
Analogues of Cliques for (m, n)-Colored Mixed Graphs. Graphs Comb. 33(4): 735-750 (2017) - [j15]Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé:
A proof of the Barát-Thomassen conjecture. J. Comb. Theory B 124: 39-55 (2017) - 2016
- [j14]Julien Bensmail:
On three polynomial kernels of sequences for arbitrarily partitionable graphs. Discret. Appl. Math. 202: 19-29 (2016) - [j13]Julien Bensmail, Aurélie Lagoutte, Petru Valicov:
Strong edge-coloring of (3, Δ)-bipartite graphs. Discret. Math. 339(1): 391-398 (2016) - [j12]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): 31-42 (2016) - [j11]Julien Bensmail, Brett Stevens:
Edge-partitioning graphs into regular and locally irregular components. Discret. Math. Theor. Comput. Sci. 17(3): 43-58 (2016) - [j10]Julien Bensmail, Gabriel Renault:
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs. Graphs Comb. 32(5): 1707-1721 (2016) - 2015
- [j9]Olivier Baudon, Julien Bensmail, Éric Sopena:
An oriented version of the 1-2-3 Conjecture. Discuss. Math. Graph Theory 35(1): 141-156 (2015) - [j8]Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49: 90-104 (2015) - [j7]Julien Bensmail, Marthe Bonamy, Hervé Hocquard:
Strong edge coloring sparse graphs. Electron. Notes Discret. Math. 49: 773-778 (2015) - [j6]Julien Bensmail:
On the complexity of partitioning a graph into a few connected subgraphs. J. Comb. Optim. 30(1): 174-187 (2015) - [j5]Olivier Baudon, Julien Bensmail, Éric Sopena:
On the complexity of determining the irregular chromatic index of a graph. J. Discrete Algorithms 30: 113-127 (2015) - 2014
- [j4]Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov:
Strong edge-colouring of sparse planar graphs. Discret. Appl. Math. 179: 229-234 (2014) - [j3]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): 225-232 (2014) - [j2]Olivier Baudon, Julien Bensmail, Éric Sopena:
Partitioning Harary graphs into connected subgraphs containing prescribed vertices. Discret. Math. Theor. Comput. Sci. 16(3): 263-278 (2014) - [j1]Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
Partitioning powers of traceable or hamiltonian graphs. Theor. Comput. Sci. 520: 133-137 (2014)
Conference and Workshop Papers
- 2024
- [c10]Julien Bensmail, Pierre-Marie Marcille:
An Improved Bound for Equitable Proper Labellings. IWOCA 2024: 82-97 - 2023
- [c9]Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures. CALDAM 2023: 204-215 - [c8]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: 59-71 - 2022
- [c7]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A Proof of the Multiplicative 1-2-3 Conjecture. CALDAM 2022: 3-14 - 2021
- [c6]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney:
On the Role of 3's for the 1-2-3 Conjecture. CIAC 2021: 103-115 - [c5]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. WG 2021: 296-307 - 2020
- [c4]Alan Arroyo, Julien Bensmail, R. Bruce Richter:
Extending Drawings of Graphs to Arrangements of Pseudolines. SoCG 2020: 9:1-9:14 - [c3]Julien Bensmail, Foivos Fioravantes, Nicolas Nisse:
On Proper Labellings of Graphs with Minimum Label Sum. IWOCA 2020: 56-68 - 2019
- [c2]Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse:
Metric Dimension: from Graphs to Oriented Graphs. LAGOS 2019: 111-123 - 2018
- [c1]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. WAOA 2018: 36-50
Informal and Other Publications
- 2021
- [i11]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A proof of the Multiplicative 1-2-3 Conjecture. CoRR abs/2108.10554 (2021) - [i10]Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena:
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. CoRR abs/2109.13627 (2021) - 2020
- [i9]Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
Further Evidence Towards the Multiplicative 1-2-3 Conjecture. CoRR abs/2004.09090 (2020) - [i8]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena:
On the signed chromatic number of some classes of graphs. CoRR abs/2009.12059 (2020) - 2019
- [i7]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena:
Pushable chromatic number of graphs with degree constraints. CoRR abs/1911.09909 (2019) - 2018
- [i6]Julien Bensmail, Soumen Nandi, Sagnik Sen:
Erratum for "On oriented cliques with respect to push operation". CoRR abs/1810.08660 (2018) - 2015
- [i5]Julien Bensmail, Nick Brettell:
Orienting edges to fight fire in graphs. CoRR abs/1506.07338 (2015) - [i4]Julien Bensmail, Soumen Nandi, Sagnik Sen:
On oriented cliques with respect to push operation. CoRR abs/1511.08672 (2015) - 2014
- [i3]Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov:
Strong edge-colouring of sparse planar graphs. CoRR abs/1401.4568 (2014) - [i2]Julien Bensmail, Christopher Duffy, Sagnik Sen:
On cliques of signed and switchable signed graphs. CoRR abs/1411.7376 (2014) - [i1]Julien Bensmail, Aurélie Lagoutte, Petru Valicov:
Strong edge-coloring of $(3, Δ)$-bipartite graphs. CoRR abs/1412.2624 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-03 21:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
