Author of the publication

Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem.

, , and . LION, volume 8994 of Lecture Notes in Computer Science, page 275-280. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Initial Sorting of Vertices in the Maximum Clique Problem Reviewed., , and . LION, volume 8426 of Lecture Notes in Computer Science, page 111-120. Springer, (2014)A new DSATUR-based algorithm for exact vertex coloring.. Comput. Oper. Res., 39 (7): 1724-1733 (2012)Using Graphs to Derive CSP Heuristics and its Application to Sudoku., and . ICTAI, page 538-545. IEEE Computer Society, (2009)Bitboards: A New Approach., and . Artificial Intelligence and Applications, page 394-399. IASTED/ACTA Press, (2005)Efficiently Enumerating all Maximal Cliques with Bit-Parallelism., , and . CoRR, (2018)CliSAT: A new exact algorithm for hard maximum clique problems., , , and . Eur. J. Oper. Res., 307 (3): 1008-1025 (June 2023)A New Implicit Branching Strategy for Exact Maximum Clique., and . ICTAI (1), page 352-357. IEEE Computer Society, (2010)A New Exact Bit-Parallel Algorithm for SAT., , , and . ICTAI (2), page 59-65. IEEE Computer Society, (2008)978-0-7695-3440-4.Efficient Search Using Bitboard Models., , , , and . ICTAI, page 132-138. IEEE Computer Society, (2006)Building maps of large environments using splines and geometric analysis., , , and . IROS, page 1600-1605. IEEE, (2008)