The following publications are possibly variants of this publication:
- The partitioned probe problem: NP-complete versus polynomial dichotomySimone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira. DAM, 234:67-75, 2018. [doi]
- The P versus NP-complete dichotomy of some challenging problems in graph theoryCelina M. Herrera de Figueiredo. DAM, 160(18):2681-2693, 2012. [doi]
- Characterizations, probe and sandwich problems on (k, ℓ)-cographsFernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos. DAM, 281:118-133, 2020. [doi]
- k, ℓ)-Graph Sandwich ProblemsFernanda Couto, Luerbio Faria, Sulamita Klein, Fábio Protti, Loana Tito Nogueira. AAIM 2013: 187-197 [doi]
- Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problemsFernanda Couto, Luerbio Faria, Sulamita Klein. jbcs, 20(1), 2014. [doi]
- On the Probe Problem for (r, ℓ )-Well-CoverednessLuérbio Faria, Uéverton S. Souza. cocoon 2021: 375-386 [doi]