We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted Identifying Code, (Open) Open Locating-Dominating Set and Metric Dimension) of an interval or a permutation graph. In these problems, one asks to distinguish all vertices of a graph by a subset of the vertices, using either the… (More)

@article{Foucaud2016IdentificationLA,
title={Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity},
author={Florent Foucaud and George B. Mertzios and Reza Naserasr and Aline Parreau and Petru Valicov},
journal={Algorithmica},
year={2016},
volume={78},
pages={914-944}
}