| On decomposing regular graphs into locally irregular subgraphs O Baudon, J Bensmail, J Przybyło, M Woźniak European Journal of Combinatorics 49, 90-104, 2015 | 68 | 2015 |
| On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture J Bensmail, M Senhaji, KS Lyngsie Discrete Mathematics & Theoretical Computer Science 19 (Graph Theory), 2017 | 59 | 2017 |
| Decomposing graphs into a constant number of locally irregular subgraphs J Bensmail, M Merker, C Thomassen European Journal of Combinatorics 60, 124-134, 2017 | 48 | 2017 |
| On the complexity of determining the irregular chromatic index of a graph O Baudon, J Bensmail, E Sopena Journal of Discrete Algorithms 30, 113-127, 2015 | 38 | 2015 |
| Strong edge-colouring of sparse planar graphs J Bensmail, A Harutyunyan, H Hocquard, P Valicov Discrete Applied Mathematics 179, 229-234, 2014 | 37 | 2014 |
| List coloring digraphs J Bensmail, A Harutyunyan, NK Le Journal of Graph Theory 87 (4), 492-508, 2018 | 31 | 2018 |
| Analogues of Cliques for (m, n)-Colored Mixed Graphs J Bensmail, C Duffy, S Sen Graphs and Combinatorics 33, 735-750, 2017 | 27 | 2017 |
| A proof of the Barát–Thomassen conjecture J Bensmail, A Harutyunyan, TN Le, M Merker, S Thomassé Journal of Combinatorial Theory, Series B 124, 39-55, 2017 | 23 | 2017 |
| Disjoint cycles of different lengths in graphs and digraphs J Bensmail, A Harutyunyan, NK Le, B Li, N Lichiardopol arXiv preprint arXiv:1510.06667, 2015 | 22 | 2015 |
| An oriented version of the 1-2-3 Conjecture O Baudon, J Bensmail, É Sopena Discussiones Mathematicae Graph Theory 35 (1), 141-156, 2015 | 21 | 2015 |
| On the complexity of partitioning a graph into a few connected subgraphs J Bensmail Journal of Combinatorial Optimization 30 (1), 174-187, 2015 | 18 | 2015 |
| Strong edge-coloring of (3, Δ)-bipartite graphs J Bensmail, A Lagoutte, P Valicov Discrete Mathematics 339 (1), 391-398, 2016 | 17 | 2016 |
| The largest connected subgraph game J Bensmail, F Fioravantes, F Mc Inerney, N Nisse Algorithmica 84 (9), 2533-2555, 2022 | 16 | 2022 |
| A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions O Baudon, J Bensmail, T Davot, H Hocquard, J Przybyło, M Senhaji, ... Discrete Mathematics & Theoretical Computer Science 21, 2019 | 16 | 2019 |
| Partitioning powers of traceable or Hamiltonian graphs O Baudon, J Bensmail, J Przybyło, M Woźniak Theoretical Computer Science 520, 133-137, 2014 | 16 | 2014 |
| Sequential metric dimension J Bensmail, D Mazauric, F Mc Inerney, N Nisse, S Pérennes Algorithmica 82 (10), 2867-2901, 2020 | 15 | 2020 |
| Extending drawings of graphs to arrangements of pseudolines A Arroyo, J Bensmail, RB Richter arXiv preprint arXiv:1804.09317, 2018 | 15 | 2018 |
| On a directed variation of the 1-2-3 and 1-2 Conjectures E Barme, J Bensmail, J Przybyło, M Woźniak Discrete Applied Mathematics 217, 123-131, 2017 | 14 | 2017 |
| The complexity of deciding whether a graph admits an orientation with fixed weak diameter J Bensmail, R Duvignau, S Kirgizov Discrete Mathematics & Theoretical Computer Science 17 (Graph Theory), 2016 | 14* | 2016 |
| Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture J Bensmail, A Harutyunyan, TN Le, S Thomassé Combinatorica 39 (2), 239-263, 2019 | 13 | 2019 |
