A new O (n. log n) algorithm for computing the intersection of convex polygonsSUKHAMAY KUNDU.Pattern recognition. 1987, Vol 20, Num 4, pp 419-424, issn 0031-3203Article

An O(n) algorithm for determining the subregion-tree representation of a rectangular dissectionSUKHAMAY KUNDU.SIAM journal on computing (Print). 1993, Vol 22, Num 1, pp 79-101, issn 0097-5397Article

The call-return tree and its application to program performance analysisSUKHAMAY KUNDU.IEEE transactions on software engineering. 1986, Vol 12, Num 11, pp 1096-1098, issn 0098-5589Article

A LINEAR ALGORITHM FOR THE HAMILTONIAN COMPLETION NUMBER OF A TREE.SUKHAMAY KUNDU.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 2; PP. 55-57; BIBL. 7 REF.Article