+ LIEN VERS UNE BIBLIOGRAPHIE

B [60]   Olivier HUDRY, Ville JUNNILA & Antoine LOBSTEIN, Iiro Honkala's Contributions to Identifying Codes, soumis.

99.[59] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Codes in the q-ary Lee Hypercube. WSEAS Transactions on Mathematics, Vol. 21, pp. 173-186, 2022.
----- Résumé, Abstract.

98.[58] Olivier HUDRY & Antoine LOBSTEIN, Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems. International Transactions in Operational Research, Vol. 29(3), pp. 1547-1572, 2022.
----- Résumé, Abstract.

97.[57] Antoine LOBSTEIN, Olivier HUDRY & Irène CHARON, Locating-Domination and Identification. Chapter in: Topics in Domination in Graphs, T. Haynes, S. Hedetniemi & M. Henning, Eds., pp. 251-299, Springer, 2020.
----- Résumé, Abstract.

96.[56] Olivier HUDRY & Antoine LOBSTEIN, The Compared Costs of Domination, Location-Domination and Identification. Discussiones Mathematicae Graph Theory, Vol. 40(1), pp. 127-147, 2020.
----- Résumé, Abstract.
http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.2129

94.[55] Olivier HUDRY & Antoine LOBSTEIN, Unique (Optimal) Solutions: Complexity Results for Identifying and Locating-Dominating Codes. Theoretical Computer Science, Vol. 767, pp. 83-102, 2019.
----- Résumé, Abstract.

93.[54] Olivier HUDRY & Antoine LOBSTEIN, Some Results About a Conjecture on Identifying Codes in Complete Suns. International Transactions in Operational Research, Vol. 26, pp. 732-746, 2019.
----- Résumé, Abstract.

92.[53] Olivier HUDRY & Antoine LOBSTEIN, On the Complexity of the Uniqueness of Solutions in Graph Problems. Rapport interne Telecom ParisTech-2017D001, Paris, France, 119 pages, avril 2017.
----- Résumé, Abstract.

90.[52] Olivier HUDRY & Antoine LOBSTEIN, More Results on the Complexity of Identifying Problems in Graphs. Theoretical Computer Science, Vol. 626, pp. 1-12, 2016.
----- Résumé, Abstract.

89.[51] Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, On the Ensemble of Optimal Identifying Codes in a Twin-Free Graph. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, Vol. 8, pp. 139-153, 2016.
----- Résumé, Abstract.

88.[50] Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, On the Ensemble of Optimal Dominating and Locating-Dominating Codes in a Graph. Information Processing Letters, Vol. 115, pp. 699-702, 2015.
----- Résumé, Abstract.

87.[49] Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, On the Number of Optimal Identifying Codes in a Twin-Free Graph. Discrete Applied Mathematics, Vol. 180, pp. 111-119, 2015.
----- Résumé, Abstract.

86.[48] Irène CHARON, Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, Minimum Sizes of Identifying Codes in Graphs Differing by One Edge. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, Vol. 6, pp. 157-170, 2014.
----- Résumé, Abstract.

85.[47] David AUGER, Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Maximum Size of a Minimum Watching System and the Graphs Achieving the Bound. Discrete Applied Mathematics, Vol. 164, pp. 20-33, 2014.
----- Résumé, Abstract.

84.[46] David AUGER, Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Watching Systems in Graphs: an Extension of Identifying Codes. Discrete Applied Mathematics, Vol. 161, pp. 1674-1685, 2013.
----- Résumé, Abstract.

83.[45] Irène CHARON, Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, Minimum Sizes of Identifying Codes in Graphs Differing by One Vertex. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, Vol. 5, pp. 119-136, 2013.
----- Résumé, Abstract.

82.[44] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Extremal Values for the Maximum Degree in a Twin-Free Graph. Ars Combinatoria, Vol. 107, pp. 257-274, 2012.
----- Résumé, Abstract.

81.[43] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex. Rapport interne Telecom ParisTech-2011D008, Paris, France, 30 pages, octobre 2011.
----- Résumé, Abstract.

79.[42] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs. Ars Combinatoria, Vol. 101, pp. 161-185, 2011.
----- Résumé, Abstract.

78.[41] Yael BEN-HAIM, Sylvain GRAVIER, Antoine LOBSTEIN & Julien MONCEL, Adaptive Identification in Torii in the King Lattice. Electronic Journal of Combinatorics, Vol. 18(1), P116, 2011.
---- Pour voir le résumé puis avoir accès à l'article :
---- To see the abstract and the paper:
http://www.combinatorics.org/Volume_18/Abstracts/v18i1p116.html

77.[40] David AUGER, Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Complexity Results for Identifying Codes in Planar Graphs. International Transactions in Operational Research, Vol. 17, pp. 691-710, 2010.
----- Résumé, Abstract.

76.[39] David AUGER, Irène CHARON, Olivier HUDRY & Antoine 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, pp. 591-609, 2010.
----- Résumé, Abstract.

74.[38] David AUGER, Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Maximum Size of a Minimum Watching System and the Graphs Achieving the Bound. Rapport interne Telecom ParisTech-2010D011, Paris, France, 40 pages, mars 2010.
----- Résumé, Abstract.

73.[37] Irène CHARON, Gérard COHEN, Olivier HUDRY & Antoine LOBSTEIN, New Identifying Codes in the Binary Hamming Space. European Journal of Combinatorics, Vol. 31, pp. 491-501, 2010.
----- Résumé, Abstract.

72.[36] David AUGER, Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Existence d'un cycle de longueur au moins 7 dans un graphe sans (1,=<2)-jumeaux. Rapport interne Telecom ParisTech-2009D015, Paris, France, 18 pages, juillet 2009.
----- Résumé, Abstract.

71.[35] David AUGER, Irène CHARON, Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, Edge Number, Minimum Degree, Maximum Independent Set, Radius and Diameter in Twin-Free Graphs. Advances in Mathematics of Communications, Vol. 3(1), pp. 97-114, 2009. Erratum in Vol. 3(4), pp. 429--430, 2009.
----- Résumé, Abstract.

70.[34] Emmanuel CHARBIT, Irène CHARON, Gérard COHEN, Olivier HUDRY & Antoine LOBSTEIN, Discriminating Codes in Bipartite Graphs: Bounds, Extremal Cardinalities, Complexity. Advances in Mathematics of Communications, Vol. 2(4), pp. 403-420, 2008.
----- Résumé, Abstract.

69.[33] Yael BEN-HAIM, Sylvain GRAVIER, Antoine LOBSTEIN & Julien MONCEL, Adaptive Identification in Graphs. Journal of Combinatorial Theory, Ser. A, Vol. 115, pp. 1114-1126, 2008.
----- Résumé, Abstract.

68.[32] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Extremal Values for the Maximum Degree in a Twin-Free Graph. Rapport interne TELECOM ParisTech-2008D007, Paris, France, 17 pages, mai 2008.
----- Résumé, Abstract.

67.[31] Irène CHARON, Gérard COHEN, Olivier HUDRY & Antoine LOBSTEIN, Discriminating Codes in (Bipartite) Planar Graphs. European Journal of Combinatorics, Vol. 29, pp. 1353-1364, 2008.
----- Résumé, Abstract.

66.[30] Irène CHARON, Gérard COHEN, Olivier HUDRY & Antoine LOBSTEIN, Links Between Discriminating and Identifying Codes in the Binary Hamming Space. Lecture Notes in Computer Science, Vol. 4851, pp. 267-270, 2007.
----- Résumé, Abstract.

65.[29] Yael BEN-HAIM, Sylvain GRAVIER, Antoine LOBSTEIN & Julien MONCEL, Adaptive Identification in Graphs. Rapport interne Télécom Paris-2007D012, Paris, France, 33 pages, septembre 2007.
----- Résumé, Abstract.

64.[28] Irène CHARON, Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, Structural Properties of Twin-Free Graphs. Electronic Journal of Combinatorics, Vol. 14(1), R16, 2007.
---- Pour voir le résumé puis avoir accès à l'article :
---- To see the abstract and the paper:
http://www.combinatorics.org/Volume_14/Abstracts/v14i1r16.html

63.[27] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Extremal Cardinalities for Identifying and Locating-Dominating Codes in Graphs. Discrete Mathematics, Vol. 307, pp. 356-366, 2007 .
----- Résumé, Abstract.

62.[26] 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, Vol. 154, pp. 1246-1253, 2006.
----- Résumé, Abstract.

61.[25] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Possible Cardinalities for Locating-Dominating Codes in Graphs. Australasian Journal of Combinatorics, Vol. 34, pp. 23-32, 2006.
----- Résumé, Abstract.

60.[24] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, On the Structure of Identifiable Graphs. Electronic Notes in Discrete Mathematics, Vol. 22, pp. 491-495, 2005.
----- Résumé, Abstract.

59.[23] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Possible Cardinalities for Identifying Codes in Graphs. Australasian Journal of Combinatorics, Vol. 32, pp. 177-195, 2005.
----- Résumé, Abstract.

58.[22] Nathalie BERTRAND, Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, 1-Identifying Codes on Trees. Australasian Journal of Combinatorics, Vol. 31, pp. 21-35, 2005.
----- Résumé, Abstract.

57.[21] Nathalie BERTRAND, Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Identifying and Locating-Dominating Codes on Chains and Cycles. European Journal of Combinatorics, Vol. 25/7, pp. 969-987, 2004.
----- Résumé, Abstract.

56.[20] Irène CHARON, Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, The Minimum Density of an Identifying Code in the King Lattice. Discrete Mathematics, Vol. 276(1/3), pp. 95-109, 2004.
----- Résumé, Abstract.

55.[19] Iiro HONKALA & Antoine LOBSTEIN, On Identification in Z² Using Translates of Given Patterns. Journal of Universal Computer Science, Vol. 9(10), pp. 1204-1219, October 2003.
----- Résumé, Abstract.
----- http://www.jucs.org

54.[18] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Extremal Cardinalities for Identifying and Locating-Dominating Codes in Graphs. Rapport interne Télécom Paris-2003D006, Paris, France, 18 pages, août 2003.

53.[17] Nathalie BERTRAND, Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Identifying or Locating-Dominating Codes for some Families of Graphs. Rapport interne Télécom Paris-2003C001, Paris, France, 48 pages, février 2003.

52.[16] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Minimizing the Size of an Identifying or Locating-Dominating Code in a Graph is NP-Hard. Theoretical Computer Science, Vol. 290/3, pp. 2109-2120, 2003.
----- Résumé, Abstract.

51.[15] Iiro HONKALA & Antoine LOBSTEIN, On the Complexity of the Identification Problem in Hamming Spaces. Acta Informatica, Vol. 38, pp. 839-845, 2002.
----- Résumé, Abstract.

50.[14] Iiro HONKALA & Antoine LOBSTEIN, On Identifying Codes in Binary Hamming Spaces. Journal of Combinatorial Theory, Ser. A, Vol. 99, pp. 232-243, 2002.
----- Résumé, Abstract.

49.[13] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Identifying and Locating-Dominating Codes: NP-Completeness Results for Directed Graphs. IEEE Transactions on Information Theory, Vol. IT-48, pp. 2192-2200, August 2002.
----- Résumé, Abstract.

48.[12] Iiro HONKALA & Antoine LOBSTEIN, On the Density of Identifying Codes in the Square Lattice. Journal of Combinatorial Theory, Ser. B, Vol. 85, pp. 297-306, 2002.
----- Résumé, Abstract.

47.[11] Antoine LOBSTEIN, Contributions combinatoires au codage, en connexion avec la complexité et la cryptographie. Mémoire d'Habilitation à Diriger des Recherches, Université Paris 6, Rapport interne Télécom Paris-2002D003, Paris, France, x+316 pages, juin 2002.
--- Texte disponible en ligne, Text available on-line.

46.[10] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Identifying Codes With Small Radius in Some Infinite Regular Graphs. Electronic Journal of Combinatorics, Vol. 9(1), R11, 2002.
---- Pour voir le résumé puis avoir accès à l'article :
---- To see the abstract and the paper:
http://www.combinatorics.org/Volume_9/Abstracts/v9i1r11.html

45.[9] Irène CHARON, Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, General Bounds for Identifying Codes in Some Infinite Regular Graphs. Electronic Journal of Combinatorics, Vol. 8(1), R39, 2001.
---- Pour voir le résumé puis avoir accès à l'article :
---- To see the abstract and the paper:
http://www.combinatorics.org/Volume_8/Abstracts/v8i1r39.html

44.[8] Irène CHARON, Olivier HUDRY & Antoine LOBSTEIN, Complexity of Identifying and Locating Problems in Graphs. Rapport interne Télécom Paris-2001D013, Paris, France, 36 pages, octobre 2001.

42.[7] Gérard COHEN, Iiro HONKALA, Antoine LOBSTEIN & Gilles ZÉMOR, On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals. IEEE Transactions on Computers, Vol. 50, pp. 174-176, February 2001.
----- Résumé, Abstract.

41.[6] Gérard COHEN, Iiro HONKALA, Antoine LOBSTEIN & Gilles ZÉMOR, On Identifying Codes. Proceedings of DIMACS Workshop on Codes and Association Schemes '99, Vol. 56, pp. 97-109, January 2001.
----- Résumé, Abstract.

39.[5] Irène CHARON, Iiro HONKALA, Olivier HUDRY & Antoine LOBSTEIN, Identifying Codes. Rapport interne Télécom Paris-2000D009, Paris, France, 67 pages, octobre 2000.

38.[4] Gérard COHEN, Iiro HONKALA, Antoine LOBSTEIN & Gilles ZÉMOR, Bounds for Codes Identifying Vertices in the Hexagonal Grid. SIAM Journal on Discrete Mathematics, Vol. 13, No. 4, pp. 492-504, 2000.
----- Résumé, Abstract.

37.[3] Gérard COHEN, Sylvain GRAVIER, Iiro HONKALA, Antoine LOBSTEIN, Michel MOLLARD, Charles PAYAN & Gilles ZÉMOR, Improved Identifying Codes for the Grid. Electronic Journal of Combinatorics, Vol. 6(1), Comments to R19, 1999.
---- Pour voir le résumé puis avoir accès à l'article :
---- To see the abstract and the paper:
http://www.combinatorics.org/Volume_6/Html/v6i1r19.html

36.[2] Gérard COHEN, Antoine LOBSTEIN & Gilles ZÉMOR, Identification d'une station défaillante dans un contexte radio-mobile. Aspects Algorithmiques des Télécommunications (AlgoTel '99), Actes, pp. 19-22, 1999.
----- Résumé, Abstract.

35.[1] Gérard COHEN, Iiro HONKALA, Antoine LOBSTEIN & Gilles ZÉMOR, New Bounds for Codes Identifying Vertices in Graphs. Electronic Journal of Combinatorics, Vol. 6(1), R19, 1999.
---- Pour voir le résumé puis avoir accès à l'article :
---- To see the abstract and the paper:
http://www.combinatorics.org/Volume_6/Abstracts/v6i1r19.html

BIBLIOGRAPHIE
pour les codes identifiants, localisateurs-dominateurs, discriminants, ainsi que pour les systèmes de contrôle

Autres thèmes:   Rayon de recouvrement     Codes parfaits     [Codes identifiants]     Codes arithmétiques     Complexité     Exponentiation     Puissances de graphes

Liste complète des publications
Revenir à la page d'accueil
Revenir en haut de la page