The following pages link to Ville Junnila (Q389982):
Displaying 32 items.
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- Optimal lower bound for 2-identifying codes in the hexagonal grid (Q456287) (← links)
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On regular and new types of codes for location-domination (Q1671339) (← 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)
- 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)
- New lower bound for 2-identifying code in the square grid (Q2446847) (← links)
- Optimal locating-total dominating sets in strips of height 3 (Q2516671) (← links)
- Information Retrieval With Varying Number of Input Clues (Q2976987) (← links)
- (Q3015586) (← links)
- (Q3090475) (← links)
- (Q3615964) (← links)
- Solving Two Conjectures regarding Codes for Location in Circulant Graphs (Q4611776) (← links)
- Minimum Number of Input Clues in Robust Information Retrieval (Q4976396) (← links)
- On Levenshtein’s Channel and List Size in Information Retrieval (Q5001721) (← links)
- Tolerant identification with Euclidean balls (Q5326789) (← links)
- Codes for Information Retrieval With Small Uncertainty (Q5346106) (← links)
- On Stronger Types of Locating-dominating Codes (Q5377220) (← links)
- (Q5403016) (← links)
- On the unicyclic graphs having vertices that belong to all their (strong) metric bases (Q6409811) (← links)
- Iiro Honkala's contributions to identifying codes (Q6521556) (← links)
- The Levenshtein's sequence reconstruction problem and the length of the list (Q6576022) (← links)
