Ville Junnila

IEEE Trans. Inf. Theory, February, 2024

On Iiro Honkala's Contributions to Identifying Codes.

[BibT_eX]

[DOI]

Olivier Hudry

Antoine Lobstein

Fundam. Informaticae, 2024

On the unicyclic graphs having vertices that belong to all their (strong) metric bases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model.

[BibT_eX]

[DOI]

CoRR, 2024

2023

On the metric dimensions for sets of vertices.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

New Optimal Results on Codes for Location in Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Levenshtein's Reconstruction Problem with Different Error Patterns.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Improved lower bound for locating-dominating codes in binary Hamming spaces.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

On vertices contained in all or in no metric basis.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

On the List Size in the Levenshtein's Sequence Reconstruction Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

On Levenshtein's Channel and List Size in Information Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

2020

The solid-metric dimension.

[BibT_eX]

[DOI]

Anni Hakanen

Theor. Comput. Sci., 2020

Private membership test protocol with low communication complexity.

[BibT_eX]

[DOI]

Digit. Commun. Networks, 2020

Tolerant location detection in sensor networks.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2020

2019

Solving Two Conjectures regarding Codes for Location in Circulant Graphs.

[BibT_eX]

[DOI]

Gabrielle Paris

Discret. Math. Theor. Comput. Sci., 2019

On Stronger Types of Locating-dominating Codes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

On a Conjecture Regarding Identification in Hamming Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Optimal bounds on codes for location in circulant graphs.

[BibT_eX]

[DOI]

Gabrielle Paris

Cryptogr. Commun., 2019

2018

On regular and new types of codes for location-domination.

[BibT_eX]

[DOI]

Tuomo Lehtila

Discret. Appl. Math., 2018

2016

Information Retrieval With Varying Number of Input Clues.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Minimum Number of Input Clues in Robust Information Retrieval.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

2015

Information retrieval with unambiguous output.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Optimal locating-total dominating sets in strips of height 3.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

2014

Codes for Information Retrieval With Small Uncertainty.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

2013

Tolerant identification with Euclidean balls.

[BibT_eX]

[DOI]

Aline Parreau

Networks, 2013

Optimal identification of sets of edges using 2-factors.

[BibT_eX]

[DOI]

Discret. Math., 2013

New lower bound for 2-identifying code in the square grid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Optimal Identifying Codes in Cycles and Paths.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Adaptive Identification of Sets of Vertices in Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2012

Optimal lower bound for 2-identifying code in the hexagonal grid

[BibT_eX]

[DOI]

CoRR, 2012

Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Codes for locating objects in sensor networks.

[BibT_eX]

[DOI]

Aline Parreau

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

New lower bounds for identifying codes in infinite grids.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Locating-dominating codes in paths.

[BibT_eX]

[DOI]

Geoffrey Exoo

Discret. Math., 2011

Identification in Z2 using Euclidean balls.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Locating-dominating codes in cycles.

[BibT_eX]

[DOI]

Geoffrey Exoo