Analysis of a Modified Address Calculation Sorting Algorithm. - Francis Suraweera; J. M. Al-Anzy (Comput. J., 1988)

Improving the efficiency of rule-based expert systems by rule activation. - Louis Sanzogn; Francis Suraweera; Geoffrey I. Webb (J. Exp. Theor. Artif. Intell., 1990)

An algorithm to compute the supremum of max-min powers and a property of fuzzy graphs. - Prabir Bhattacharya; Francis Suraweera (Pattern Recognit. Lett., 1991)

A Parallel Algorithm for the Minimum Spanning Tree on an SIMD Machine. - Francis Suraweera; Prabir Bhattacharya (ACM Conference on Computer Science, 1992)

A parallel cost-optimal algorithm to compute the supremum of max-min powers. - Francis Suraweera; Prabir Bhattacharya (Parallel Comput., 1992)

Far Field Path Planning for Rotorcraft NOE Missions in a Mountainous Region. - Huade Li; Francis Suraweera (ICCI, 1993)

An O(log m) Parallel Algorithm for the Minimum Spanning Tree Problem. - Francis Suraweera; Prabir Bhattacharya (Inf. Process. Lett., 1993)

Encoding Graphs for Genetic Algorithms: An Investigation Using the Minimum Spanning Tree Problem. - Pushkar Piggott; Francis Suraweera (Evo Workshops, 1994)

A Parallel Algorithm to Compute the Supremum of Max-Min Powers. - Francis Suraweera; Prabir Bhattacharya (Comput. Artif. Intell., 1996)

NC Algorithms for the Single Most Vital Edge Problem with Respect to Shortest Path. - Sven Venema; Hong Shen 001; Francis Suraweera (Inf. Process. Lett., 1996)

NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths. - Sven Venema; Hong Shen 001; Francis Suraweera (Parallel Process. Lett., 2000)

Getting the most from an algorithms design course: a personal experience. - Francis Suraweera (ACM SIGCSE Bull., 2001)

Enhancing the quality of learning and understanding of first-year mathematics for computer science related majors. - Francis Suraweera (ACM SIGCSE Bull., 2002)

Tracking bees - a 3D, outdoor small object environment. - Vladimir Estivill-Castro; Darren Lattin; Francis Suraweera; Vasanthe Vithanage (ICIP (3), 2003)

Reduction rules deliver efficient FPT-algorithms for covering points with lines. - Vladimir Estivill-Castro; Apichat Heednacram; Francis Suraweera (ACM J. Exp. Algorithmics, 2009)

The Rectilinear k-Bends TSP. - Vladimir Estivill-Castro; Apichat Heednacram; Francis Suraweera (COCOON, 2010)

NP-completeness and FPT Results for Rectilinear Covering Problems. - Vladimir Estivill-Castro; Apichat Heednacram; Francis Suraweera (J. Univers. Comput. Sci., 2010)

Fpt-Algorithms for Minimum-Bends Tours. - Vladimir Estivill-Castro; Apichat Heednacram; Francis Suraweera (Int. J. Comput. Geom. Appl., 2011)