Search the dblp DataBase
Julien Moncel :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Irène Charon , Sylvain Gravier , Olivier Hudry , Antoine Lobstein , Michel Mollard , Julien Moncel A linear algorithm for minimum 1-identifying codes in oriented trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:8, pp:1246-1253 [Journal ] Julien Moncel Monotonicity of the minimum cardinality of an identifying code in the hypercube. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:6, pp:898-899 [Journal ] Julien Moncel On graphs on n vertices having an identifying code of cardinality [log_{2} (n+1)]. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:14, pp:2032-2039 [Journal ] Julien Moncel Constructing codes identifying sets of vertices. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2006, v:41, n:1, pp:23-31 [Journal ] Sylvain Gravier , Julien Moncel On graphs having a V\{x} set as an identifying code. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:3-5, pp:432-434 [Journal ] Alan Frieze , Ryan Martin , Julien Moncel , Miklós Ruszinkó , Cliff Smyth Codes identifying sets of vertices in random networks. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:9-10, pp:1094-1107 [Journal ] Sylvain Gravier , Julien Moncel , Charles Payan A generalization of the pentomino exclusion problem: Dislocation of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:3-5, pp:435-444 [Journal ] Sylvain Gravier , Julien Moncel , Ahmed Semri Identifying codes of cycles. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2006, v:27, n:5, pp:767-776 [Journal ] Marc Daniel , Sylvain Gravier , Julien Moncel Identifying codes in some subgraphs of the square lattice. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:319, n:1-3, pp:411-421 [Journal ] Construction of Codes Identifying Sets of Vertices. [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs