Ganeshkumar Ganapathysaravanabavan
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time Lecture Notes in Computer Science | 2003-04-06 | Paper |
Research outcomes over time
This page was built for person: Ganeshkumar Ganapathysaravanabavan
