Laavanya D.

Orcid: 0000-0001-8783-5630

According to our database¹, Laavanya D. authored at least 2 papers between 2024 and 2025.

Collaborative distances:

Timeline

Book In proceedings Article PhD thesis Dataset Other

2025

Graceful Coloring is Computationally Hard.

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

Graceful coloring is computationally hard.

[DOI]

CoRR, 2024