| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Isometric Path Complexity of Graphs | Chakraborty, Dibyayan et al. | 2023 |
| 2 | Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond | Chakraborty, Dibyayan et al. | 2022 |
| 3 | On Graphs Coverable by k Shortest Paths | Dumas, Maël et al. | 2022 |
| 4 | Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs | Chakraborty, Dibyayan et al. | 2020 |
| 5 | Discriminating Codes in Geometric Setups | Dey, Sanjana et al. | 2020 |
| 6 | Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems | Foucaud, Florent et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |