Остановите войну!
for scientists:
default search action
Iiro S. Honkala
- > Home > Persons > Iiro S. Honkala
Publications
- 2016
- [j69]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) - 2015
- [j68]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) - [j67]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
- [j66]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) - 2013
- [j65]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) - 2009
- [j60]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) - [j59]David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Erratum. Adv. Math. Commun. 3(4): 429-430 (2009) - 2007
- [j54]Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Structural Properties of Twin-Free Graphs. Electron. J. Comb. 14(1) (2007) - 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 - 2004
- [j46]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) - 2003
- [j38]Iiro S. Honkala, Antoine Lobstein:
On Identification in ZZ2 Using Translates of Given Patterns. J. Univers. Comput. Sci. 9(10): 1204-1219 (2003) - 2002
- [j37]Iiro S. Honkala, Antoine Lobstein:
On the complexity of the identification problem in Hamming spaces. Acta Informatica 38(11/12): 839-845 (2002) - [j34]Iiro S. Honkala, Antoine Lobstein:
On the Density of Identifying Codes in the Square Lattice. J. Comb. Theory, Ser. B 85(2): 297-306 (2002) - [j33]Iiro S. Honkala, Antoine Lobstein:
On Identifying Codes in Binary Hamming Spaces. J. Comb. Theory, Ser. A 99(2): 232-243 (2002) - 2001
- [j30]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) - [j25]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) - 2000
- [j24]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) - 1999
- [j23]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) - [c5]Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor:
On identifying codes. Codes and Association Schemes 1999: 97-109
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-04-25 01:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint