Y. Ben-haim, S. Gravier, A. Lobstein, and J. , Adaptive identification in torii in the king lattice, Electronic Journal of Combinatorics, vol.18, issue.1, p.116, 2011.

E. Duchêne, S. Gravier, and J. , New results about impartial solitaire clobber, RAIRO - Operations Research, vol.43, issue.4, pp.463-482, 2009.
DOI : 10.1051/ro/2009029

Y. Ben-haim, S. Gravier, A. Lobstein, and J. , Adaptive identification in graphs, Journal of Combinatorial Theory, Series A, vol.115, issue.7, pp.1114-1126, 2008.
DOI : 10.1016/j.jcta.2007.12.009

J. [. Gravier, A. Moncel, and . Semri, Identifying codes of cartesian product of two cliques of the same size, Electronic Journal of Combinatorics, vol.15, issue.1, p.4, 2008.

R. [. Gravier and J. Klasing, Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs, Algorithmic Operations Research, vol.3, issue.1, pp.43-50, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00306997

T. Laihonen and J. , On graphs admitting codes identifying sets of vertices, Australasian Journal of Combinatorics, vol.41, pp.81-91, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00182323

M. Blidia, M. Chellali, F. Maffray, J. Moncel, and A. Semri, Locatingdomination and identifying codes in trees, Australasian Journal of Combinatorics, vol.39, pp.219-232, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00182307

R. [. Frieze, J. Martin, M. Moncel, C. Ruszinkóruszink´ruszinkó, and . Smyth, Codes identifying sets of vertices in random networks, Discrete Mathematics, vol.307, issue.9-10, pp.9-10, 2007.
DOI : 10.1016/j.disc.2006.07.041
URL : https://hal.archives-ouvertes.fr/hal-00182312

J. [. Gravier, On graphs having a <mml:math altimg="si3.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>V</mml:mi><mml:mo>???</mml:mo><mml:mo stretchy="false">{</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">}</mml:mo></mml:math> set as an identifying code, Discrete Mathematics, vol.307, issue.3-5, pp.432-434, 2007.
DOI : 10.1016/j.disc.2005.09.035

J. [. Gravier, C. Moncel, and . Payan, A generalization of the pentomino exclusion problem: Dislocation of graphs, Discrete Mathematics, vol.307, issue.3-5, pp.3-5, 2007.
DOI : 10.1016/j.disc.2005.09.036
URL : https://hal.archives-ouvertes.fr/hal-00182315

I. Charon, S. Gravier, O. Hudry, A. Lobstein, M. Mollard et al., A linear algorithm for minimum 1-identifying codes in oriented trees, Discrete Applied Mathematics, vol.154, issue.8, pp.1246-1253, 2006.
DOI : 10.1016/j.dam.2005.11.007
URL : https://hal.archives-ouvertes.fr/hal-00360156

R. S. Gravier, J. Moncel, and A. Semri, Identifying codes of cycles, European Journal of Combinatorics, vol.27, issue.5, pp.767-776, 2006.
DOI : 10.1016/j.ejc.2004.09.005
URL : https://hal.archives-ouvertes.fr/hal-00360168

J. [. Gravier, Construction of codes identifying sets of vertices, Electronic Journal of Combinatorics, vol.12, issue.1, p.13, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00360014

M. Daniel, S. Gravier, and J. , Identifying codes in some subgraphs of the square lattice, Theoretical Computer Science, vol.319, issue.1-3, pp.411-421, 2004.
DOI : 10.1016/j.tcs.2004.02.007

C. J. Moncel, G. Finke, and V. Jost, Single-machine scheduling problems with position-dependent processing times, 13th International Conference on Project Management and Scheduling, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00647789

J. Moncel, J. Thiery, and A. Waserhole, Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint, 13th International Conference on Project Management and Scheduling, pp.1-4
DOI : 10.1016/j.cie.2013.08.017

J. Darlay, N. Brauner, and J. , Dense and sparse graph partition, European Conference On Operational Resarch, p.24, 2010.
DOI : 10.1016/j.dam.2012.06.004
URL : https://hal.archives-ouvertes.fr/hal-00454999

M. Bouznif, J. Moncel, and M. Preissmann, Algorithms for combinatorial problems on fasciagraphs and rotagraphs, 8th French Combinatorial Conference, pp.28-30, 2010.

J. [. Cartier, Learner's conceptions in different situations around Königsberg's bridges problem, Topic Study Group 15, 2008.

J. [. Gravier, A. Moncel, and . Semri, Codes identifiants : une approche combinatoire d'unprobì eme de détection de défaillances dans les réseaux, COSI'06, International Colloquium on Optimisation and Information Systems, pp.11-13, 2006.

I. Adiri, J. Bruno, E. Frostig, and A. H. Kan, Single machine flow-time scheduling with a single breakdown, Acta Informatica, vol.37, issue.7, pp.679-696, 1989.
DOI : 10.1007/BF00288977

S. Alanko, S. Crevals, A. Isopoussu, P. Ostergård, and V. Pettersson, Computing the Domination Number of Grid Graphs, Electronic Journal of Combinatorics, vol.18, issue.1, p.141, 2011.

B. Alidaee and N. Womer, Scheduling with time dependent processing times: Review and extensions, Journal of the Operational Research Society, vol.50, issue.7, pp.711-720, 1999.
DOI : 10.1057/palgrave.jors.2600740

P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, vol.237, issue.1-2, pp.123-134, 2000.
DOI : 10.1016/S0304-3975(98)00158-3

S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, vol.12, issue.2, pp.308-340, 1991.
DOI : 10.1016/0196-6774(91)90006-K

D. Auger, Induced paths in twin-free graphs, Electronic Journal of Combinatorics, vol.15, issue.1, p.17, 2008.

D. Auger, Minimal identifying codes in trees and planar graphs with large girth, European Journal of Combinatorics, vol.31, issue.5, pp.1372-1384, 2010.
DOI : 10.1016/j.ejc.2009.11.012

D. Auger, Probì emes d'identification combinatoire et puissances de graphes Disponible en lignè a l'url http, 2010.

D. Auger, I. Charon, I. Honkala, O. Hudry, and A. Lobstein, Edge number, minimum degree, maximum independent set, radius and diameter in twinfree graphs, Advances in Mathematics of Communications, vol.3, issue.1, pp.97-114, 2009.

D. Auger, I. Charon, O. Hudry, and A. Lobstein, On the existence of a cycle of length at least 7 in a (1,??? 2)-twin-free graph, Discussiones Mathematicae Graph Theory, vol.30, issue.4, pp.591-609, 2010.
DOI : 10.7151/dmgt.1516

D. Auger, I. Charon, O. Hudry, and A. Lobstein, Complexity results for identifying codes in planar graphs, International Transactions in Operational Research, vol.29, issue.7, pp.691-710, 2010.
DOI : 10.1111/j.1475-3995.2009.00750.x

D. Auger, I. Charon, O. Hudry, and A. Lobstein, Watching systems in graphs: An extension of identifying codes, Discrete Applied Mathematics, vol.161, issue.12
DOI : 10.1016/j.dam.2011.04.025
URL : https://hal.archives-ouvertes.fr/hal-00481469

D. Auger, I. Charon, O. Hudry, and A. Lobstein, On the sizes of the graphs G, G r , G r G : the directed case, Australasian Journal of Combinatorics, pp.48-87, 2010.

D. Auger, I. Charon, O. Hudry, and A. Lobstein, On the sizes of graphs and their powers: The undirected case, Discrete Applied Mathematics, vol.159, issue.16, pp.1666-1675, 2011.
DOI : 10.1016/j.dam.2011.04.010

D. Auger, I. Charon, O. Hudry, and A. Lobstein, On the square roots of graphs

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and Approximation : Combinatorial optimization problems and their approximability properties, 1999.
DOI : 10.1007/978-3-642-58412-1

C. Barnhart, C. Kniker, and M. Lohatepanout, Itinerary-Based Airline Fleet Assignment, Transportation Science, vol.36, issue.2, pp.199-217, 2002.
DOI : 10.1287/trsc.36.2.199.566

B. Baumann, Modélisation d'unprobì eme de surveillance par un jeu de tirs aux buts ? calculs de stratégies optimales, mémoire de travail d'´ etude et de recherche ENSIMAG, 2008.

L. Beaudou, S. Gravier, S. Klav?ar, M. Kov?e, and M. Mollard, Covering codes in Sierpí nski graphs, Discrete Mathematics and Theoretical Computer Science, vol.12, issue.3, pp.63-74, 2010.

Y. Ben-haim, S. Gravier, A. Lobstein, and J. , Adaptive identification in graphs, Journal of Combinatorial Theory, Series A, vol.115, issue.7, pp.1114-1126, 2008.
DOI : 10.1016/j.jcta.2007.12.009

Y. Ben-haim, S. Gravier, A. Lobstein, and J. , Adaptive identification in torii in the king lattice, Electronic Journal of Combinatorics, vol.18, issue.1, p.116, 2011.

Y. Ben-haim and S. Litsyn, Exact Minimum Density of Codes Identifying Vertices in the Square Grid, SIAM Journal on Discrete Mathematics, vol.19, issue.1, pp.69-82, 2005.
DOI : 10.1137/S0895480104444089

A. A. Bertossi, Dominating sets for split and bipartite graphs, Information Processing Letters, vol.19, issue.1, pp.37-40, 1984.
DOI : 10.1016/0020-0190(84)90126-1

N. Bertrand, Codes identifiants et codes localisateurs-dominateurs sur certains graphes, mémoire de master 2, Télécom ParisTech, 2001.

N. Bertrand, I. Charon, O. Hudry, and A. Lobstein, Identifying and locating-dominating codes on chains and cycles, European Journal of Combinatorics, vol.25, issue.7, pp.969-987, 2004.
DOI : 10.1016/j.ejc.2003.12.013

N. Bertrand, I. Charon, O. Hudry, and A. , Lobstein, 1-identifying codes on trees, Australasian Journal of Combinatorics, vol.31, pp.21-35, 2005.

D. Biskup, A state-of-the-art review on scheduling with learning effects, European Journal of Operational Research, vol.188, issue.2, pp.315-329, 2008.
DOI : 10.1016/j.ejor.2007.05.040

U. Blass, I. Honkala, and S. Litsyn, On binary codes for identification, Journal of Combinatorial Designs, vol.69, issue.2, pp.151-156, 2000.
DOI : 10.1002/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S

U. Blass, I. Honkala, and S. Litsyn, Bounds on identifying codes, Bounds on identifying codes, pp.119-128, 2001.
DOI : 10.1016/S0012-365X(01)00113-3
URL : http://doi.org/10.1016/s0012-365x(01)00113-3

T. Bonates and P. Hammer, Logical Analysis of Data : From Combinatorial Optimization to Medical Applications, Annals of Operations Research, vol.148, pp.203-225, 2006.

M. Bouznif, J. Darlay, J. Moncel, and A. Parreau, Identifying codes in generalized Sierpí nski graphs, en préparation

M. Bouznif, J. Darlay, J. Moncel, and M. Preissmann, New results on identifying codes in square grids of small height

M. Bouznif, J. Moncel, and M. Preissmann, Generic algorithms for some decision problems on fasciagraphs and rotagraphs, Discrete Mathematics, vol.312, issue.17, pp.2707-2719, 2012.
DOI : 10.1016/j.disc.2012.02.013
URL : https://hal.archives-ouvertes.fr/hal-00702067

M. Bouznif, J. Moncel, and M. Preissmann, Optimization algorithms for rotagraphs and fasciagraphs, soumis

N. Brauner, J. Darlay, and J. , Dense & sparse graph partition, accepté accepté`acceptéà Discrete Applied Mathematics

R. E. Burkard, B. Klinz, and R. Rudolf, Perspectives of Monge properties in optimization, Discrete Applied Mathematics, vol.70, issue.2, pp.95-161, 1996.
DOI : 10.1016/0166-218X(95)00103-X

L. Cartier, P. Dorbec, ´. E. Duchêne, N. Giroud, J. Moncel et al., Ouvrier- Buffet, Towards a characterization of research situations for the classroom - Analysis of a case study

L. Cartier and J. , Learners' conceptions in different class situations around Königsberg's bridges problem Disponible en lignè a l'url http, International Congress on Mathematical Education, pp.6-13, 2008.

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, General bounds for identifying codes in some infinite regular graphs, Electronic Journal of Combinatorics, vol.8, p.39, 2001.

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, The minimum density of an identifying code in the king lattice, Discrete Mathematics, vol.276, issue.1-3, pp.95-109, 2004.
DOI : 10.1016/S0012-365X(03)00306-6

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, Structural properties of twin-free graphs, Electronic Journal of Combinatorics, vol.14, p.16, 2007.

G. Cohen, I. Honkala, A. Lobstein, and G. Zémor, On identifying codes, Proceedings of DIMACS Workshop on Codes and Association Schemes 1999, pp.97-109, 2001.

I. Charon, O. Hudry, and A. Lobstein, Identifying codes with small radius in some infinite regular graphs, Electronic Journal of Combinatorics, vol.9, p.11, 2002.

I. Charon, O. Hudry, and A. Lobstein, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard, Theoretical Computer Science, vol.290, issue.3, pp.2109-2120, 2003.
DOI : 10.1016/S0304-3975(02)00536-4

I. Charon, O. Hudry, and A. Lobstein, Identifying and locating-dominating codes: NP-completeness results for directed graphs, IEEE Transactions on Information Theory, vol.48, issue.8, pp.2192-2200
DOI : 10.1109/TIT.2002.800490

I. Charon, O. Hudry, and A. Lobstein, Possible cardinalities for identifying codes in graphs, Australasian Journal of Combinatorics, vol.32, pp.177-195, 2005.

I. Charon, O. Hudry, and A. Lobstein, Extremal cardinalities for identifying and locating-dominating codes in graphs, Discrete Mathematics, vol.307, issue.3-5, pp.356-366, 2007.
DOI : 10.1016/j.disc.2005.09.027

C. Chen, C. Lua, and Z. Miao, Identifying codes and locating???dominating sets on paths and cycles, Discrete Applied Mathematics, vol.159, issue.15, pp.1540-1547, 2011.
DOI : 10.1016/j.dam.2011.06.008

B. Chen, C. Potts, and G. Woeginger, A Review of Machine Scheduling : Complexity , Algorithms and Approximability, 21?169 dans Handbook of Combinatorial Optimization, 1998.

W. E. Clark and S. Suen, An inequality related to Vizing's conjecture, Electronic Journal of Combinatorics, vol.7, issue.1, p.4, 2000.

E. J. Cockayne, S. E. Goodman, and S. T. Hedetniemi, A linear algorithm for the domination number of a tree, Information Processing Letters, vol.4, issue.2, pp.41-44, 1975.
DOI : 10.1016/0020-0190(75)90011-3

G. Cohen, S. Gravier, I. Honkala, A. Lobstein, M. Mollard et al., Improved Identifying Codes for the Grid, Electronic Journal of Combinatorics, issue.61, p.19, 1999.

G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes, North- Holland Mathematical Library Series, 1997.

G. Cohen, I. Honkala, A. Lobstein, and G. Zémor, New bounds for identifying vertices in graphs, Electronic Journal of Combinatorics, vol.6, p.19, 1999.

B. Courcelle and J. Engelfriet, Graph structure and monadic second-order logic , a language theoretic approach
URL : https://hal.archives-ouvertes.fr/hal-00646514

D. Cranston and G. Yu, A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid, Electronic Journal of Combinatorics, vol.16, p.113, 2009.

M. Daniel, S. Gravier, and J. , Identifying codes in some subgraphs of the square lattice, Theoretical Computer Science, vol.319, issue.1-3, pp.411-421, 2004.
DOI : 10.1016/j.tcs.2004.02.007

J. Darlay, Analyse combinatoire de données ? structures et optimisation, thèse de doctorat de l, 2011.

J. Darlay, N. Brauner, and J. , Partition en sous-graphes denses pour la détection de communautés, congrès ROADEF, pp.24-26, 2010.

. Ch and . Deppe, Strategies for the Renyi-Ulam Game, Theoretical Computer Science, vol.314, pp.45-55, 2004.

R. Diestel and G. Theory, Disponible en lignè a l'url http://diestel-graph-theory, 2010.

P. Dorbec, J. Moncel, A. Parreau, and G. Renault, Adaptive identifying codes in trees

E. Duchêne, S. Gravier, and J. , New results about impartial solitaire clobber, RAIRO - Operations Research, vol.43, issue.4, pp.463-482, 2009.
DOI : 10.1051/ro/2009029

C. Duquesne, The fleet assignment problem, mémoire de M2R recherche opérationnelle, combinatoire et optimisation, 2009.

A. D. 'yachkov and V. Rykov, Bounds on the length of disjunctive codes, Problems of Information Transmission, vol.18, pp.166-171, 1983.

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau, Locally identifying coloring of graphs, soumis. Disponible en lignè a l'url http

G. Exoo, V. Junnila, T. Laihonen, and S. Ranto, Upper bounds for binary identifying codes, Advances in Applied Mathematics, vol.42, issue.3, pp.277-289, 2009.
DOI : 10.1016/j.aam.2008.06.004

N. Fazlollahi, D. Starobinski, and A. Trachtenberg, Connected identifying codes for sensor network monitoring, WCNC 2011, IEEE Wireless Communications and Networking Conference Mars 2011, CancúnCanc´Cancún (Mexique), publié dans les proceedings pp, pp.28-31, 2011.

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998.
DOI : 10.1145/285055.285059

D. Fera, N. Kim, N. Shiffeldrim, J. Zorn, U. Laserson et al., RAG : RNA-As-Graphs web resource, BMC Bioinformatics, vol.5, issue.88, 2004.

F. Foucaud, I. Honkala, T. Laihonen, A. Parreau, and G. Perarnau, Locally identifying colouring of graphs with given maximum degree, soumis. Disponible en lignè a l'url http

F. Foucaud, E. Guerrini, M. Kov?e, R. Naserasr, A. Parreau et al., Extremal graphs for the identifying code problem, European Journal of Combinatorics, vol.32, issue.4, pp.628-638, 2011.
DOI : 10.1016/j.ejc.2011.01.002
URL : https://hal.archives-ouvertes.fr/hal-00477467

F. Foucaud, S. Gravier, R. Naserasr, A. Parreau, and P. Valicov, Identifying codes in line graphs, soumis. Disponible en lignè a l'url http

F. Foucaud, R. Klasing, A. Kosowski, and A. Raspaud, Bounds on the size of identifying codes in triangle-free graphs, soumis (2010) Disponible en lignè a l'url http

L. Frachet and G. Massonnet, Modélisation d'unprobì eme de surveillance par un jeu stochastique, mémoire de projet de spécialité ENSIMAG, 2008.

M. Frick and M. Grohe, The complexity of first-order and monadic second-order logic revisited, Annals of Pure and Applied Logic, vol.130, issue.1-3, pp.3-31, 2004.
DOI : 10.1016/j.apal.2004.01.007

A. Frieze, R. Martin, J. Moncel, M. Ruszinkóruszink´ruszinkó, and C. Smyth, Codes identifying sets of vertices in random networks, Discrete Mathematics, vol.307, issue.9-10, pp.9-10, 2007.
DOI : 10.1016/j.disc.2006.07.041
URL : https://hal.archives-ouvertes.fr/hal-00182312

H. Gan, D. Fera, J. Zorn, N. Shiffeldrim, U. Laserson et al., RAG: RNA-As-Graphs database--concepts, analysis, and features, Bioinformatics, vol.20, issue.8, pp.1285-1291, 2004.
DOI : 10.1093/bioinformatics/bth084

H. Gan, S. Pasquali, and T. Schlick, Exploring the repertoire of RNA secondary motifs using graph theory; implications for RNA design, Nucleic Acids Research, vol.31, issue.11, pp.2926-2943, 2003.
DOI : 10.1093/nar/gkg365

A. Gardiner, Imprimitive distance-regular graphs and projective planes, Journal of Combinatorial Theory, Series B, vol.16, issue.3, pp.274-281, 1974.
DOI : 10.1016/0095-8956(74)90073-2
URL : http://doi.org/10.1016/0095-8956(74)90073-2

M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, Freeman, 1979.

S. Gawiejnowicz, Time-Dependent Scheduling, Monographs in Theoretical Computer Science ? An EATCS Series, 2008.

J. Gimbel, B. Van-gorden, M. Nicolescu, . Ch, N. Umstead et al., Location with dominating sets, Congressus Numerantium, vol.151, pp.129-144, 2001.

S. W. Golomb and L. R. Welch, Perfect Codes in the Lee Metric and the Packing of Polyominoes, SIAM Journal on Applied Mathematics, vol.18, issue.2, pp.302-317, 1970.
DOI : 10.1137/0118025

R. Grappe, N. Brauner, and J. , Unprobì eme de surveillance : modélisation et simulation avec la théorie des jeux, congrès ROADEF, pp.25-27, 2008.

S. Gravier, R. Klasing, and J. , Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs, Algorithmic Operations Research, vol.3, issue.1, pp.43-50, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00306997

S. Gravier, M. Kov?e, M. Mollard, J. Moncel, and A. Parreau, New results on variants of covering codes in Sierpí nski graphs, ` a para??trepara??tre dans Designs, Codes and Cryptography. Disponible en lignèlignè a l'url http

S. Gravier and J. , Construction of codes identifying sets of vertices, Electronic Journal of Combinatorics, vol.12, issue.1, p.13, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00360014

S. Gravier and J. , On graphs having a <mml:math altimg="si3.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>V</mml:mi><mml:mo>???</mml:mo><mml:mo stretchy="false">{</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">}</mml:mo></mml:math> set as an identifying code, Discrete Mathematics, vol.307, issue.3-5, pp.432-434, 2007.
DOI : 10.1016/j.disc.2005.09.035

S. Gravier, J. Moncel, and C. Payan, A generalization of the pentomino exclusion problem: Dislocation of graphs, Discrete Mathematics, vol.307, issue.3-5, pp.3-5, 2007.
DOI : 10.1016/j.disc.2005.09.036
URL : https://hal.archives-ouvertes.fr/hal-00182315

S. Gravier, J. Moncel, and A. Semri, Identifying codes of cycles, European Journal of Combinatorics, vol.27, issue.5, pp.767-776, 2006.
DOI : 10.1016/j.ejc.2004.09.005
URL : https://hal.archives-ouvertes.fr/hal-00360168

S. Gravier, J. Moncel, and A. Semri, Codes identifiants : une approche combinatoire d'unprobì eme de détection de défaillances dans les réseaux, CO- SI'06 (International Colloquium on Optimisation and Information Systems, publié dans les proceedings pp, pp.186-196, 2006.

S. Gravier, J. Moncel, and A. Semri, Identifying codes of cartesian product of two cliques of the same size, Electronic Journal of Combinatorics, vol.15, issue.1, p.4, 2008.

S. Gravier and B. Ycart, S-constrained random matrices, Discrete Mathematics and Theoretical Computer Science Proceedings, pp.357-364, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01184682

R. Hammack, W. Imrich, and S. Klav?ar, Handbook of Product Graphs, 2011.

F. Havet, Minimum-density identifying codes in grids, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01259550

T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs, 1998.

T. Haynes, D. Knisley, E. Seier, and Y. Zou, A quantitative analysis of secondary RNA structure using domination based parameters on trees, BMC Bioinformatics, vol.7, issue.108, 2006.

Y. He, W. Zhong, and H. Gu, Improved algorithms for two single machine scheduling problems, Theoretical Computer Science, vol.363, issue.3, pp.257-265, 2006.
DOI : 10.1016/j.tcs.2006.04.014

A. Hinz, S. Klav?ar, U. Milutinovi´cmilutinovi´c, and C. Petr, The Tower of Hanoi : Myths and Maths
DOI : 10.1007/978-3-0348-0237-6

I. Honkala and T. Laihonen, On identifying codes in the hexagonal mesh, Information Processing Letters, vol.89, issue.1, pp.9-14, 2004.
DOI : 10.1016/j.ipl.2003.09.009

I. Honkala and T. Laihonen, On identification in the triangular grid, Journal of Combinatorial Theory, Series B, vol.91, issue.1, pp.67-86, 2004.
DOI : 10.1016/j.jctb.2003.10.002

I. Honkala and A. Lobstein, On Identifying Codes in Binary Hamming Spaces, Journal of Combinatorial Theory, Series A, vol.99, issue.2, pp.232-243, 2002.
DOI : 10.1006/jcta.2002.3263

I. Honkala and A. Lobstein, On the Density of Identifying Codes in the Square Lattice, Journal of Combinatorial Theory, Series B, vol.85, issue.2, pp.297-306, 2002.
DOI : 10.1006/jctb.2001.2106

M. Ho?-nak and R. Soták, Observability of complete multipartite graphs with equipotent parts, Ars Combinatoria, vol.41, pp.289-301, 1995.

]. F. Hwang and V. , Non adaptive hypergeometric group testing, Studia Scientiarum Mathematicarum Hungaricae, vol.22, issue.1-4, pp.257-263, 1987.

M. Jakovac, A 2-parametric generalization of Sierpí nski gasket graphs

D. S. Johnson, Approximation algorithms for combinatorial problems, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.256-278, 1974.
DOI : 10.1145/800125.804034

V. Junnila, On identifying and locating-dominating codes, thèse de doctorat de l'université de Disponible en lignè a l'url http, Turku, 2011.

V. Junnila, Adaptive identification of sets of vertices in graphs, soumisàsoumis`soumisà Discrete Mathematics and Theoretical Computer Science

V. Junnila and T. Laihonen, Optimal Identifying Codes in Cycles and Paths, Graphs and Combinatorics, vol.29, issue.7
DOI : 10.1007/s00373-011-1058-6

M. Juvan, B. Mohar, A. Graovac, S. Klav?ar, and J. Zerovnik, Fast computation of the Wiener index of fasciagraphs and rotagraphs, Journal of Chemical Information and Modeling, vol.35, issue.5, pp.834-840, 1995.
DOI : 10.1021/ci00027a007

M. Karpovsky, K. Chakrabarty, and L. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol.44, issue.2, pp.599-611, 1998.
DOI : 10.1109/18.661507

M. Karpovsky, K. Chakrabarty, L. Levitin, and D. Avresky, On the covering of vertices for fault diagnosis in hypercubes, Information Processing Letters, vol.69, issue.2, pp.99-103, 1999.
DOI : 10.1016/S0020-0190(98)00199-9

W. Kautz and R. Singleton, Nonrandom binary superimposed codes, IEEE Transactions on Information Theory, vol.10, issue.4, pp.363-377, 1964.
DOI : 10.1109/TIT.1964.1053689

S. Klav?ar and B. Mohar, Crossing numbers of Sierpi??ski-like graphs, Journal of Graph Theory, vol.104, issue.3, pp.186-198, 2005.
DOI : 10.1002/jgt.20107

S. Klav?ar and U. Milutinovi´cmilutinovi´c, Graphs S(n, k) and a Variant of the Tower of Hanoi Problem, Czechoslovak Mathematical Journal, vol.47, issue.1, pp.95-104, 1997.
DOI : 10.1023/A:1022444205860

S. Klav?ar, U. Milutinovi´cmilutinovi´c, and C. Petr, 1-perfect codes in Sierpi??ski graphs, Bulletin of the Australian Mathematical Society, vol.21, issue.03, pp.369-384, 2002.
DOI : 10.2307/2159369

S. Klav?ar and A. Vesel, Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers, Discrete Applied Mathematics, vol.129, issue.2-3, pp.449-460, 2003.
DOI : 10.1016/S0166-218X(02)00597-8

]. S. Klav?ar and J. Zerovnik, Algebraic approach to fasciagraphs and rotagraphs, Discrete Applied Mathematics, vol.68, issue.1-2, pp.93-100, 1996.
DOI : 10.1016/0166-218X(95)00058-Y

M. Laifenfeld, Coding for network applications : Robust identification and distributed resource allocation, thèse de doctorat de l'université de, Boston, 2008.

M. Laifenfeld and A. Trachtenberg, Disjoint Identifying-Codes for Arbitrary Graphs, ISIT 05, IEEE International Symposium on Information Theory, 4?9 septembre 2005, Adela¨?deAdela¨?de (Australie), publié dans les proceedings pp, pp.244-248, 2005.

M. Laifenfeld and A. Trachtenberg, Identifying Codes and Covering Problems, IEEE Transactions on Information Theory, vol.54, issue.9, pp.3929-3950, 2008.
DOI : 10.1109/TIT.2008.928263
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.7461

M. Laifenfeld, A. Trachtenberg, R. Cohen, and D. Starobinski, Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes, pp.415-432, 2009.

T. Laihonen, Sequences of optimal identifying codes, IEEE Transactions on Information Theory, vol.48, issue.3, pp.774-776, 2002.
DOI : 10.1109/18.986043

T. Laihonen, On cages admitting identifying codes, European Journal of Combinatorics, vol.29, issue.3, pp.737-741, 2008.
DOI : 10.1016/j.ejc.2007.02.016

T. Laihonen and J. , On graphs admitting codes identifying sets of vertices, Australasian Journal of Combinatorics, vol.41, pp.81-91, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00182323

T. Laihonen and S. Ranto, Codes Identifying Sets of Vertices, Lecture Notes in Computer Science, vol.2227, pp.82-91, 2001.
DOI : 10.1007/3-540-45624-4_9
URL : https://hal.archives-ouvertes.fr/hal-00182323

S. L. Lipscomb, Fractals and universal spaces in dimension theory, 2009.
DOI : 10.1007/978-0-387-85494-6

S. L. Lipscomb and J. C. Perry, Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space, Proceedings of the American Mathematical Society, vol.115, issue.4, pp.1157-1165, 1992.
DOI : 10.2307/2159369

C. Y. Lee, Some properties of nonbinary error-correcting codes, IEEE Transactions on Information Theory, vol.4, issue.2, pp.77-82, 1958.
DOI : 10.1109/TIT.1958.1057446

M. Livingston and Q. F. Stout, Constant time computation of minimum dominating sets, Congressus Numerantium, vol.105, pp.116-128, 1994.

A. Lobstein, Watching systems, identifying, locating-dominating and discriminating codes in graphs, bibliographie. Disponible en lignè a l'url http

R. Martin and B. Stanton, Lower bounds for identifying codes in some infinite grids, Electronic Journal of Combinatorics, vol.17, p.122, 2010.

S. L. Mitchell, E. J. Cockayne, and S. T. Hedetniemi, Linear algorithms on recursive representations of trees, Journal of Computer and System Sciences, vol.18, issue.1, pp.76-85, 1979.
DOI : 10.1016/0022-0000(79)90053-9

J. Moncel, G. Finke, and V. Jost, A general result on single machine scheduling problems subject to learning effects or deteriorating jobs, soumisàsoumis`soumisà OR Letters. Disponible en lignè a l'url http

J. Moncel, G. Finke, and V. Jost, Single-machine scheduling problems with position-dependent processing times, 13th International Conference on Project Management and Scheduling, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00647789

J. Moncel, J. Thiery, and A. Waserhole, Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint, soumis. Une version préliminaire est disponible en ligne sur HAL

R. Motwanin and M. Sudan, Computing roots of graphs is hard, Discrete Applied Mathematics, vol.54, issue.1, pp.81-88, 1994.
DOI : 10.1016/0166-218X(94)00023-9

. Ch and M. Papadimitriou, Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, pp.425-440, 1991.

]. T. Bibliographie154, J. ¨-uller, and . Sereni, Identifying and locating-dominating codes in (random ) geometric networks, Combinatorics Probability and Computing, vol.18, issue.6, pp.925-952, 2009.

S. Ranto, Identifying and locating-dominating codes in binary Hamming spaces, thèse de doctorat de l'université de Turku Disponible en lignè a l'url http, 2007.

A. Raspaud and L. Tong, The minimum identifying code graphs, Discrete Applied Mathematics, vol.160, issue.9
DOI : 10.1016/j.dam.2012.01.015

S. Ray, D. Starobinski, A. Trachtenberg, and R. Ungrangsi, Robust Location Detection With Sensor Networks, IEEE Journal on Selected Areas in Communications, vol.22, issue.6, pp.1016-1025, 2004.
DOI : 10.1109/JSAC.2004.830895

A. Rényi, On a problem of information theory, Publications of the Mathematical Institute of the Hungarian Academy of Sciences 6B, pp.505-516, 1962.

D. L. Roberts and F. S. Roberts, Locating sensors in paths and cycles: The case of 2-identifying codes, European Journal of Combinatorics, vol.29, issue.1, pp.72-82, 2008.
DOI : 10.1016/j.ejc.2006.12.006

M. Ruszinkóruszink´ruszinkó, On a 2-dimensional search problem, Journal of Statistical Planning and Inference, vol.37, issue.3, pp.371-383, 1993.
DOI : 10.1016/0378-3758(93)90113-K

M. Ruszinkóruszink´ruszinkó, On the upper bound of the size of the r-cover-free families, Journal of Combinatorial Theory, Series A, vol.66, issue.2, pp.302-310, 1994.
DOI : 10.1016/0097-3165(94)90067-1

C. Sadfi, B. Penz, C. Rapine, J. B?a, ?. Zewicz et al., An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints, European Journal of Operational Research, vol.161, issue.1, pp.3-10, 2005.
DOI : 10.1016/j.ejor.2003.08.026
URL : https://hal.archives-ouvertes.fr/hal-00239327

R. R. Singleton, On Minimal graphs of maximum even girth, Journal of Combinatorial Theory, vol.1, issue.3, pp.306-332, 1966.
DOI : 10.1016/S0021-9800(66)80054-6

R. Skaggs, Identifying vertices in graphs and digraphs, thèse de doctorat de l'université d Disponible en lignè a l'url uir.unisa.ac.za/bitstream, Afrique du Sud, 2007.

A. Spalding, Min-plus algebra and graph domination, thèse de doctorat de l'université du Colorado, 1998.

B. Stanton, On vertex identifying codes for infinite lattices, thèse de doctorat de l'université d'Iowa (2011) Disponible en lignè a l'url http

W. S. Suen, A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph, Random Structures and Algorithms, vol.10, issue.2, pp.231-242, 1990.
DOI : 10.1002/rsa.3240010210

J. Suomela, Approximability of identifying codes and locating???dominating codes, Information Processing Letters, vol.103, issue.1, pp.28-33, 2007.
DOI : 10.1016/j.ipl.2007.02.001

A. M. Teguia and A. P. Godbole, Sierpí nski gasket graphs and some of their properties, Australasian Journal of Combinatorics, vol.35, pp.181-192, 2006.

J. Thiery, A. Waserhole, and J. , Schéma d'approximation polynomial pour la minimisation d'encours sur une machine avec période de maintenance , congrès ROADEF, pp.25-27, 2008.

R. Ungrangsi, A. Trachtenberg, and D. Starobinski, An Implementation of Indoor Location Detection Systems Based on Identifying Codes, Lecture Notes in Computer Science, vol.3283, pp.175-189, 2004.
DOI : 10.1007/978-3-540-30179-0_16

V. Vazirani, Approximation algorithms, 2001.
DOI : 10.1007/978-3-662-04565-7

V. G. Vizing, SOME UNSOLVED PROBLEMS IN GRAPH THEORY, Russian Mathematical Surveys, vol.23, issue.6, pp.125-141, 1968.
DOI : 10.1070/RM1968v023n06ABEH001252

P. Winkler, Random Structures and Zero-One Laws, Proceedings of the NATO Advanced Study Institute, NATO ASI Series C 411, pp.399-420, 1993.
DOI : 10.1007/978-94-011-2080-7_27

T. Wright, Factors Affecting the Cost of Airplanes, Journal of the Aeronautical Sciences, vol.3, issue.4, pp.122-128, 1936.
DOI : 10.2514/8.155

Y. Xiao, C. Hadjicostis, and K. Thulasiraman, The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm, 12th Annual International Computing and Combinatorics Conference, pp.15-18
DOI : 10.1007/11809678_31

M. Xu, K. Thulasiraman, and X. Hu, Identifying codes of cycles with odd orders, European Journal of Combinatorics, vol.29, issue.7, pp.1717-1720, 2008.
DOI : 10.1016/j.ejc.2007.09.006

L. Yelle, THE LEARNING CURVE: HISTORICAL REVIEW AND COMPREHENSIVE SURVEY, Decision Sciences, vol.17, issue.8, pp.302-328, 1979.
DOI : 10.1016/0019-8501(76)90037-7

J. Zerovnik, Deriving formulas for domination numbers of fasciagraphs and rotagraphs, Lecture Notes in Computer Science, vol.1684, pp.559-568, 1999.
DOI : 10.1007/3-540-48321-7_47

G. Laboratoire, Laboratoire Grenoblois des Sciences pour la Conception, l'Optimisation et la Production ? UMR 5272

. Modèlesmodèles, ModèlesàModèlesà´Modèlesàévénements discrets Grenoble INP ? Génie Industriel (niveau M1), 2008.

?. Le, M. S. Gravier, J. Moncel, and A. Semri, Identifying codes of cycles, European Journal of Combinatorics, vol.27, pp.767-776, 2006.

. Concerne-l-'´-etude-des-cycles, Il contient des résultats améliorant ceux de Bertrand, Charon, Hudry et Lobstein [25] ainsi que ceux de Gimbel

?. Le, M. A. Frieze, R. Martin, J. Moncel, M. Ruszinkóruszink´ruszinkó et al., Codes identifying sets of vertices in random networks, Discrete Mathematics, vol.307, pp.9-10, 2007.