Ganeshkumar Ganapathysaravanabavan

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

Collaborative distances:

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

2001

Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time.

Ganeshkumar Ganapathysaravanabavan, Tandy J. Warnow

Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001