default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Lobstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j58]Olivier Hudry, Ville Junnila
, Antoine Lobstein:
On Iiro Honkala's Contributions to Identifying Codes. Fundam. Informaticae 191(3-4): 165-196 (2024)- [j57]David Auger, Johanne Cohen, Antoine Lobstein:
Nonatomic Non-Cooperative Neighbourhood Balancing Games. Fundam. Informaticae 191(3-4): 239-268 (2024) - [i4]Olivier Hudry, Ville Junnila, Antoine Lobstein:
Iiro Honkala's contributions to identifying codes. CoRR abs/2402.08264 (2024) - 2023
- [i3]David Auger, Johanne Cohen, Antoine Lobstein:
Nonatomic Non-Cooperative Neighbourhood Balancing Games. CoRR abs/2303.08507 (2023) - 2022
- [j56]Olivier Hudry, Antoine Lobstein:
Some rainbow problems in graphs have complexity equivalent to satisfiability problems. Int. Trans. Oper. Res. 29(3): 1547-1572 (2022) - [i2]Olivier Hudry, Antoine Lobstein:
On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path. CoRR abs/2205.05782 (2022) - 2020
- [j55]Olivier Hudry, Antoine Lobstein:
The compared costs of domination, location-domination and identification. Discuss. Math. Graph Theory 40(1): 127-147 (2020)
2010 – 2019
- 2019
- [j54]Olivier Hudry, Antoine Lobstein:
Some results about a conjecture on identifying codes in complete suns. Int. Trans. Oper. Res. 26(2): 732-746 (2019) - [j53]Olivier Hudry, Antoine Lobstein:
Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes. Theor. Comput. Sci. 767: 83-102 (2019) - 2017
- [j52]Olivier Hudry, Antoine Lobstein:
More results on the complexity of domination problems in graphs. Int. J. Inf. Coding Theory 4(2/3): 129-144 (2017) - 2016
- [j51]Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
On the ensemble of optimal identifying codes in a twin-free graph. Cryptogr. Commun. 8(1): 139-153 (2016) - [j50]Olivier Hudry, Antoine Lobstein:
More results on the complexity of identifying problems in graphs. Theor. Comput. Sci. 626: 1-12 (2016) - 2015
- [j49]Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
On the number of optimal identifying codes in a twin-free graph. Discret. Appl. Math. 180: 111-119 (2015) - [j48]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): 699-702 (2015) - 2014
- [j47]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): 157-170 (2014) - [j46]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: 20-33 (2014) - 2013
- [j45]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): 119-136 (2013) - [j44]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Watching systems in graphs: An extension of identifying codes. Discret. Appl. Math. 161(12): 1674-1685 (2013) - 2012
- [j43]Irène Charon, Olivier Hudry, Antoine Lobstein:
Extremal Values for the Maximum Degree in a Twin-Free Graph. Ars Comb. 107: 257-274 (2012) - 2011
- [j42]Irène Charon, Olivier Hudry, Antoine Lobstein:
Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs. Ars Comb. 101: 161-185 (2011) - [j41]Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel:
Adaptive Identification in Torii in the King Lattice. Electron. J. Comb. 18(1) (2011) - [j40]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): 1666-1675 (2011) - 2010
- [j39]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the sizes of the graphs G, Gr, Gr \ G: the directed case. Australas. J Comb. 48: 87-110 (2010) - [j38]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the existence of a cycle of length at least 7 in a (1, \le 2)-twin-free graph. Discuss. Math. Graph Theory 30(4): 591-609 (2010) - [j37]Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
New identifying codes in the binary Hamming space. Eur. J. Comb. 31(2): 491-501 (2010) - [j36]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Complexity results for identifying codes in planar graphs. Int. Trans. Oper. Res. 17(6): 691-710 (2010) - [i1]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Watching Systems in graphs: an extension of Identifying Codes. CoRR abs/1005.0765 (2010)
2000 – 2009
- 2009
- [j35]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): 97-114 (2009) - [j34]David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Erratum. Adv. Math. Commun. 3(4): 429-430 (2009) - 2008
- [j33]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): 403-420 (2008) - [j32]Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Discriminating codes in (bipartite) planar graphs. Eur. J. Comb. 29(5): 1353-1364 (2008) - [j31]Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel:
Adaptive identification in graphs. J. Comb. Theory A 115(7): 1114-1126 (2008) - 2007
- [j30]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Structural Properties of Twin-Free Graphs. Electron. J. Comb. 14(1) (2007) - [j29]Irène Charon, Olivier Hudry, Antoine Lobstein:
Extremal cardinalities for identifying and locating-dominating codes in graphs. Discret. Math. 307(3-5): 356-366 (2007) - [c8]Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Links Between Discriminating and Identifying Codes in the Binary Hamming Space. AAECC 2007: 267-270 - 2006
- [j28]Irène Charon, Olivier Hudry, Antoine Lobstein:
Possible cardinalities for locating-dominating codes in graphs. Australas. J Comb. 34: 23-32 (2006) - [j27]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): 1246-1253 (2006) - 2005
- [b1]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Antoine Lobstein:
Covering Codes. North-Holland mathematical library 54, North-Holland 2005, ISBN 978-0-444-82511-7, pp. I-XXI, 1-542 - [j26]Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein:
1-identifying codes on trees. Australas. J Comb. 31: 21-36 (2005) - [j25]Irène Charon, Olivier Hudry, Antoine Lobstein:
Possible cardinalities for identifying codes in graphs. Australas. J Comb. 32: 177-196 (2005) - [j24]Irène Charon, Olivier Hudry, Antoine Lobstein:
On the Structure of Identifiable Graphs. Electron. Notes Discret. Math. 22: 491-495 (2005) - 2004
- [j23]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): 95-109 (2004) - [j22]Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein:
Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25(7): 969-987 (2004) - 2003
- [j21]Iiro S. Honkala, Antoine Lobstein:
On Identification in ZZ2 Using Translates of Given Patterns. J. Univers. Comput. Sci. 9(10): 1204-1219 (2003) - [j20]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): 2109-2120 (2003) - 2002
- [j19]Iiro S. Honkala, Antoine Lobstein:
On the complexity of the identification problem in Hamming spaces. Acta Informatica 38(11/12): 839-845 (2002) - [j18]Irène Charon, Olivier Hudry, Antoine Lobstein:
Identifying Codes with Small Radius in Some Infinite Regular Graphs. Electron. J. Comb. 9(1) (2002) - [j17]Iiro S. Honkala, Antoine Lobstein:
On the Density of Identifying Codes in the Square Lattice. J. Comb. Theory B 85(2): 297-306 (2002) - [j16]Iiro S. Honkala, Antoine Lobstein:
On Identifying Codes in Binary Hamming Spaces. J. Comb. Theory A 99(2): 232-243 (2002) - [j15]Irène Charon, Olivier Hudry, Antoine Lobstein:
Identifying and locating-dominating codes: NP-Completeness results for directed graphs. IEEE Trans. Inf. Theory 48(8): 2192-2200 (2002) - 2001
- [j14]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) - [j13]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): 174-176 (2001) - [j12]Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva:
Intersection matrices for partitions by binary perfect codes. IEEE Trans. Inf. Theory 47(4): 1621-1624 (2001) - 2000
- [j11]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): 492-504 (2000)
1990 – 1999
- 1999
- [j10]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) - [c7]Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor:
On identifying codes. Codes and Association Schemes 1999: 97-109 - 1998
- [c6]Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor:
How to Improve an Exponentiation Black-Box. EUROCRYPT 1998: 211-220 - 1997
- [j9]Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.:
Covering Radius 1985-1994. Appl. Algebra Eng. Commun. Comput. 8(3): 173-239 (1997) - [j8]Antoine Lobstein, Victor A. Zinoviev:
On New Perfect Binary Nonlinear Codes. Appl. Algebra Eng. Commun. Comput. 8(5): 415-420 (1997) - 1993
- [c5]Antoine Lobstein, Vera Pless:
The Length Function: A Revised Table. Algebraic Coding 1993: 51-55 - [c4]Gregory Kabatianskii, Antoine Lobstein:
On Plotkin-Elias Type Bounds for Binary Arithmetic Codes. Algebraic Coding 1993: 263-269 - [e2]Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor:
Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings. Lecture Notes in Computer Science 781, Springer 1993, ISBN 3-540-57843-9 [contents] - 1992
- [j7]Antoine Lobstein:
On perfect arithmetic codes. Discret. Math. 106-107: 333-336 (1992) - [e1]Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor:
Algebraic Coding, First French-Soviet Workshop, Paris, France, July 22-24, 1991, Proceedings. Lecture Notes in Computer Science 573, Springer 1992, ISBN 3-540-55130-1 [contents] - 1991
- [c3]Antoine Lobstein, Patrick Solé:
Arithmetic Codes - Survey, Recent and New Results. AAECC 1991: 246-258 - 1990
- [j6]Antoine Lobstein:
The hardness of solving subset sum with preprocessing. IEEE Trans. Inf. Theory 36(4): 943-946 (1990) - [j5]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): 1498- (1990)
1980 – 1989
- 1989
- [j4]Antoine Lobstein, Gerhard J. M. van Wee:
On normal and subnormal q-ary codes. IEEE Trans. Inf. Theory 35(6): 1291-1295 (1989) - 1988
- [j3]Antoine Lobstein:
Comments on 'A note on perfect arithmetic codes' by J. Astola. IEEE Trans. Inf. Theory 34(3): 589-590 (1988) - 1987
- [j2]Antoine Lobstein, Gérard D. Cohen:
Sur La Complexité D'un Problème De Codage. RAIRO Theor. Informatics Appl. 21(1): 25-32 (1987) - 1986
- [j1]Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane:
Further results on the covering radius of codes. IEEE Trans. Inf. Theory 32(5): 680-694 (1986) - [c2]Antoine Lobstein:
On Modular Weights in Arithmetic Codes. Coding Theory and Applications 1986: 56-67 - 1984
- [c1]Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane:
On a conjecture concerning coverings of Hamming space. AAECC 1984: 79-89
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
