LISTE DE MES PUBLICATIONS RELATIVES À LA COMPLEXITÉ
(PROBLÈMES DE CODAGE, PROBLÈMES DANS LES GRAPHES)
(avec liens vers mes co-auteurs)

C [29]   David AUGER, Johanne COHEN & Antoine LOBSTEIN, Nonatomic Non-Cooperative Selfish Neighbourhood Balancing Games, soumis.

A [28]   Olivier HUDRY & Antoine LOBSTEIN, Some Complexity Considerations on the Uniqueness of Graph Colouring, soumis.

101.[27] Olivier HUDRY & Antoine LOBSTEIN, Complexité du problème de l'unicité d'un transversal minimum dans un graphe, Proceedings of 11th International Colloquium on Graph Theory and Combinatorics 2022, 2022.

100.[26] Olivier HUDRY & Antoine LOBSTEIN, On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path. WSEAS Transactions on Mathematics, Vol. 21, pp. 433-446, 2022.
----- Résumé, Abstract.

98.[25] 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.

95.[24] Olivier HUDRY & Antoine LOBSTEIN, Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and Domination. Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 110, pp. 217-240, 2019.
----- Résumé, Abstract.

94.[23] 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.

92.[22] 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.

91.[21] Olivier HUDRY & Antoine LOBSTEIN, More Results on the Complexity of Domination Problems in Graphs. International Journal of Information and Coding Theory, Vol. 4, pp. 129-144, 2017.
----- Résumé, Abstract.

90.[20] 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.

84.[19] 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.

77.[18] 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.

70.[17] 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.

67.[16] 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.

62.[15] 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.

52.[14] 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.[13] 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.[12] 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.[11] 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.

47.[10] 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.

44.[9] 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.

41.[8] 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.

34.[7] Iiro HONKALA & Antoine LOBSTEIN, On the Complexity of Calculating the Minimum Norm of a Binary Code. Proceedings of Workshop on Coding and Cryptography '99, pp. 21-27, January 1999.
----- Résumé, Abstract.

28.[6] Jean-Pierre BARTHÉLEMY, Gérard COHEN & Antoine LOBSTEIN, Algorithmic Complexity and Communication Problems. London : University College of London, 256+xx pages, 1996.
----- Pour en lire l'introduction, CLIQUEZ ICI SVP.
----- To see the Introduction, please CLICK HERE.

22.[5] Jean-Pierre BARTHÉLEMY, Gérard COHEN & Antoine LOBSTEIN, Complexité algorithmique et problèmes de communications. Paris : Masson (collection CNET-ENST), 228+xxviii pages, 1992.
----- Table des matières.
----- Pour en lire la critique dans Mathematical Reviews, cliquez ici.

16.[4] Antoine LOBSTEIN, The Hardness of Solving Subset Sum with Preprocessing. IEEE Transactions on Information Theory, Vol. IT-36, pp. 943-946, July 1990.
----- Résumé, Abstract.

14.[3] Jean-Pierre BARTHÉLEMY, Gérard COHEN & Antoine LOBSTEIN, Eléments d'algorithmique moderne. Polycopié Télécom Paris-90INF002, Paris, France, 245 pages, avril 1990.

12.[2] Antoine LOBSTEIN, A New Proof for the Complexity of Linear Decoding with Preprocessing. Rapport interne Télécom Paris-89D006, Paris, France, 8 pages, octobre 1989.

7.[1] Antoine LOBSTEIN & Gérard COHEN, Sur la complexité d'un problème de codage. RAIRO Informatique Théorique et Applications, Vol. 21, No. 1, pp. 25-32, 1987.
----- Résumé, Abstract.

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