The following publications are possibly variants of this publication:
- A new branch-and-bound algorithm for the Maximum Weighted Clique ProblemPablo San Segundo, Fabio Furini, Jorge Artieda. cor, 110:18-33, 2019. [doi]
- A new branch-and-bound algorithm for the maximum edge-weighted clique problemPablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic. eor, 278(1):76-90, 2019. [doi]
- A new exact maximum clique algorithm for large and massive sparse graphsPablo San Segundo, Alvaro Lopez, Panos M. Pardalos. cor, 66:81-94, 2016. [doi]
- CliSAT: A new exact algorithm for hard maximum clique problemsPablo San Segundo, Fabio Furini, David Álvarez 0001, Panos M. Pardalos. eor, 307(3):1008-1025, June 2023. [doi]