Antoine Lobstein

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