Suivre
Julien Moncel
Julien Moncel
LAAS-CNRS - Université Toulouse 1 Capitole - IUT Rodez
Adresse e-mail validée de iut-rodez.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Locating-domination and identifying codes in trees
M Blidia, M Chellali, F Maffray, J Moncel, A Semri
The Australasian Journal of Combinatorics 39, 219-232, 2007
922007
Identifying codes of cycles
S Gravier, J Moncel, A Semri
European Journal of Combinatorics 27 (5), 767-776, 2006
752006
On graphs having a V⧹{x} set as an identifying code
S Gravier, J Moncel
Discrete mathematics 307 (3-5), 432-434, 2007
702007
Codes identifying sets of vertices in random networks
A Frieze, R Martin, J Moncel, M Ruszinkó, C Smyth
Discrete Mathematics 307 (9-10), 1094-1107, 2007
582007
On graphs on n vertices having an identifying code of cardinality⌈ log2 (n+ 1)⌉
J Moncel
Discrete Applied Mathematics 154 (14), 2032-2039, 2006
492006
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
S Gravier, R Klasing, J Moncel
Algorithmic Operations Research 3 (1), 43-50, 2008
452008
Codes identifiants dans les graphes
J Moncel
Université Joseph-Fourier-Grenoble I, 2005
412005
Identifying codes in some subgraphs of the square lattice
M Daniel, S Gravier, J Moncel
Theoretical Computer Science 319 (1-3), 411-421, 2004
392004
A linear algorithm for minimum 1-identifying codes in oriented trees
I Charon, S Gravier, O Hudry, A Lobstein, M Mollard, J Moncel
Discrete Applied Mathematics 154 (8), 1246-1253, 2006
382006
Construction of codes identifying sets of vertices
S Gravier, J Moncel
the electronic journal of combinatorics, R13-R13, 2005
382005
New results on variants of covering codes in Sierpinski graphs
S Gravier, M Kovse, M Mollard, J Moncel, A Parreau
arXiv preprint arXiv:1201.1202, 2012
362012
Identifying codes of Cartesian product of two cliques of the same size
S Gravier, J Moncel, A Semri
the electronic journal of combinatorics 15 (1), N4, 2008
352008
Monotonicity of the minimum cardinality of an identifying code in the hypercube
J Moncel
Discrete Applied Mathematics 154 (6), 898-899, 2006
342006
Dense and sparse graph partition
J Darlay, N Brauner, J Moncel
Discrete Applied Mathematics 160 (16-17), 2389-2396, 2012
242012
On graphs admitting codes identifying sets of vertices
T Laihonen, J Moncel
Australasian Journal of Combinatorics 41, 81-91, 2008
192008
Adaptive identification in graphs
Y Ben-Haim, S Gravier, A Lobstein, J Moncel
Journal of Combinatorial Theory, Series A 115 (7), 1114-1126, 2008
162008
Generic algorithms for some decision problems on fasciagraphs and rotagraphs
M Bouznif, J Moncel, M Preissmann
Discrete mathematics 312 (17), 2707-2719, 2012
142012
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
L Beaudou, P Coupechoux, A Dailly, S Gravier, J Moncel, A Parreau, ...
Theoretical Computer Science 746, 19-35, 2018
132018
Adaptive identification in torii in the king lattice
Y Ben-Haim, S Gravier, A Lobstein, J Moncel
the electronic journal of combinatorics 18 (1), P116, 2011
132011
A generalization of the pentomino exclusion problem: Dislocation of graphs
S Gravier, J Moncel, C Payan
Discrete mathematics 307 (3-5), 435-444, 2007
122007
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20