| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond | Chakraborty, Dibyayan et al. | 2022 |
| 2 | On the Cop Number of String Graphs | Das, Sandip et al. | 2022 |
| 3 | Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs | Chakraborty, Dibyayan et al. | 2020 |
| 4 | The Weighted k-Center Problem in Trees for Fixed k | Bhattacharya, Binay et al. | 2019 |
| 5 | The p-Center Problem in Tree Networks Revisited | Banik, Aritra et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |