Alves, Sancrey R.; Couto, Fernanda; Faria, Luerbio; Gravier, Sylvain; Klein, Sulamita; Souza, Uéverton S. Partitions and well-coveredness: the graph sandwich problem. (English) Zbl 1506.05166 Discrete Math. 346, No. 3, Article ID 113253, 10 p. (2023). MSC: 05C70 05C69 68Q17 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Discrete Math. 346, No. 3, Article ID 113253, 10 p. (2023; Zbl 1506.05166) Full Text: DOI
Faria, Luerbio; Souza, Uéverton S. On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity. (English) Zbl 07585795 Theor. Comput. Sci. 932, 56-68 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. Faria} and \textit{U. S. Souza}, Theor. Comput. Sci. 932, 56--68 (2022; Zbl 07585795) Full Text: DOI
Faria, Luerbio; Souza, Uéverton S. On the probe problem for \((r,\ell )\)-well-coveredness. (English) Zbl 07670478 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 375-386 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{L. Faria} and \textit{U. S. Souza}, Lect. Notes Comput. Sci. 13025, 375--386 (2021; Zbl 07670478) Full Text: DOI
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. (English) Zbl 1400.68078 Theor. Comput. Sci. 746, 36-48 (2018). MSC: 68Q25 05C70 68Q17 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Theor. Comput. Sci. 746, 36--48 (2018; Zbl 1400.68078) Full Text: DOI
Dantas, Simone; Faria, Luerbio; de Figueiredo, Celina M. H.; Teixeira, Rafael B. The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy. (English) Zbl 1376.05120 Discrete Appl. Math. 234, 67-75 (2018). MSC: 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Dantas} et al., Discrete Appl. Math. 234, 67--75 (2018; Zbl 1376.05120) Full Text: DOI
Baste, Julien; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi Parameterized complexity dichotomy for \((r, \ell)\)-Vertex Deletion. (English) Zbl 1378.68057 Theory Comput. Syst. 61, No. 3, 777-794 (2017). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{J. Baste} et al., Theory Comput. Syst. 61, No. 3, 777--794 (2017; Zbl 1378.68057) Full Text: DOI arXiv
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; dos Santos Souza, Uéverton On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. (English) Zbl 1483.68247 Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 423-437 (2016). MSC: 68R10 05C69 05C70 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Lect. Notes Comput. Sci. 10043, 423--437 (2016; Zbl 1483.68247) Full Text: DOI arXiv Link
Coelho, H.; Faria, L.; Gravier, S.; Klein, S. Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. (English) Zbl 1327.05103 Discrete Appl. Math. 198, 109-117 (2016). MSC: 05C15 05C35 05C07 05C10 68Q17 PDFBibTeX XMLCite \textit{H. Coelho} et al., Discrete Appl. Math. 198, 109--117 (2016; Zbl 1327.05103) Full Text: DOI
Cook, Kathryn; Dantas, Simone; Eschen, Elaine M.; Faria, Luerbio; de Figueiredo, Celina M. H.; Klein, Sulamita \(2K_{2}\) vertex-set partition into nonempty parts. (English) Zbl 1230.05233 Discrete Math. 310, No. 6-7, 1259-1264 (2010). MSC: 05C70 05A18 05C85 68Q17 PDFBibTeX XMLCite \textit{K. Cook} et al., Discrete Math. 310, No. 6--7, 1259--1264 (2010; Zbl 1230.05233) Full Text: DOI
Dantas, Simone; Eschen, Elaine M.; Faria, Luerbio; De Figueiredo, Celina M. H.; Klein, Sulamita \(2K_2\) vertex-set partition into nonempty parts. (English) Zbl 1341.05205 Liebling, Th. (ed.) et al., The IV Latin-American algorithms, graphs, and optimization symposium, Puerto Varas, Chile, November 25–29, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 30, 291-296 (2008). MSC: 05C70 05A18 05C10 68W40 68Q17 PDFBibTeX XMLCite \textit{S. Dantas} et al., Electron. Notes Discrete Math. 30, 291--296 (2008; Zbl 1341.05205) Full Text: DOI
Campos, C. N.; Dantas, S.; Faria, L.; Gravier, S. \(2K_{2}\)-partition problem. (English) Zbl 1200.05166 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 217-221 (2005). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{C. N. Campos} et al., Electron. Notes Discrete Math. 22, 217--221 (2005; Zbl 1200.05166) Full Text: DOI
Dantas, Simone; de Figueiredo, Celina M. H.; Faria, Luerbio On decision and optimization (\(k\),\(l\))-graph sandwich problems. (English) Zbl 1102.68091 Discrete Appl. Math. 143, No. 1-3, 155-165 (2004). MSC: 68R10 68Q17 05C69 PDFBibTeX XMLCite \textit{S. Dantas} et al., Discrete Appl. Math. 143, No. 1--3, 155--165 (2004; Zbl 1102.68091) Full Text: DOI