| Erratum to: Improved initial vertex ordering for exact maximum clique search. | 0 | 0.34 | 2017 |
| Improved Infra-Chromatic Bound For Exact Maximum Clique Search | 1 | 0.35 | 2016 |
| Improved initial vertex ordering for exact maximum clique search. | 3 | 0.39 | 2016 |
| An Enhanced Infra-Chromatic Bound for the Maximum Clique Problem. | 0 | 0.34 | 2016 |
| A new exact maximum clique algorithm for large and massive sparse graphs | 15 | 0.69 | 2016 |
| A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations | 2 | 0.39 | 2016 |
| Infra-chromatic bound for exact maximum clique search | 17 | 0.68 | 2015 |
| Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem | 3 | 0.38 | 2015 |
| A novel clique formulation for the visual feature matching problem | 4 | 0.42 | 2015 |
| Relaxed approximate coloring in exact maximum clique search | 18 | 0.64 | 2014 |
| GPU-Mapping: Robotic Map Building with Graphical Multiprocessors. | 0 | 0.34 | 2013 |
| An improved bit parallel exact maximum clique algorithm | 37 | 1.25 | 2013 |
| Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm. | 8 | 0.53 | 2013 |
| An exact bit-parallel algorithm for the maximum clique problem | 62 | 2.02 | 2011 |
| An affine fuzzy model with local and global interpretations | 5 | 0.42 | 2011 |
| New decision rules for exact search in N-Queens | 2 | 0.39 | 2011 |
| Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver | 14 | 1.06 | 2010 |
| A New Implicit Branching Strategy for Exact Maximum Clique | 3 | 0.43 | 2010 |
| Using Graphs to Derive CSP Heuristics and its Application to Sudoku | 1 | 0.35 | 2009 |
| A New Exact Bit-Parallel Algorithm for SAT | 1 | 0.38 | 2008 |
| Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search | 6 | 0.52 | 2007 |
| Efficient Search Using Bitboard Models | 7 | 0.75 | 2006 |
| Bitboards: A New Approach | 3 | 0.75 | 2005 |
