The following pages link to Tero Laihonen (Q211463):
Displayed 50 items.
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- Optimal lower bound for 2-identifying codes in the hexagonal grid (Q456287) (← links)
- Information retrieval and the average number of input clues (Q514538) (← links)
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- On identifying codes in the King grid that are robust against edge deletions (Q1010708) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- (Q1360989) (redirect page) (← links)
- On covering radius and discrete Chebyshev polynomials (Q1360991) (← links)
- On upper bounds for minimum distance and covering radius of non-binary codes (Q1379663) (← links)
- Codes for identification in the king lattice (Q1423495) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- Families of optimal codes for strong identification (Q1613402) (← links)
- On strongly identifying codes (Q1613540) (← links)
- On regular and new types of codes for location-domination (Q1671339) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- On the identification of sets of points in the square lattice (Q1864133) (← links)
- Optimal identifying codes in cycles and paths (Q1926037) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- Improved lower bound for locating-dominating codes in binary Hamming spaces (Q2068380) (← links)
- On the metric dimensions for sets of vertices (Q2107759) (← links)
- On vertices contained in all or in no metric basis (Q2161262) (← links)
- On \(t\)-revealing codes in binary Hamming spaces (Q2272993) (← links)
- Locating-dominating codes in paths (Q2275442) (← links)
- Tolerant location detection in sensor networks (Q2280052) (← links)
- The solid-metric dimension (Q2285129) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- Information retrieval with unambiguous output (Q2346418) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- On cages admitting identifying codes (Q2426452) (← links)
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid (Q2437959) (← links)
- The metric dimension for resolving several objects (Q2630338) (← links)
- (Q2717207) (← links)
- (Q2741420) (← links)
- On the probability of undetected error for binary codes used for combined correction and detection (Q2782316) (← links)
- Information Retrieval With Varying Number of Input Clues (Q2976987) (← links)
- (Q3015586) (← links)
- (Q3090475) (← links)
- (Q3094530) (← links)
- (Q3517160) (← links)
- (Q3536272) (← links)
- Improved Upper Bounds on Binary Identifying Codes (Q3549076) (← links)