Brian C. Dean A simple expected running time analysis for randomized "divide and conquer" algorithms. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:1, pp:1-5 [Journal]
Ruo-Wei Hung, Maw-Shang Chang Solving the path cover problem on circular-arc graphs by using an approximation algorithm. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:1, pp:76-105 [Journal]
Weigen Yan, Fuji Zhang Enumeration of perfect matchings of a type of Cartesian products of graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:1, pp:145-157 [Journal]