Julien Moncel

Publication Activity (10 Years)

Years Active: 2004-2019
Publications (10 Years): 8

Top Venues

CoRR

Discret. Appl. Math.

Integers

Des. Codes Cryptogr.

Joseph Fourier University, Grenoble, France (PHD)

Education History

Joseph Fourier University, Grenoble, France

PHD

Publications

Antoine Dailly, Julien Moncel, Aline Parreau
Connected Subtraction Games on Subdivided Stars. Integers 19 (2019)
Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann
Exact values for three domination-like problems in circular and infinite grid graphs of small height. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Antoine Dailly, Julien Moncel, Aline Parreau
Connected Subtraction Games on Subdivided Stars. CoRR (2018)
Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
Octal games on graphs: The game 0.33 on subdivided stars and bistars. Theor. Comput. Sci. 746 (2018)
Paul Dorbec, Éric Duchêne, André Fabbri, Julien Moncel, Aline Parreau, Éric Sopena
Ice sliding games. Int. J. Game Theory 47 (2) (2018)
Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann
Exact values for three domination-like problems in circular and infinite grid graphs of small height. CoRR (2017)
Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. CoRR (2016)
Marwane Bouznif, Julien Moncel, Myriam Preissmann
A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs. Discret. Appl. Math. 208 (2016)
Paul Dorbec, Éric Duchêne, André Fabbri, Julien Moncel, Aline Parreau, Éric Sopena
Ice sliding games. CoRR (2015)
Julien Moncel, Jérémie Thiery, Ariel Waserhole
Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint. Comput. Ind. Eng. 67 (2014)
Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau
New results on variants of covering codes in Sierpiński graphs. Des. Codes Cryptogr. 69 (2) (2013)
Julien Darlay, Nadia Brauner, Julien Moncel
Dense and sparse graph partition. Discret. Appl. Math. 160 (16-17) (2012)
Marwane Bouznif, Julien Moncel, Myriam Preissmann
Generic algorithms for some decision problems on fasciagraphs and rotagraphs. Discret. Math. 312 (17) (2012)
Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau
New results on variants of covering codes in Sierpinski graphs CoRR (2012)
Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel
Adaptive Identification in Torii in the King Lattice. Electron. J. Comb. 18 (1) (2011)
Éric Duchêne, Sylvain Gravier, Julien Moncel
New results about impartial solitaire clobber. RAIRO Oper. Res. 43 (4) (2009)
Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel
Adaptive identification in graphs. J. Comb. Theory, Ser. A 115 (7) (2008)
Sylvain Gravier, Ralf Klasing, Julien Moncel
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Oper. Res. 3 (1) (2008)
Tero Laihonen, Julien Moncel
On graphs admitting t-ID codes. Australas. J Comb. 41 (2008)
Sylvain Gravier, Julien Moncel, Ahmed Semri
Identifying Codes of Cartesian Product of Two Cliques of the Same Size. Electron. J. Comb. 15 (1) (2008)
Sylvain Gravier, Julien Moncel
On graphs having a V\{x} set as an identifying code. Discret. Math. 307 (3-5) (2007)
Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth
Codes identifying sets of vertices in random networks. Discret. Math. 307 (9-10) (2007)
Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel, Ahmed Semri
Locating-domination and identifying codes in trees. Australas. J Comb. 39 (2007)
Sylvain Gravier, Julien Moncel, Charles Payan
A generalization of the pentomino exclusion problem: Dislocation of graphs. Discret. Math. 307 (3-5) (2007)
Julien Moncel
Constructing codes identifying sets of vertices. Des. Codes Cryptogr. 41 (1) (2006)
Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel
A linear algorithm for minimum 1-identifying codes in oriented trees. Discret. Appl. Math. 154 (8) (2006)
Julien Moncel
(n+1)]. Discret. Appl. Math. 154 (14) (2006)
Sylvain Gravier, Julien Moncel, Ahmed Semri
Identifying codes of cycles. Eur. J. Comb. 27 (5) (2006)
Julien Moncel
Monotonicity of the minimum cardinality of an identifying code in the hypercube. Discret. Appl. Math. 154 (6) (2006)
Sylvain Gravier, Julien Moncel
Construction of Codes Identifying Sets of Vertices. Electron. J. Comb. 12 (2005)
Julien Moncel
Codes Identifying Vertices in Graphs. Electron. Notes Discret. Math. 22 (2005)
Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth
Identifying codes in random networks. ISIT (2005)
Marc Daniel, Sylvain Gravier, Julien Moncel
Identifying codes in some subgraphs of the square lattice. Theor. Comput. Sci. 319 (1-3) (2004)

Julien Moncel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Julien Moncel