| Publication | Date of Publication | Type |
|---|
On Iiro Honkala's contributions to identifying codes
Fundamenta Informaticae | 2024-10-07 | Paper |
Nonatomic non-cooperative neighbourhood balancing games
Fundamenta Informaticae | 2024-10-07 | Paper |
Some results about a conjecture on identifying codes in complete suns
International Transactions in Operational Research | 2023-11-27 | Paper |
Some rainbow problems in graphs have complexity equivalent to satisfiability problems
International Transactions in Operational Research | 2023-11-27 | Paper |
Locating-domination and identification
Topics in Domination in Graphs | 2021-12-15 | Paper |
On the complexity of determining whether there is a unique Hamiltonian cycle or path
| 2020-11-12 | Paper |
Complexity of unique (optimal) solutions in graphs: vertex cover and domination
| 2020-11-12 | Paper |
The compared costs of domination location-domination and identification
Discussiones Mathematicae Graph Theory | 2020-01-08 | Paper |
Unique (optimal) solutions: complexity results for identifying and locating-dominating codes
Theoretical Computer Science | 2019-03-26 | Paper |
More results on the complexity of domination problems in graphs
International Journal of Information and Coding Theory | 2018-08-24 | Paper |
On the ensemble of optimal identifying codes in a twin-free graph
Cryptography and Communications | 2016-04-11 | Paper |
More results on the complexity of identifying problems in graphs
Theoretical Computer Science | 2016-03-31 | Paper |
Maximum size of a minimum watching system and the graphs achieving the bound
Discrete Applied Mathematics | 2015-09-22 | Paper |
On the ensemble of optimal dominating and locating-dominating codes in a graph
Information Processing Letters | 2015-06-02 | Paper |
On the number of optimal identifying codes in a twin-free graph
Discrete Applied Mathematics | 2014-11-28 | Paper |
Minimum sizes of identifying codes in graphs differing by one edge
Cryptography and Communications | 2014-06-20 | Paper |
Watching systems in graphs: an extension of identifying codes
Discrete Applied Mathematics | 2014-04-16 | Paper |
Extremal values for the maximum degree in a twin-free graph.
Ars Combinatoria | 2013-12-06 | Paper |
Minimum sizes of identifying codes in graphs differing by one vertex
Cryptography and Communications | 2013-08-02 | Paper |
Extremal values for identification, domination and maximum cliques in twin-free graphs.
Ars Combinatoria | 2012-10-08 | Paper |
On the sizes of graphs and their powers: the undirected case
Discrete Applied Mathematics | 2011-10-27 | Paper |
Adaptive identification in Torii in the King lattice
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case
| 2011-05-31 | Paper |
Complexity results for identifying codes in planar graphs
International Transactions in Operational Research | 2011-05-20 | Paper |
On the existence of a cycle of length at least 7 in a \((1,\leq 2)\)-twin-free graph
Discussiones Mathematicae Graph Theory | 2011-05-09 | Paper |
New identifying codes in the binary Hamming space
European Journal of Combinatorics | 2010-04-27 | Paper |
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs
Advances in Mathematics of Communications | 2010-03-10 | Paper |
Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.
Advances in Mathematics of Communications | 2010-03-08 | Paper |
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
Advances in Mathematics of Communications | 2009-02-19 | Paper |
Adaptive identification in graphs
Journal of Combinatorial Theory. Series A | 2008-12-08 | Paper |
Discriminating codes in (bipartite) planar graphs
European Journal of Combinatorics | 2008-05-29 | Paper |
Links Between Discriminating and Identifying Codes in the Binary Hamming Space
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 2008-04-17 | Paper |
On identification in \(\mathbb Z^2\) using translates of given patterns
| 2007-11-30 | Paper |
On the Structure of Identifiable Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Structural properties of twin-free graphs
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Extremal cardinalities for identifying and locating-dominating codes in graphs
Discrete Mathematics | 2007-02-13 | Paper |
On codes identifying vertices in the two-dimensional square lattice with diagonals
IEEE Transactions on Computers | 2007-01-09 | Paper |
Possible cardinalities for locating-dominating codes in graphs
| 2006-09-13 | Paper |
A linear algorithm for minimum 1-identifying codes in oriented trees
Discrete Applied Mathematics | 2006-06-30 | Paper |
scientific article; zbMATH DE number 2186985 (Why is no real title available?)
| 2005-07-13 | Paper |
Identifying and locating-dominating codes: NP-completeness results for directed graphs
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
scientific article; zbMATH DE number 2154100 (Why is no real title available?)
| 2005-04-08 | Paper |
scientific article; zbMATH DE number 2147927 (Why is no real title available?)
| 2005-03-21 | Paper |
Identifying and locating-dominating codes on chains and cycles
European Journal of Combinatorics | 2004-10-13 | Paper |
The minimum density of an identifying code in the king lattice.
Discrete Mathematics | 2004-02-14 | Paper |
On the complexity of the identification problem in Hamming spaces
Acta Informatica | 2003-09-01 | Paper |
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
Theoretical Computer Science | 2003-08-17 | Paper |
On generalized concatenated constructions of perfect binary nonlinear codes
Problems of Information Transmission | 2003-02-02 | Paper |
On the density of identifying codes in the square lattice
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
On identifying codes in binary Hamming spaces
Journal of Combinatorial Theory. Series A | 2002-09-12 | Paper |
Intersection matrices for partitions by binary perfect codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Identifying codes with small radius in some infinite regular graphs
The Electronic Journal of Combinatorics | 2002-04-25 | Paper |
General bounds for identifying codes in some infinite regular graphs
The Electronic Journal of Combinatorics | 2002-02-07 | Paper |
On identifying codes
| 2001-09-18 | Paper |
Bounds for codes identifying vertices in the hexagonal grid
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1498836 (Why is no real title available?)
| 2000-09-03 | Paper |
scientific article; zbMATH DE number 1456812 (Why is no real title available?)
| 2000-06-07 | Paper |
scientific article; zbMATH DE number 1456832 (Why is no real title available?)
| 2000-06-07 | Paper |
scientific article; zbMATH DE number 1303124 (Why is no real title available?)
| 1999-06-17 | Paper |
New bounds for codes identifying vertices in graphs
The Electronic Journal of Combinatorics | 1999-03-31 | Paper |
Covering radius 1985-1994
Applicable Algebra in Engineering, Communication and Computing | 1997-10-20 | Paper |
On new perfect binary nonlinear codes
Applicable Algebra in Engineering, Communication and Computing | 1997-07-23 | Paper |
scientific article; zbMATH DE number 1024657 (Why is no real title available?)
| 1997-06-22 | Paper |
scientific article; zbMATH DE number 177879 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 107798 (Why is no real title available?)
| 1993-01-23 | Paper |
On perfect arithmetic codes
Discrete Mathematics | 1993-01-16 | Paper |
The hardness of solving subset sum with preprocessing
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
The hardness of solving subset sum with preprocessing
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4156368 (Why is no real title available?)
| 1990-01-01 | Paper |
On normal and subnormal q-ary codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
On modular weights in arithmetic codes
Coding Theory and Applications | 1988-01-01 | Paper |
Comments on "A note on perfect arithmetic codes
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Sur la complexité d'un problème de codage
RAIRO - Theoretical Informatics and Applications | 1987-01-01 | Paper |
Further results on the covering radius of codes
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4065003 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3983073 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 4008282 (Why is no real title available?)
| 1984-01-01 | Paper |
Iiro Honkala's contributions to identifying codes
| N/A | Paper |
