| 2008 |
|---|
| 12 | EE | Yael Ben-Haim,
Sylvain Gravier,
Antoine Lobstein,
Julien Moncel:
Adaptive identification in graphs.
J. Comb. Theory, Ser. A 115(7): 1114-1126 (2008) |
| 2007 |
|---|
| 11 | EE | Sylvain Gravier,
Julien Moncel:
On graphs having a V\{x} set as an identifying code.
Discrete Mathematics 307(3-5): 432-434 (2007) |
| 10 | EE | Sylvain Gravier,
Julien Moncel,
Charles Payan:
A generalization of the pentomino exclusion problem: Dislocation of graphs.
Discrete Mathematics 307(3-5): 435-444 (2007) |
| 9 | EE | Alan M. Frieze,
Ryan Martin,
Julien Moncel,
Miklós Ruszinkó,
Clifford D. Smyth:
Codes identifying sets of vertices in random networks.
Discrete Mathematics 307(9-10): 1094-1107 (2007) |
| 2006 |
|---|
| 8 | EE | Julien Moncel:
Constructing codes identifying sets of vertices.
Des. Codes Cryptography 41(1): 23-31 (2006) |
| 7 | EE | Julien Moncel:
On graphs on n vertices having an identifying code of cardinality [log2(n+1)].
Discrete Applied Mathematics 154(14): 2032-2039 (2006) |
| 6 | EE | Julien Moncel:
Monotonicity of the minimum cardinality of an identifying code in the hypercube.
Discrete Applied Mathematics 154(6): 898-899 (2006) |
| 5 | EE | 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): 1246-1253 (2006) |
| 4 | EE | Sylvain Gravier,
Julien Moncel,
Ahmed Semri:
Identifying codes of cycles.
Eur. J. Comb. 27(5): 767-776 (2006) |
| 2005 |
|---|
| 3 | EE | Sylvain Gravier,
Julien Moncel:
Construction of Codes Identifying Sets of Vertices.
Electr. J. Comb. 12: (2005) |
| 2 | EE | Julien Moncel:
Codes Identifying Vertices in Graphs.
Electronic Notes in Discrete Mathematics 22: 229-232 (2005) |
| 2004 |
|---|
| 1 | EE | Marc Daniel,
Sylvain Gravier,
Julien Moncel:
Identifying codes in some subgraphs of the square lattice.
Theor. Comput. Sci. 319(1-3): 411-421 (2004) |
