MaxCliquePara is a parallel exact algorithm for finding maximum cliques on undirected graphs, which efficiently balances its work over multiple cores of a single computer, by traversing multiple search tree branches at the same time. The algorithm is evaluated on DIMACS graphs and on a set of protein product graphs, which are its target graphs. The performance (execution time) is evaluated against algorithms BBMC and MaxCliqueDyn.