Antoine Lobstein

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 14

Top Topics

Hamiltonian Cycle

Mazurkiewicz Traces

Top Venues

Fundam. Informaticae

Discret. Appl. Math.

Cryptogr. Commun.

Publications

Olivier Hudry, Ville Junnila, Antoine Lobstein
On Iiro Honkala's Contributions to Identifying Codes. Fundam. Informaticae 191 (3-4) (2024)
David Auger, Johanne Cohen, Antoine Lobstein
Nonatomic Non-Cooperative Neighbourhood Balancing Games. Fundam. Informaticae 191 (3-4) (2024)
Olivier Hudry, Ville Junnila, Antoine Lobstein
Iiro Honkala's contributions to identifying codes. CoRR (2024)
David Auger, Johanne Cohen, Antoine Lobstein
Nonatomic Non-Cooperative Neighbourhood Balancing Games. CoRR (2023)
Olivier Hudry, Antoine Lobstein
Some rainbow problems in graphs have complexity equivalent to satisfiability problems. Int. Trans. Oper. Res. 29 (3) (2022)
Olivier Hudry, Antoine Lobstein
On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path. CoRR (2022)
Olivier Hudry, Antoine Lobstein
The compared costs of domination, location-domination and identification. Discuss. Math. Graph Theory 40 (1) (2020)
Olivier Hudry, Antoine Lobstein
Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes. Theor. Comput. Sci. 767 (2019)
Olivier Hudry, Antoine Lobstein
Some results about a conjecture on identifying codes in complete suns. Int. Trans. Oper. Res. 26 (2) (2019)
Olivier Hudry, Antoine Lobstein
More results on the complexity of domination problems in graphs. Int. J. Inf. Coding Theory 4 (2/3) (2017)
Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
On the ensemble of optimal identifying codes in a twin-free graph. Cryptogr. Commun. 8 (1) (2016)
Olivier Hudry, Antoine Lobstein
More results on the complexity of identifying problems in graphs. Theor. Comput. Sci. 626 (2016)
Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
On the ensemble of optimal dominating and locating-dominating codes in a graph. Inf. Process. Lett. 115 (9) (2015)
Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
On the number of optimal identifying codes in a twin-free graph. Discret. Appl. Math. 180 (2015)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
Maximum size of a minimum watching system and the graphs achieving the bound. Discret. Appl. Math. 164 (2014)
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
Minimum sizes of identifying codes in graphs differing by one edge. Cryptogr. Commun. 6 (2) (2014)
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
Minimum sizes of identifying codes in graphs differing by one vertex. Cryptogr. Commun. 5 (2) (2013)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
Watching systems in graphs: An extension of identifying codes. Discret. Appl. Math. 161 (12) (2013)
Irène Charon, Olivier Hudry, Antoine Lobstein
Extremal Values for the Maximum Degree in a Twin-Free Graph. Ars Comb. 107 (2012)
Irène Charon, Olivier Hudry, Antoine Lobstein
Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs. Ars Comb. 101 (2011)
Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel
Adaptive Identification in Torii in the King Lattice. Electron. J. Comb. 18 (1) (2011)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
On the sizes of graphs and their powers: The undirected case. Discret. Appl. Math. 159 (16) (2011)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
Complexity results for identifying codes in planar graphs. Int. Trans. Oper. Res. 17 (6) (2010)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
-twin-free graph. Discuss. Math. Graph Theory 30 (4) (2010)
Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein
New identifying codes in the binary Hamming space. Eur. J. Comb. 31 (2) (2010)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
Watching Systems in graphs: an extension of Identifying Codes CoRR (2010)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
\ G: the directed case. Australas. J Comb. 48 (2010)
David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
Erratum. Adv. Math. Commun. 3 (4) (2009)
David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. Adv. Math. Commun. 3 (1) (2009)
Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein
Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Adv. Math. Commun. 2 (4) (2008)
Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel
Adaptive identification in graphs. J. Comb. Theory, Ser. A 115 (7) (2008)
Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein
Discriminating codes in (bipartite) planar graphs. Eur. J. Comb. 29 (5) (2008)
Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein
Links Between Discriminating and Identifying Codes in the Binary Hamming Space. AAECC (2007)
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
Structural Properties of Twin-Free Graphs. Electron. J. Comb. 14 (1) (2007)
Irène Charon, Olivier Hudry, Antoine Lobstein
Extremal cardinalities for identifying and locating-dominating codes in graphs. Discret. Math. 307 (3-5) (2007)
Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel
A linear algorithm for minimum 1-identifying codes in oriented trees. Discret. Appl. Math. 154 (8) (2006)
Irène Charon, Olivier Hudry, Antoine Lobstein
Possible cardinalities for locating-dominating codes in graphs. Australas. J Comb. 34 (2006)
Irène Charon, Olivier Hudry, Antoine Lobstein
On the Structure of Identifiable Graphs. Electron. Notes Discret. Math. 22 (2005)
Irène Charon, Olivier Hudry, Antoine Lobstein
Possible cardinalities for identifying codes in graphs. Australas. J Comb. 32 (2005)
Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein
1-identifying codes on trees. Australas. J Comb. 31 (2005)
Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein
Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25 (7) (2004)
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
The minimum density of an identifying code in the king lattice. Discret. Math. 276 (1-3) (2004)
Irène Charon, Olivier Hudry, Antoine Lobstein
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theor. Comput. Sci. 290 (3) (2003)
Iiro S. Honkala, Antoine Lobstein
Using Translates of Given Patterns. J. Univers. Comput. Sci. 9 (10) (2003)
Iiro S. Honkala, Antoine Lobstein
On the Density of Identifying Codes in the Square Lattice. J. Comb. Theory, Ser. B 85 (2) (2002)
Iiro S. Honkala, Antoine Lobstein
On the complexity of the identification problem in Hamming spaces. Acta Informatica 38 (11/12) (2002)
Iiro S. Honkala, Antoine Lobstein
On Identifying Codes in Binary Hamming Spaces. J. Comb. Theory, Ser. A 99 (2) (2002)
Irène Charon, Olivier Hudry, Antoine Lobstein
Identifying Codes with Small Radius in Some Infinite Regular Graphs. Electron. J. Comb. 9 (1) (2002)
Irène Charon, Olivier Hudry, Antoine Lobstein
Identifying and locating-dominating codes: NP-Completeness results for directed graphs. IEEE Trans. Inf. Theory 48 (8) (2002)
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
General Bounds for Identifying Codes in Some Infinite Regular Graphs. Electron. J. Comb. 8 (1) (2001)
Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva
Intersection matrices for partitions by binary perfect codes. IEEE Trans. Inf. Theory 47 (4) (2001)
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals. IEEE Trans. Computers 50 (2) (2001)
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
Bounds for Codes Identifying Vertices in the Hexagonal Grid. SIAM J. Discret. Math. 13 (4) (2000)
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
On identifying codes. Codes and Association Schemes (1999)
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
New Bounds for Codes Identifying Vertices in Graphs. Electron. J. Comb. 6 (1999)
Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor
How to Improve an Exponentiation Black-Box. EUROCRYPT (1998)
Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.
Covering Radius 1985-1994. Appl. Algebra Eng. Commun. Comput. 8 (3) (1997)
Antoine Lobstein, Victor A. Zinoviev
On New Perfect Binary Nonlinear Codes. Appl. Algebra Eng. Commun. Comput. 8 (5) (1997)
Antoine Lobstein, Vera Pless
The Length Function: A Revised Table. Algebraic Coding (1993)
Gregory Kabatianskii, Antoine Lobstein
On Plotkin-Elias Type Bounds for Binary Arithmetic Codes. Algebraic Coding (1993)
Antoine Lobstein
On perfect arithmetic codes. Discret. Math. (1992)
Antoine Lobstein, Patrick Solé
Arithmetic Codes - Survey, Recent and New Results. AAECC (1991)
Antoine Lobstein, Gerhard J. M. van Wee
Correction to 'On normal and subnormal q-ary codes' (Nov 89 1291-1295). IEEE Trans. Inf. Theory 36 (6) (1990)
Antoine Lobstein
The hardness of solving subset sum with preprocessing. IEEE Trans. Inf. Theory 36 (4) (1990)
Antoine Lobstein, Gerhard J. M. van Wee
On normal and subnormal q-ary codes. IEEE Trans. Inf. Theory 35 (6) (1989)
Antoine Lobstein
Comments on 'A note on perfect arithmetic codes' by J. Astola. IEEE Trans. Inf. Theory 34 (3) (1988)
Antoine Lobstein, Gérard D. Cohen
Sur La Complexité D'un Problème De Codage. RAIRO Theor. Informatics Appl. 21 (1) (1987)
Antoine Lobstein
On Modular Weights in Arithmetic Codes. Coding Theory and Applications (1986)
Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane
Further results on the covering radius of codes. IEEE Trans. Inf. Theory 32 (5) (1986)
Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane
On a conjecture concerning coverings of Hamming space. AAECC (1984)