Macêdo Filho, H. B.; Machado, R. C. S.; de Figueiredo, C. M. H. Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs. (English) Zbl 1359.05043 Algorithmica 77, No. 3, 786-814 (2017). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{H. B. Macêdo Filho} et al., Algorithmica 77, No. 3, 786--814 (2017; Zbl 1359.05043) Full Text: DOI
Alcón, Liliana; Faria, Luerbio; de Figueiredo, Celina M. H.; Gutierrez, Marisa Split clique graph complexity. (English) Zbl 1416.68127 Theor. Comput. Sci. 506, 29-42 (2013). MSC: 68R10 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{L. Alcón} et al., Theor. Comput. Sci. 506, 29--42 (2013; Zbl 1416.68127) Full Text: DOI
de Figueiredo, Celina M. H. The P versus NP-complete dichotomy of some challenging problems in graph theory. (English) Zbl 1253.68268 Discrete Appl. Math. 160, No. 18, 2681-2693 (2012). MSC: 68R10 68Q17 68Q25 68W40 05C85 05C62 PDFBibTeX XMLCite \textit{C. M. H. de Figueiredo}, Discrete Appl. Math. 160, No. 18, 2681--2693 (2012; Zbl 1253.68268) Full Text: DOI
Alcón, Liliana; Faria, Luerbio; de Figueiredo, Celina M. H.; Gutierrez, Marisa Split clique graph complexity. (English) Zbl 1341.05183 Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 11-22 (2011). MSC: 05C69 05C70 68Q17 PDFBibTeX XMLCite \textit{L. Alcón} et al., Lect. Notes Comput. Sci. 6986, 11--22 (2011; Zbl 1341.05183) Full Text: DOI Link
Alcón, L.; Faria, L.; de Figueiredo, C. M. H.; Gutierrez, M. On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. (English) Zbl 1231.05193 Discrete Appl. Math. 158, No. 12, 1279-1285 (2010). MSC: 05C69 05C35 68W25 PDFBibTeX XMLCite \textit{L. Alcón} et al., Discrete Appl. Math. 158, No. 12, 1279--1285 (2010; Zbl 1231.05193) Full Text: DOI Link
Alcón, Liliana; Faria, Luerbio; de Figueiredo, Celina M. H.; Gutierrez, Marisa The complexity of clique graph recognition. (English) Zbl 1168.68015 Theor. Comput. Sci. 410, No. 21-23, 2072-2083 (2009). MSC: 68Q17 05C69 68R10 PDFBibTeX XMLCite \textit{L. Alcón} et al., Theor. Comput. Sci. 410, No. 21--23, 2072--2083 (2009; Zbl 1168.68015) Full Text: DOI Link
Alcón, L.; Faria, L.; de Figueiredo, C. M. H.; Gutierrez, M. On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. (English) Zbl 1341.05161 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, 147-152 (2008). MSC: 05C60 05C69 68Q17 PDFBibTeX XMLCite \textit{L. Alcón} et al., Electron. Notes Discrete Math. 30, 147--152 (2008; Zbl 1341.05161) Full Text: DOI Link
Dias, Vânia M. F.; de Figueiredo, Celina M. H.; Szwarcfiter, Jayme L. On the generation of bicliques of a graph. (English) Zbl 1126.05074 Discrete Appl. Math. 155, No. 14, 1826-1832 (2007). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{V. M. F. Dias} et al., Discrete Appl. Math. 155, No. 14, 1826--1832 (2007; Zbl 1126.05074) Full Text: DOI
Dias, Vânia M. F.; de Figueiredo, Celina M. H.; Szwarcfiter, Jayme L. Generating bicliques of a graph in lexicographic order. (English) Zbl 1076.68048 Theor. Comput. Sci. 337, No. 1-3, 240-248 (2005). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C85 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{V. M. F. Dias} et al., Theor. Comput. Sci. 337, No. 1--3, 240--248 (2005; Zbl 1076.68048) Full Text: DOI
Dias, Vânia M. F.; de Figueiredo, Celina M. H.; Szwarcfiter, Jayme L. On the generation of bicliques of a graph. (English) Zbl 1152.05353 Liberti, Leo (ed.) et al., Workshop on graphs and combinatorial optimization. Papers from the workshop, Como, Italy, May 31, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 17, 123-127 (2004). MSC: 05C69 PDFBibTeX XMLCite \textit{V. M. F. Dias} et al., Electron. Notes Discrete Math. 17, 123--127 (2004; Zbl 1152.05353) Full Text: DOI