• Bertrand, N., Charon, I., Hudry, O., Lobstein, A., 2004. Identifying and locating-dominating codes on chains and cycles. European Journal of Combinatorics 25, 969987.
  • Charon, I., Hudry, O., Lobstein, A., 2003. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theoretical Computer Science 290, 21092120.
  • Diestel, R., 2005. Graph Theory, (3rd edn), Springer-Verlag, Berlin.
  • Garey, M.R., Johnson, D.S., 1977. The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32, 4, 826834.
  • Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
  • Gravier, S., Klasing, R., Moncel, J., 2008. Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Operations Research 3, 1, 4350.
  • Gravier, S., Moncel, J., 2005. Construction of codes identifying sets of vertices. Electronic Journal of Combinatorics 12, 1, R13.
  • Gravier, S., Moncel, J., Semri, A., 2006. Identifying codes of cycles. European Journal of Combinatorics 27, 767776.
  • Karp, R.M., 1972. Reducibility among combinatorial problems. In Miller, R.E., Thatcher, J.W. (eds) Complexity of Computer Computations. Plenum Press, New York, pp. 85103.
  • Karpovsky, M.G., Chakrabarty, K., Levitin, L.B., 1998. On a new class of codes for identifying vertices in graphs. IEEE Transactions on Information Theory 44, 599611.
  • Laihonen, T., Moncel, J., 2008. On graphs admitting codes identifying sets of vertices. Australasian Journal of Combinatorics 41, 8191.
  • Laihonen, T., Ranto, S., 2001. Codes identifying sets of vertices, Lecture Notes in Computer Science, No. 2227. Springer-Verlag, Berlin, pp. 8291.
  • Lobstein, A., 2010. Bibliography on identifying, locating-dominating and discriminating codes in graphs. Available at: (accessed April 2010).
  • Roberts, D.L., Roberts, S., 2008. Locating sensors in paths and cycles: The case of 2-identifying codes. European Journal of Combinatorics 29, 1, 7282.
  • Suomela, J., 2007. Approximability of identifying codes and locating-dominating codes. Information Processing Letters 103, 2833.
  • Xu, M., Thulasiraman, K., Hu, X.-D., 2008. Identifying codes of cycles with odd orders. European Journal of Combinatorics 29, 7, 17171720.