We stand with Ukraine  

Sivaprakasam Sunder

According to our database1, Sivaprakasam Sunder authored at least 5 papers between 1992 and 1997.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

1997
Fully dynamic algorithms for permutation graph coloring.
[BibTeX]
[DOI]
Zoran Ivkovic
,
Sarnath Ramnath
,
Sivaprakasam Sunder
Int. J. Comput. Math., 1997

1996
On Two-Processor Scheduling and Maximum Matching in Permutation Graphs.
[BibTeX]
[DOI]
Sarnath Ramnath
,
Sivaprakasam Sunder
Inf. Process. Lett., 1996

An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs.
[BibTeX]
[DOI]
Sivaprakasam Sunder
,
Xin He
Algorithmica, 1996

1993
Scheduling Interval Ordered Tasks in Parallel.
[BibTeX]
[DOI]
Sivaprakasam Sunder
,
Xin He
Proceedings of the STACS 93, 1993

1992
An NC Algorithm for Finding Minimum Weighted Completion Time Schedule on Series Parallel Graphs.
[BibTeX]
[DOI]
Sivaprakasam Sunder
,
Xin He
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992


  Loading...