On Iiro Honkala's contributions to identifying codes

Olivier Hudry, Junnila Ville, Antoine C. Lobstein

Publication date: 7 October 2024

Published in: Fundamenta Informaticae (Search for Journal in Brave)

combinatorics complexity graph theory domination separation identifying codes twin-free graphs binary Hamming spaces infinite grids number of optimal solutions classic parameters of graphs

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
More results on the complexity of identifying problems in graphs
On the ensemble of optimal identifying codes in a twin-free graph
Identifying path covers in graphs
Optimal lower bound for 2-identifying codes in the hexagonal grid
On the number of optimal identifying codes in a twin-free graph
Identification in $\mathbb Z^2$ using Euclidean balls
On identifying codes in binary Hamming spaces
On a new class of identifying codes in graphs
Extremal cardinalities for identifying and locating-dominating codes in graphs
On graphs having a $V\setminus \{x\}$ set as an identifying code
Structural properties of twin-free graphs
Optimal $t$-edge-robust $r$-identifying codes in the king lattice
New bounds on binary identifying codes
Improved bounds on identifying codes in binary Hamming spaces
New identifying codes in the binary Hamming space
An optimal strongly identifying code in the infinite triangular grid
Induced paths in twin-free graphs
Upper bounds for binary identifying codes
On the size of identifying codes in binary hypercubes
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
On the complexity of the identification problem in Hamming spaces
The minimum density of an identifying code in the king lattice.
Optimal codes for strong identification
Families of optimal codes for strong identification
On strongly identifying codes
Unique (optimal) solutions: complexity results for identifying and locating-dominating codes
Construction of codes identifying sets of vertices
On the density of identifying codes in the square lattice
On the identification of vertices using cycles
Lower bounds for identifying codes in some infinite grids
Minimum sizes of identifying codes in graphs differing by one edge
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs
Constructions of $r$-identifying codes and $(r, \leq l)$-identifying codes
On identifying codes that are robust against edge changes
New bounds for ($r, \leq 2$)-identifying codes in the infinite king grid
Minimum sizes of identifying codes in graphs differing by one vertex
Extremal graphs for the identifying code problem
An improved lower bound for $(1,\leq 2)$-identifying codes in the king grid
New lower bound for 2-identifying code in the square grid
New bounds on the minimum density of an identifying code for the infinite hexagonal grid
Monotonicity of the minimum cardinality of an identifying code in the hypercube
Bounds for Codes Identifying Vertices in the Hexagonal Grid
Complexity results for identifying codes in planar graphs
Improved Bounds forr-Identifying Codes of the Hex Grid
Locating-Domination and Identification
On codes identifying vertices in the two-dimensional square lattice with diagonals
On robust and dynamic identifying codes
Improved Upper Bounds on Binary Identifying Codes
On a new class of codes for identifying vertices in graphs
Sequences of optimal identifying codes
On Identifying Codes in the Triangular and Square Grids
Two families of optimal identifying codes in binary Hamming spaces
On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
On codes identifying sets of vertices in Hamming spaces
Bounds on identifying codes
General bounds for identifying codes in some infinite regular graphs
Identifying codes with small radius in some infinite regular graphs

This page was built for publication: On Iiro Honkala's contributions to identifying codes