Sivaprakasam Sunder

According to our database, Sivaprakasam Sunder authored at least 5 papers between 1992 and 1998.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1998

Scheduling Interval Ordered Tasks in Parallel.

Sivaprakasam Sunder, Xin He

J. Algorithms, 1998

1997

Fully dynamic algorithms for permutation graph coloring.

Zoran Ivkovic, Sarnath Ramnath, Sivaprakasam Sunder

Int. J. Comput. Math., 1997

1996

On Two-Processor Scheduling and Maximum Matching in Permutation Graphs.

Sarnath Ramnath, Sivaprakasam Sunder

Inf. Process. Lett., 1996

An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs.

Sivaprakasam Sunder, Xin He

Algorithmica, 1996

1992

An NC Algorithm for Finding Minimum Weighted Completion Time Schedule on Series Parallel Graphs.

Sivaprakasam Sunder, Xin He

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992