I am a member of ROC research group within the LAAS lab.

I am interested in graph theory and discrete optimization in general.

My doctoral dissertation as well as my habilitation deal with identifying codes in graphs. My Ph.D. supervisor was Sylvain Gravier ; I used to be the co-supervisor of Marwane Bouznif's, Julien Darlay's and Widad Dali's doctoral works. Pierre Coupechoux does his doctoral research under my supervision, on the topic of identifying codes and colorations and combinatorial graph games. I am also the co-supervisor of Hillal Touati, who works on identifying codes in directed graphs.

I belong to the maths à modeler transdisciplinary research group. I am also a member of the informal research group TORO (Toulouse Optimization and Operations Research).

Here are the publications in refeered international journals I contributed to :

- Gerd Finke, Ahmed Gara-Ali, Marie-Laure Espinouse, Vincent Jost, Julien Moncel,
*Unified matrix approach to solve production-maintenance problems on a single machine*, Omega**66(A)**(2017), 140–146 - Marwane Bouznif, Julien Moncel, Myriam Preissmann,
*A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs*, Discrete Applied Mathematics**208**(2016), 27–40 - Julien Moncel, Jérémie Thiery, Ariel Waserhole,
*Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint*, Computers and Industrial Engineering**67**(2014), 216–222 - Sylvain Gravier, Matjaž Kovše, Michel Mollard, Julien Moncel, Aline Parreau,
*New results on variants of covering codes in Sierpiński graphs*Designs, Codes and Cryptography**69(2)**(2013) 181–188 - Nadia Brauner, Julien Darlay, Julien Moncel,
*Dense & sparse graph partition*, Discrete Applied Mathematics**160(16–17)**(2012), 2389–2396 - Marwane Bouznif, Julien Moncel, Myriam Preissmann,
*Generic algorithms for some decision problems on fasciagraphs and rotagraphs*, Discrete Mathematics**312(17)**(2012), 2707–2719 - Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel,
*Adaptive identification in torii in the king lattice*, Electronic Journal of Combinatorics**18(1)**P116 (2011) - Éric Duchêne, Sylvain Gravier, Julien Moncel,
*New results about impartial solitaire clobber*, RAIRO–Operations Research,**43**(2009), 463–482 - Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel,
*Adaptive identification in graphs*, Journal of Combinatorial Theory Series A**115(7)**(2008), 1114–1126 - Sylvain Gravier, Julien Moncel, Ahmed Semri,
*Identifying codes of cartesian product of two cliques of the same size*, Electronic Journal of Combinatorics**15(1)**N4 (2008) - Sylvain Gravier, Ralf Klasing, Julien Moncel,
*Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs*, Algorithmic Operations Research**3(1)**(2008), 43–50 - Tero Laihonen, Julien Moncel,
*On graphs admitting codes identifying sets of vertices*, Australasian Journal of Combinatorics**41**(2008), 81–91 - Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel, Ahmed Semri
*Locating-domination and identifying codes in trees*, Australasian Journal of Combinatorics**39**(2007), 219–232 - Alan Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Clifford Smyth,
*Codes identifying sets of vertices in random networks*, Discrete Mathematics**307(9-10)**(2007), 1094–1107 - Sylvain Gravier, Julien Moncel,
*On graphs having a V–{x} set as an identifying code*, Discrete Mathematics**307(3-5)**(2007), 432–434 - Sylvain Gravier, Julien Moncel, Charles Payan,
*A generalization of the pentomino exclusion problem: Dislocation of graphs*, Discrete Mathematics**307(3-5)**(2007), 435–444 - Julien Moncel,
*Constructing codes identifying sets of vertices*, Designs, Codes and Cryptography**41(1)**(2006), 23–31 - Julien Moncel,
*On graphs on n vertices having an identifying code of cardinality log*, Discrete Applied Mathematics_{2}(n+1)**154(14)**(2006), 2032–2039 - Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel,
*A linear algorithm for minimum 1-identifying codes in oriented trees*, Discrete Applied Mathematics,**154(8)**(2006), 1246–1253 - Julien Moncel,
*Monotonicity of the minimum cardinality of an identifying code in the hypercube*, Discrete Applied Mathematics**154(6)**(2006), 898–899 - Sylvain Gravier, Julien Moncel, Ahmed Semri,
*Identifying codes of cycles*, European Journal of Combinatorics**27(5)**(2006), 767–776 - Sylvain Gravier, Julien Moncel,
*Construction of codes identifying sets of vertices*, Electronic Journal of Combinatorics**12(1)**R13 (2005) - Marc Daniel, Sylvain Gravier, Julien Moncel,
*Identifying codes in some subgraphs of the square lattice*, Theoretical Computer Science**319(1-3)**(2004), 411–421