Julien Bensmail

Assistant professor @ Université Côte d'Azur:

  • Research @ I3S/INRIA, joint-project COATI;
  • Teaching @ IUT Nice Côte d'Azur, département QLIO.

  • Contact information:

    • I3S/INRIA, joint-project COATI.
    • 2004, route des Lucioles, F-06902 Sophia-Antipolis, France.
    • Office: Lagrange L007.
    • Phone: (+33)4 92 38 77 72.
    • Email: jbensmail @ unice . fr.

  • Research:

    My research activities focus on several colouring/decomposition/partition problems of graph theory, in particular on the associated structural and algorithmic aspects.

    1. 31. J. Bensmail. A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs. Discrete Applied Mathematics, to appear.
    2. 30. O. Baudon, J. Bensmail, M. Senhaji, É. Sopena. Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 Conjecture. Discrete Applied Mathematics, to appear.
    3. 29. J. Bensmail, A. Harutyunyan, T.-N. Le, S. Thomassé. Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Combinatorica, to appear.

    4. 28. J. Bensmail, V. Garnero, N. Nisse. On improving matchings in trees, via bounded-length augmentations. Discrete Applied Mathematics, 250:110-129, 2018.
    5. 27. O. Baudon, J. Bensmail, J. Przybyło, M. Woźniak. On locally irregular decompositions and the 1-2 Conjecture in digraphs. Discrete Math. Theoret. Comput. Sci., 20(2), 2018, #7.
    6. 26. O. Baudon, J. Bensmail, H. Hocquard, M. Senhaji, É. Sopena. On locally irregular decompositions of subcubic graphs. Opuscula Mathematica, 38(6):795-817, 2018.
    7. 25. J. Bensmail, N. Brettell. Orienting edges to fight fire in graphs. Australasian Journal of Combinatorics, 71(1):12-42, 2018.
    8. 24. J. Bensmail, A. Harutyunyan, N.K. Le. List coloring digraphs. Journal of Graph Theory, 87(4):492-508, 2018.
    9. 23. J. Bensmail, A. Harutyunyan, N.K. Le, B. Li, N. Lichiardopol. Disjoint cycles of different lengths in graphs and digraphs. Electronic Journal of Combinatorics, 24(4):#P4.37, 2017.
    10. 22. J. Bensmail, S. Nandi, S. Sen. On oriented cliques with respect to push operation. Discrete Applied Mathematics, 232:50-63, 2017.
    11. 21. J. Bensmail, M. Senhaji, K. Szabo Lyngsie. On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture. Discrete Math. Theoret. Comput. Sci., 19(1), 2017, #22.
    12. 20. J. Bensmail, C. Duffy, S. Sen. Analogues of cliques for (m,n)-colored mixed graphs. Graphs and Combinatorics, 33(4):735-750, 2017.
    13. 19. J. Bensmail, A. Harutyunyan, T.-N. Le, M. Merker, S. Thomassé. A proof of the Barát-Thomassen conjecture. Journal of Combinatorial Theory, Series B, 124:39-55, 2017.
    14. 18. J. Bensmail. On q-power cycles in cubic graphs. Discussiones Mathematicae Graph Theory, 37:211-220, 2017.
    15. 17. O. Baudon, J. Bensmail, F. Foucaud, M. Pilśniak. Structural properties of recursively partitionable graphs with connectivity 2. Discussiones Mathematicae Graph Theory, 37:89-115, 2017.
    16. 16. E. Barme, J. Bensmail, J. Przybyło, M. Woźniak. On a directed variation of the 1-2-3 and 1-2 Conjectures. Discrete Applied Mathematics, 217(2):123-131, 2017.
    17. 15. J. Bensmail, M. Merker, C. Thomassen. Decomposing graphs into a constant number of locally irregular subgraphs. European Journal of Combinatorics, 60:124-134, 2017.
    18. 14. J. Bensmail, G. Renault. Decomposing oriented graphs into six locally irregular oriented graphs. Graphs and Combinatorics, 32(5):1707-1721, 2016.
    19. 13. J. Bensmail, B. Stevens. Edge-partitioning graphs into regular and locally irregular components. Discrete Math. Theoret. Comput. Sci., 17(3):43-58, 2016.
    20. 12. J. Bensmail, R. Duvignau, S. Kirgizov. The complexity of deciding whether a graph admits an orientation with fixed weak diameter. Discrete Math. Theoret. Comput. Sci., 17(3):31-42, 2016.
    21. 11. J. Bensmail. On three polynomial kernels of sequences for arbitrarily partitionable graphs. Discrete Applied Mathematics, 202:19-29, 2016.
    22. 10. J. Bensmail, A. Lagoutte, P. Valicov. Strong edge-coloring of (3, Δ)-bipartite graphs. Discrete Mathematics, 339(1):391-398, 2016.
    23. 9. J. Bensmail. On the complexity of partitioning a graph into a few connected subgraphs. Journal of Combinatorial Optimization, 30(1):174-187, 2015.
    24. 8. O. Baudon, J. Bensmail, J. Przybyło, M. Woźniak. On decomposing regular graphs into locally irregular subgraphs. European Journal of Combinatorics, 49:90-104, 2015.
    25. 7. O. Baudon, J. Bensmail, É. Sopena. On the complexity of determining the irregular chromatic index of a graph. Journal of Discrete Algorithms, 30:113-127, 2015.
    26. 6. O. Baudon, J. Bensmail, É. Sopena. An oriented version of the 1-2-3 Conjecture. Discussiones Mathematicae Graph Theory, 35(1):141-156, 2015.
    27. 5. O. Baudon, J. Bensmail, É. Sopena. Partitioning Harary graphs into connected subgraphs containing prescribed vertices. Discrete Math. Theoret. Comput. Sci., 16(3):263-278, 2014.
    28. 4. J. Bensmail, A. Harutyunyan, H. Hocquard, P. Valicov. Strong edge-colouring of sparse planar graphs. Discrete Applied Mathematics, 179:229-234, 2014.
    29. 3. O. Baudon, J. Bensmail, R. Kalinowski, A. Marczyk, J. Przybyło, M. Woźniak. On the Cartesian product of an arbitrarily partitionable graph and a traceable graph. Discrete Math. Theoret. Comput. Sci., 16(2):225-232, 2014.
    30. 2. O. Baudon, J. Bensmail, J. Przybyło, M. Woźniak. Partitioning powers of traceable or Hamiltonian graphs. Theoretical Computer Science, 520:133-137, 2014.
    31. 1. J. Bensmail. On the longest path in a recursively partitionable graph. Opuscula Mathematica, 33(4):631-640, 2013.

    (some of these works were presented during events; slides are gathered on this page)


  • Teaching:

    Since 2016/2017, I teach at the département QLIO of IUT Nice Côte d'Azur:

    • 2018- : Sécurité des systèmes d'information (LP MPL).
    • 2017- : Systèmes de gestion de bases de données (DUT QLIO S3).
    • 2016- : Recherche opérationnelle (DUT QLIO S4).
    • 2016-2017 : Systèmes d'information et logistique (DUT QLIO S3).

    Some materials of my previous teaching activities are gathered on this page.


  • Code-related stuff:

    • A nice page for playing with augmenting paths (w/ J. Belmon & V. Garnero).
    • A list of all non-isomorphic planar push cliques (w/ S. Nandi & S. Sen).