Campos, Victor A.; Gomes, Guilherme C. M.; Ibiapina, Allen; Lopes, Raul; Sau, Ignasi; Silva, Ana Coloring problems on bipartite graphs of small diameter. (English) Zbl 1464.05143 Electron. J. Comb. 28, No. 2, Research Paper P2.14, 26 p. (2021). MSC: 05C15 05C12 68Q17 PDFBibTeX XMLCite \textit{V. A. Campos} et al., Electron. J. Comb. 28, No. 2, Research Paper P2.14, 26 p. (2021; Zbl 1464.05143) Full Text: DOI arXiv
Araújo, Júlio; Campos, Victor A.; Maia, Ana Karolinna; Sau, Ignasi; Silva, Ana On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1433.68164 Algorithmica 82, No. 6, 1616-1639 (2020). MSC: 68Q25 05C20 05C38 05C70 05C85 68Q17 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Araújo} et al., Algorithmica 82, No. 6, 1616--1639 (2020; Zbl 1433.68164) Full Text: DOI arXiv
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
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
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. Parameterized algorithms for min-max multiway cut and list digraph homomorphism. (English) Zbl 1370.68131 J. Comput. Syst. Sci. 86, 191-206 (2017). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{E. J. Kim} et al., J. Comput. Syst. Sci. 86, 191--206 (2017; Zbl 1370.68131) Full Text: DOI Link
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