COELHO, E. M. M.; 						COELHO, H.; 						FARIA, L.; 						FERREIRA, M. P.; 						KLEIN, S..
 The absolute oriented clique number problem is NP-complete. <em>In</em>: PROCEEDINGS OF  THE THEORY OF COMPUTATION MEETING (ETC), 7.	, 2022, Niterói.
	 
	<strong>Anais</strong> [...].
 Porto Alegre: Sociedade Brasileira de Computação, 
	2022
.
 p. 13-16. 
			ISSN 2595-6116. 
		DOI: <a href="https://doi.org/10.5753/etc.2022.222592">https://doi.org/10.5753/etc.2022.222592</a>.