  Both weighted and unweighted Borda manipulation problems have been proved
$\mathcal{NP}$-hard. However, there is no exact combinatorial algorithm known
for these problems. In this paper, we initiate the study of exact combinatorial
algorithms for both weighted and unweighted Borda manipulation problems. More
precisely, we propose $O^*((m\cdot 2^m)^{t+1})$time and
$O^*(t^{2m})$time\footnote{$O^*()$ is the $O()$ notation with suppressed
factors polynomial in the size of the input.} combinatorial algorithms for
weighted and unweighted Borda manipulation problems, respectively, where $t$ is
the number of manipulators and $m$ is the number of candidates. Thus, for $t=2$
we solve one of the open problems posted by Betzler et al. [IJCAI 2011]. As a
byproduct of our results, we show that the {{unweighted Borda manipulation}}
problem admits an algorithm of running time $O^*(2^{9m^2\log{m}})$, based on an
integer linear programming technique. Finally, we study the {{unweighted Borda
manipulation}} problem under single-peaked elections and present
polynomial-time algorithms for the problem in the case of two manipulators, in
contrast to the $\mathcal{NP}$-hardness of this case in general settings.
