Figueiredo, Celina Miraglia Herrera deSpirkl, Sophie2022-08-222022-08-222018-12-31https://doi.org/10.1016/j.dam.2018.05.054http://hdl.handle.net/10012/18596The final publication is available at Elsevier via https://doi.org/10.1016/j.dam.2018.05.054 © 2018 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/Let Pk denote an induced path on k vertices. For k ≥ 5, we show that the Pk-free sandwich problem, partitioned probe problem, and unpartitioned probe problem are NP-complete. For k ≤ 4, it is known that the Pk-free sandwich problem, partitioned probe problem, and unpartitioned probe problem are in P.enAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/graph sandwich problemprobe problempartitioned probe problemunpartitioned probe problemArticle