• Metric Dimension Parameterized By Treewidth 

      Bonnet, Édouard; Purohit, Nidhi (Journal article; Peer reviewed, 2021)
      A resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The METRIC DIMENSION problem asks for a resolving set of minimum size, and in its decision form, ...