Motion planning in Cartesian product graphs B Deb, K Kapoor Discussiones Mathematicae Graph Theory 34 (2), 207-221, 2014 | 5 | 2014 |

ON mRJ REACHABILITY IN TREES SP KALPESH KAPOOR Discrete Mathematics, Algorithms and Applications 4 (4), 1250055-1250077, 2012 | 4* | 2012 |

On motion planning in graphs B Deb | 3 | 2012 |

On Complete S-Reachable Graphs KK B Deb Journal of Discrete Mathematical Sciences and Cryptography 6 (18), 689-703, 2015 | 2 | 2015 |

Constraining logarithmic model using Dark Energy density parameter and Hubble parameter B Deb, A Deshamukhya arXiv preprint arXiv:2207.10610, 2022 | | 2022 |

A characterization of biconnected graphs reachable by robots jumping over m obstacles B Deb Electronic Notes in Discrete Mathematics 63, 177-187, 2017 | | 2017 |

On Jumping Robots Reachability in Graphs B Deb National Conference on Algebra, 17, 2016 | | 2016 |

On S-Reachability in Graphs B Deb, K Kapoor | | 2013 |