Ganeshkumar Ganapathysaravanabavan

According to our database1, Ganeshkumar Ganapathysaravanabavan authored at least 1 paper in 2001.

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

2001
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001


  Loading...