An NC Algorithm for Finding Minimum Weighted Completion Time Schedule on Series Parallel Graphs. - Sivaprakasam Sunder; Xin He (SPDP, 1992)

An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs. - Sivaprakasam Sunder; Xin He 005 (Algorithmica, 1996)

On Two-Processor Scheduling and Maximum Matching in Permutation Graphs. - Sarnath Ramnath; Sivaprakasam Sunder (Inf. Process. Lett., 1996)

Fully dynamic algorithms for permutation graph coloring. - Zoran Ivkovic; Sarnath Ramnath; Sivaprakasam Sunder (Int. J. Comput. Math., 1997)

Scheduling Interval Ordered Tasks in Parallel. - Sivaprakasam Sunder; Xin He 005 (J. Algorithms, 1998)