Julien Bensmail

Assistant professor @ Université Nice-Sophia-Antipolis:

  • Research @ I3S/INRIA, joint-project COATI;
  • Teaching @ IUT de Nice, 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. 24. J. Bensmail, A. Harutyunyan, T.-N. Le, S. Thomassé. Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Combinatorica, to appear.
    2. 23. J. Bensmail, A. Harutyunyan, N.K. Le. List colouring digraphs. Journal of Graph Theory, to appear.
    3. 22. J. Bensmail, S. Nandi, S. Sen. On oriented cliques with respect to push operation. Discrete Applied Mathematics, 232:50-63, 2017.
    4. 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.
    5. 20. J. Bensmail, C. Duffy, S. Sen. Analogues of cliques for (m,n)-colored mixed graphs. Graphs and Combinatorics, 33(4):735-750, 2017.
    6. 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.
    7. 18. J. Bensmail. On q-power cycles in cubic graphs. Discussiones Mathematicae Graph Theory, 37:211-220, 2017.
    8. 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.
    9. 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.
    10. 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.
    11. 14. J. Bensmail, G. Renault. Decomposing oriented graphs into six locally irregular oriented graphs. Graphs and Combinatorics, 32(5):1707-1721, 2016.
    12. 13. J. Bensmail, B. Stevens. Edge-partitioning graphs into regular and locally irregular components. Discrete Math. Theoret. Comput. Sci., 17(3):43-58, 2016.
    13. 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.
    14. 11. J. Bensmail. On three polynomial kernels of sequences for arbitrarily partitionable graphs. Discrete Applied Mathematics, 202:19-29, 2016.
    15. 10. J. Bensmail, A. Lagoutte, P. Valicov. Strong edge-coloring of (3, Δ)-bipartite graphs. Discrete Mathematics, 339(1):391-398, 2016.
    16. 9. J. Bensmail. On the complexity of partitioning a graph into a few connected subgraphs. Journal of Combinatorial Optimization, 30(1):174-187, 2015.
    17. 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.
    18. 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.
    19. 6. O. Baudon, J. Bensmail, É. Sopena. An oriented version of the 1-2-3 Conjecture. Discussiones Mathematicae Graph Theory, 35(1):141-156, 2015.
    20. 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.
    21. 4. J. Bensmail, A. Harutyunyan, H. Hocquard, P. Valicov. Strong edge-colouring of sparse planar graphs. Discrete Applied Mathematics, 179:229-234, 2014.
    22. 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.
    23. 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.
    24. 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 de Nice:

    • 2017- : Systèmes de gestion de bases de données (M3105, S3).
    • 2016- : Recherche opérationnelle (M4201, S4).
    • 2016-2017 : Systèmes d'information et logistique (AT17, 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).