Identifying codes in some subgraphs of the square lattice. - Marc Daniel; Sylvain Gravier; Julien Moncel (Theor. Comput. Sci., 2004)

Identifying codes in random networks. - Alan M. Frieze; Ryan R. Martin; Julien Moncel; Miklós Ruszinkó; Cliff Smyth 001 (ISIT, 2005)

Construction of Codes Identifying Sets of Vertices. - Sylvain Gravier; Julien Moncel (Electron. J. Comb., 2005)

Codes Identifying Vertices in Graphs. - Julien Moncel (Electron. Notes Discret. Math., 2005)

Codes Identifiants dans les Graphes. (Identifying Codes in Graphs). - Julien Moncel (2005)

A linear algorithm for minimum 1-identifying codes in oriented trees. - Irène Charon; Sylvain Gravier; Olivier Hudry; Antoine Lobstein; Michel Mollard; Julien Moncel (Discret. Appl. Math., 2006)

Monotonicity of the minimum cardinality of an identifying code in the hypercube. - Julien Moncel (Discret. Appl. Math., 2006)

On graphs on n vertices having an identifying code of cardinality [log2(n+1)]. - Julien Moncel (Discret. Appl. Math., 2006)

Constructing codes identifying sets of vertices. - Julien Moncel (Des. Codes Cryptogr., 2006)

Identifying codes of cycles. - Sylvain Gravier; Julien Moncel; Ahmed Semri (Eur. J. Comb., 2006)

Locating-domination and identifying codes in trees. - Mostafa Blidia; Mustapha Chellali; Frédéric Maffray; Julien Moncel; Ahmed Semri (Australas. J Comb., 2007)

Codes identifying sets of vertices in random networks. - Alan M. Frieze; Ryan R. Martin; Julien Moncel; Miklós Ruszinkó; Cliff Smyth 001 (Discret. Math., 2007)

On graphs having a V {x} set as an identifying code. - Sylvain Gravier; Julien Moncel (Discret. Math., 2007)

A generalization of the pentomino exclusion problem: Dislocation of graphs. - Sylvain Gravier; Julien Moncel; Charles Payan (Discret. Math., 2007)

On graphs admitting t-ID codes. - Tero Laihonen; Julien Moncel (Australas. J Comb., 2008)

Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. - Sylvain Gravier; Ralf Klasing; Julien Moncel (Algorithmic Oper. Res., 2008)

Identifying Codes of Cartesian Product of Two Cliques of the Same Size. - Sylvain Gravier; Julien Moncel; Ahmed Semri (Electron. J. Comb., 2008)

Adaptive identification in graphs. - Yael Ben-Haim; Sylvain Gravier; Antoine Lobstein; Julien Moncel (J. Comb. Theory A, 2008)

New results about impartial solitaire clobber. - Éric Duchêne; Sylvain Gravier; Julien Moncel (RAIRO Oper. Res., 2009)

Adaptive Identification in Torii in the King Lattice. - Yael Ben-Haim; Sylvain Gravier; Antoine Lobstein; Julien Moncel (Electron. J. Comb., 2011)

Dense and sparse graph partition. - Julien Darlay; Nadia Brauner; Julien Moncel (Discret. Appl. Math., 2012)

Generic algorithms for some decision problems on fasciagraphs and rotagraphs. - Marwane Bouznif; Julien Moncel; Myriam Preissmann (Discret. Math., 2012)

New results on variants of covering codes in Sierpiński graphs. - Sylvain Gravier; Matjaz Kovse; Michel Mollard; Julien Moncel; Aline Parreau (Des. Codes Cryptogr., 2013)

Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint. - Julien Moncel; Jérémie Thiery; Ariel Waserhole (Comput. Ind. Eng., 2014)

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs. - Marwane Bouznif; Julien Moncel; Myriam Preissmann (Discret. Appl. Math., 2016)

Ice sliding games. - Paul Dorbec; Éric Duchêne; André Fabbri; Julien Moncel; Aline Parreau; Éric Sopena (Int. J. Game Theory, 2018)

Octal games on graphs: The game 0.33 on subdivided stars and bistars. - Laurent Beaudou; Pierre Coupechoux; Antoine Dailly; Sylvain Gravier; Julien Moncel; Aline Parreau; Éric Sopena (Theor. Comput. Sci., 2018)

Exact values for three domination-like problems in circular and infinite grid graphs of small height. - Marwane Bouznif; Julien Darlay; Julien Moncel; Myriam Preissmann (Discret. Math. Theor. Comput. Sci., 2019)

Connected Subtraction Games on Subdivided Stars. - Antoine Dailly; Julien Moncel; Aline Parreau (Integers, 2019)