Antoine Lobstein

According to our database1, Antoine Lobstein
  • authored at least 61 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
More results on the complexity of domination problems in graphs.
IJICoT, 2017

2016
More results on the complexity of identifying problems in graphs.
Theor. Comput. Sci., 2016

On the ensemble of optimal identifying codes in a twin-free graph.
Cryptography and Communications, 2016

2015
On the ensemble of optimal dominating and locating-dominating codes in a graph.
Inf. Process. Lett., 2015

On the number of optimal identifying codes in a twin-free graph.
Discrete Applied Mathematics, 2015

2014
Maximum size of a minimum watching system and the graphs achieving the bound.
Discrete Applied Mathematics, 2014

Minimum sizes of identifying codes in graphs differing by one edge.
Cryptography and Communications, 2014

2013
Watching systems in graphs: An extension of identifying codes.
Discrete Applied Mathematics, 2013

Minimum sizes of identifying codes in graphs differing by one vertex.
Cryptography and Communications, 2013

2012
Extremal Values for the Maximum Degree in a Twin-Free Graph.
Ars Comb., 2012

2011
On the sizes of graphs and their powers: The undirected case.
Discrete Applied Mathematics, 2011

Adaptive Identification in Torii in the King Lattice.
Electr. J. Comb., 2011

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

2010
Complexity results for identifying codes in planar graphs.
ITOR, 2010

New identifying codes in the binary Hamming space.
Eur. J. Comb., 2010

On the existence of a cycle of length at least 7 in a (1, \le 2)-twin-free graph.
Discussiones Mathematicae Graph Theory, 2010

Watching Systems in graphs: an extension of Identifying Codes
CoRR, 2010

On the sizes of the graphs G, Gr, Gr \ G: the directed case.
Australasian J. Combinatorics, 2010

2009
Erratum.
Adv. in Math. of Comm., 2009

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.
Adv. in Math. of Comm., 2009

2008
Adaptive identification in graphs.
J. Comb. Theory, Ser. A, 2008

Discriminating codes in (bipartite) planar graphs.
Eur. J. Comb., 2008

Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity.
Adv. in Math. of Comm., 2008

2007
Extremal cardinalities for identifying and locating-dominating codes in graphs.
Discrete Mathematics, 2007

Structural Properties of Twin-Free Graphs.
Electr. J. Comb., 2007

Links Between Discriminating and Identifying Codes in the Binary Hamming Space.
Proceedings of the Applied Algebra, 2007

2006
A linear algorithm for minimum 1-identifying codes in oriented trees.
Discrete Applied Mathematics, 2006

Possible cardinalities for locating-dominating codes in graphs.
Australasian J. Combinatorics, 2006

2005
On the Structure of Identifiable Graphs.
Electronic Notes in Discrete Mathematics, 2005

Possible cardinalities for identifying codes in graphs.
Australasian J. Combinatorics, 2005

1-identifying codes on trees.
Australasian J. Combinatorics, 2005

2004
Identifying and locating-dominating codes on chains and cycles.
Eur. J. Comb., 2004

The minimum density of an identifying code in the king lattice.
Discrete Mathematics, 2004

2003
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
Theor. Comput. Sci., 2003

On Identification in ZZ2 Using Translates of Given Patterns.
J. UCS, 2003

2002
Identifying and locating-dominating codes: NP-Completeness results for directed graphs.
IEEE Trans. Information Theory, 2002

On the Density of Identifying Codes in the Square Lattice.
J. Comb. Theory, Ser. B, 2002

On Identifying Codes in Binary Hamming Spaces.
J. Comb. Theory, Ser. A, 2002

Identifying Codes with Small Radius in Some Infinite Regular Graphs.
Electr. J. Comb., 2002

On the complexity of the identification problem in Hamming spaces.
Acta Inf., 2002

2001
Intersection matrices for partitions by binary perfect codes.
IEEE Trans. Information Theory, 2001

On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals.
IEEE Trans. Computers, 2001

General Bounds for Identifying Codes in Some Infinite Regular Graphs.
Electr. J. Comb., 2001

2000
Bounds for Codes Identifying Vertices in the Hexagonal Grid.
SIAM J. Discrete Math., 2000

1999
New Bounds for Codes Identifying Vertices in Graphs.
Electr. J. Comb., 1999

On identifying codes.
Proceedings of the Codes and Association Schemes, 1999

1998
How to Improve an Exponentiation Black-Box.
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.
Appl. Algebra Eng. Commun. Comput., 1997

Covering Radius 1985-1994.
Appl. Algebra Eng. Commun. Comput., 1997

1993
The Length Function: A Revised Table.
Proceedings of the Algebraic Coding, 1993

On Plotkin-Elias Type Bounds for Binary Arithmetic Codes.
Proceedings of the Algebraic Coding, 1993

1992
On perfect arithmetic codes.
Discrete Mathematics, 1992

1991
Arithmetic Codes - Survey, Recent and New Results.
Proceedings of the Applied Algebra, 1991

1990
Correction to 'On normal and subnormal q-ary codes' (Nov 89 1291-1295).
IEEE Trans. Information Theory, 1990

The hardness of solving subset sum with preprocessing.
IEEE Trans. Information Theory, 1990

1989
On normal and subnormal q-ary codes.
IEEE Trans. Information Theory, 1989

1988
Comments on 'A note on perfect arithmetic codes' by J. Astola.
IEEE Trans. Information Theory, 1988

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

1986
Further results on the covering radius of codes.
IEEE Trans. Information Theory, 1986

On Modular Weights in Arithmetic Codes.
Proceedings of the Coding Theory and Applications, 2nd International Colloquium, 1986

1984
On a conjecture concerning coverings of Hamming space.
Proceedings of the Applied Algebra, 1984


  Loading...