Antoine Lobstein

According to our database, Antoine Lobstein authored at least 68 papers between 1984 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On Iiro Honkala's Contributions to Identifying Codes.

Olivier Hudry, Ville Junnila, Antoine Lobstein

Fundam. Informaticae, 2024

Nonatomic Non-Cooperative Neighbourhood Balancing Games.

David Auger, Johanne Cohen, Antoine Lobstein

Fundam. Informaticae, 2024

2022

Some rainbow problems in graphs have complexity equivalent to satisfiability problems.

Olivier Hudry, Antoine Lobstein

Int. Trans. Oper. Res., 2022

On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path.

Olivier Hudry, Antoine Lobstein

CoRR, 2022

2020

The compared costs of domination, location-domination and identification.

Olivier Hudry, Antoine Lobstein

Discuss. Math. Graph Theory, 2020

2019

Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes.

Olivier Hudry, Antoine Lobstein

Theor. Comput. Sci., 2019

Some results about a conjecture on identifying codes in complete suns.

Olivier Hudry, Antoine Lobstein

Int. Trans. Oper. Res., 2019

2017

More results on the complexity of domination problems in graphs.

Olivier Hudry, Antoine Lobstein

Int. J. Inf. Coding Theory, 2017

2016

More results on the complexity of identifying problems in graphs.

Olivier Hudry, Antoine Lobstein

Theor. Comput. Sci., 2016

On the ensemble of optimal identifying codes in a twin-free graph.

Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Cryptogr. Commun., 2016

2015

On the ensemble of optimal dominating and locating-dominating codes in a graph.

Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Inf. Process. Lett., 2015

On the number of optimal identifying codes in a twin-free graph.

Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Discret. Appl. Math., 2015

2014

Maximum size of a minimum watching system and the graphs achieving the bound.

David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein

Discret. Appl. Math., 2014

Minimum sizes of identifying codes in graphs differing by one edge.

Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Cryptogr. Commun., 2014

2013

Watching systems in graphs: An extension of identifying codes.

David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein

Discret. Appl. Math., 2013

Minimum sizes of identifying codes in graphs differing by one vertex.

Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Cryptogr. Commun., 2013

2012

Extremal Values for the Maximum Degree in a Twin-Free Graph.

Irène Charon, Olivier Hudry, Antoine Lobstein

Ars Comb., 2012

2011

On the sizes of graphs and their powers: The undirected case.

David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein

Discret. Appl. Math., 2011

Adaptive Identification in Torii in the King Lattice.

Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel

Electron. J. Comb., 2011

Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs.

Irène Charon, Olivier Hudry, Antoine Lobstein

Ars Comb., 2011

2010

Complexity results for identifying codes in planar graphs.

David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein

Int. Trans. Oper. Res., 2010

New identifying codes in the binary Hamming space.

Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein

Eur. J. Comb., 2010

On the existence of a cycle of length at least 7 in a <i>(1, \le 2)</i>-twin-free graph.

David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein

Discuss. Math. Graph Theory, 2010

On the sizes of the graphs G, G^r, G^r \ G: the directed case.

David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein

Australas. J Comb., 2010

2009

Erratum.

David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Adv. Math. Commun., 2009

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.

David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Adv. Math. Commun., 2009

2008

Adaptive identification in graphs.

Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel

J. Comb. Theory A, 2008

Discriminating codes in (bipartite) planar graphs.

Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein

Eur. J. Comb., 2008

Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity.

Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein

Adv. Math. Commun., 2008

2007

Extremal cardinalities for identifying and locating-dominating codes in graphs.

Irène Charon, Olivier Hudry, Antoine Lobstein

Discret. Math., 2007

Structural Properties of Twin-Free Graphs.

Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Electron. J. Comb., 2007

Links Between Discriminating and Identifying Codes in the Binary Hamming Space.

Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein

Proceedings of the Applied Algebra, 2007

2006

A linear algorithm for minimum 1-identifying codes in oriented trees.

Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel

Discret. Appl. Math., 2006

Possible cardinalities for locating-dominating codes in graphs.

Irène Charon, Olivier Hudry, Antoine Lobstein

Australas. J Comb., 2006

2005

On the Structure of Identifiable Graphs.

Irène Charon, Olivier Hudry, Antoine Lobstein

Electron. Notes Discret. Math., 2005

Possible cardinalities for identifying codes in graphs.

Irène Charon, Olivier Hudry, Antoine Lobstein

Australas. J Comb., 2005

1-identifying codes on trees.

Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein

Australas. J Comb., 2005

Covering Codes.

Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Antoine Lobstein

North-Holland mathematical library 54, North-Holland, ISBN: 978-0-444-82511-7, 2005

2004

Identifying and locating-dominating codes on chains and cycles.

Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein

Eur. J. Comb., 2004

The minimum density of an identifying code in the king lattice.

Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Discret. Math., 2004

2003

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.

Irène Charon, Olivier Hudry, Antoine Lobstein

Theor. Comput. Sci., 2003

On Identification in ZZ² Using Translates of Given Patterns.

Iiro S. Honkala, Antoine Lobstein

J. Univers. Comput. Sci., 2003

2002

Identifying and locating-dominating codes: NP-Completeness results for directed graphs.

Irène Charon, Olivier Hudry, Antoine Lobstein

IEEE Trans. Inf. Theory, 2002

On the Density of Identifying Codes in the Square Lattice.

Iiro S. Honkala, Antoine Lobstein

J. Comb. Theory B, 2002

On Identifying Codes in Binary Hamming Spaces.

Iiro S. Honkala, Antoine Lobstein

J. Comb. Theory A, 2002

Identifying Codes with Small Radius in Some Infinite Regular Graphs.

Irène Charon, Olivier Hudry, Antoine Lobstein

Electron. J. Comb., 2002

On the complexity of the identification problem in Hamming spaces.

Iiro S. Honkala, Antoine Lobstein

Acta Informatica, 2002

2001

Intersection matrices for partitions by binary perfect codes.

Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva

IEEE Trans. Inf. Theory, 2001

On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals.

Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor

IEEE Trans. Computers, 2001

General Bounds for Identifying Codes in Some Infinite Regular Graphs.

Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein

Electron. J. Comb., 2001

2000

Bounds for Codes Identifying Vertices in the Hexagonal Grid.

Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor

SIAM J. Discret. Math., 2000

1999

New Bounds for Codes Identifying Vertices in Graphs.

Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor

Electron. J. Comb., 1999

On identifying codes.

Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor

Proceedings of the Codes and Association Schemes, 1999

1998

How to Improve an Exponentiation Black-Box.

Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor

Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

1997

On New Perfect Binary Nonlinear Codes.

Antoine Lobstein, Victor A. Zinoviev

Appl. Algebra Eng. Commun. Comput., 1997

Covering Radius 1985-1994.

Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.

Appl. Algebra Eng. Commun. Comput., 1997

1993

The Length Function: A Revised Table.

Antoine Lobstein, Vera Pless

Proceedings of the Algebraic Coding, 1993

On Plotkin-Elias Type Bounds for Binary Arithmetic Codes.

Gregory Kabatianskii, Antoine Lobstein

Proceedings of the Algebraic Coding, 1993

1992

On perfect arithmetic codes.

Antoine Lobstein

Discret. Math., 1992

1991

Arithmetic Codes - Survey, Recent and New Results.

Antoine Lobstein, Patrick Solé

Proceedings of the Applied Algebra, 1991

1990

Correction to 'On normal and subnormal q-ary codes' (Nov 89 1291-1295).

Antoine Lobstein, Gerhard J. M. van Wee

IEEE Trans. Inf. Theory, 1990

The hardness of solving subset sum with preprocessing.

Antoine Lobstein

IEEE Trans. Inf. Theory, 1990

1989

On normal and subnormal q-ary codes.

Antoine Lobstein, Gerhard J. M. van Wee

IEEE Trans. Inf. Theory, 1989

1988

Comments on 'A note on perfect arithmetic codes' by J. Astola.

Antoine Lobstein

IEEE Trans. Inf. Theory, 1988

1987

Sur La Complexité D'un Problème De Codage.

Antoine Lobstein, Gérard D. Cohen

RAIRO Theor. Informatics Appl., 1987

1986

Further results on the covering radius of codes.

Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane

IEEE Trans. Inf. Theory, 1986

On Modular Weights in Arithmetic Codes.

Antoine Lobstein

Proceedings of the Coding Theory and Applications, 2nd International Colloquium, 1986

1984

On a conjecture concerning coverings of Hamming space.

Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane

Proceedings of the Applied Algebra, 1984