The authors' technique for obtaining double-exponential lower bounds can potentially be extended to other natural NP-complete problems beyond Metric Dimension, Strong Metric Dimension, and Geodetic Set. The key lies in the versatility and simplicity of the technique based on Sperner families of sets. By encoding specific relationships between clause and literal vertices into small separators, it becomes feasible to apply this technique to a wide range of NP-complete graph problems.
The success of the technique in proving double-exponential lower bounds for the three considered problems showcases its potential for application to other NP-complete problems. As long as the problem involves intricate relationships between different parts of the input structure and can be encoded effectively using the proposed method, it is plausible to extend the technique to derive double-exponential lower bounds for various other NP-complete problems in graph theory and beyond.