| On the metric dimensions for sets of vertices. | 0 | 0.34 | 2023 |
| On vertices contained in all or in no metric basis | 0 | 0.34 | 2022 |
| On Levenshtein’s Channel and List Size in Information Retrieval | 2 | 0.37 | 2021 |
| Tolerant location detection in sensor networks. | 0 | 0.34 | 2020 |
| The solid-metric dimension. | 0 | 0.34 | 2020 |
| The Levenshtein’s Channel and the List Size in Information Retrieval | 0 | 0.34 | 2019 |
| On -revealing codes in binary Hamming spaces. | 0 | 0.34 | 2019 |
| On a Conjecture Regarding Identification in Hamming Graphs | 0 | 0.34 | 2019 |
| On Stronger Types of Locating-dominating Codes | 0 | 0.34 | 2019 |
| Solving Two Conjectures regarding Codes for Location in Circulant Graphs. | 0 | 0.34 | 2019 |
| Optimal bounds on codes for location in circulant graphs. | 1 | 0.37 | 2018 |
| On regular and new types of codes for location-domination. | 0 | 0.34 | 2018 |
| On {ℓ}-Metric Dimensions in Graphs. | 1 | 0.38 | 2018 |
| Information retrieval and the average number of input clues. | 0 | 0.34 | 2017 |
| The metric dimension for resolving several objects. | 0 | 0.34 | 2016 |
| Minimum Number of Input Clues in Robust Information Retrieval. | 0 | 0.34 | 2016 |
| Information Retrieval With Varying Number of Input Clues | 1 | 0.37 | 2016 |
| Information retrieval with unambiguous output | 2 | 0.41 | 2015 |
| Graphs where every k-subset of vertices is an identifying set. | 4 | 0.49 | 2014 |
| An improved lower bound for (1, ≤ 2)-identifying codes in the king grid. | 2 | 0.41 | 2014 |
| Codes for Information Retrieval With Small Uncertainty | 3 | 0.46 | 2014 |
| Optimal identification of sets of edges using 2-factors. | 1 | 0.37 | 2013 |
| Tolerant identification with Euclidean balls | 0 | 0.34 | 2013 |
| Optimal Identifying Codes in Cycles and Paths | 9 | 0.55 | 2012 |
| Optimal lower bound for 2-identifying code in the hexagonal grid | 4 | 0.51 | 2012 |
| Locally identifying colourings for graphs with given maximum degree | 6 | 0.59 | 2012 |
| New lower bounds for identifying codes in infinite grids | 0 | 0.34 | 2012 |
| An improved lower bound for (1,<=2)-identifying codes in the king grid | 3 | 0.40 | 2011 |
| Locating-Dominating Codes In Cycles | 0 | 0.34 | 2011 |
| Locating-dominating codes in paths | 2 | 0.40 | 2011 |
| Identification in Z2 using Euclidean balls | 4 | 0.55 | 2011 |
| Improved bounds on identifying codes in binary Hamming spaces | 8 | 0.55 | 2010 |
| On Vertex-Robust Identifying Codes of Level Three. | 0 | 0.34 | 2010 |
| Upper bounds for binary identifying codes | 3 | 0.46 | 2009 |
| An optimal result for codes identifying sets of words | 0 | 0.34 | 2009 |
| Note: On the size of identifying codes in binary hypercubes | 4 | 0.42 | 2009 |
| On the size of identifying codes in binary hypercubes | 8 | 0.51 | 2009 |
| New bounds on binary identifying codes | 11 | 0.76 | 2008 |
| On cages admitting identifying codes | 6 | 0.61 | 2008 |
| On graphs admitting t-ID codes. | 0 | 0.34 | 2008 |
| On identifying codes that are robust against edge changes | 6 | 0.51 | 2007 |
| On a new class of identifying codes in graphs | 12 | 0.82 | 2007 |
| Optimal t-Edge-Robust r-Identifying Codes in the King Lattice | 7 | 0.60 | 2006 |
| On locating-dominating sets in infinite grids | 12 | 0.61 | 2006 |
| On robust identification in the square and king grids | 5 | 0.43 | 2006 |
| On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes | 4 | 0.41 | 2005 |
| On Locating-Dominating Codes In Binary Hamming Spaces | 9 | 0.74 | 2004 |
| On Identifying Codes in the Triangular and Square Grids | 16 | 0.97 | 2004 |
| On identifying codes in the hexagonal mesh | 10 | 0.75 | 2004 |
| On identification in the triangular grid | 7 | 0.64 | 2004 |
