Retailers optimal pricing and economic order quantity in stock and price sensitive demand environment S Panda, S Saha, S Nandi International Journal of Operational Research 15 (4), 406-423, 2012 | 24 | 2012 |

A lower bound technique for radio k-coloring S Das, SC Ghosh, S Nandi, S Sen Discrete Mathematics 340 (5), 855-861, 2017 | 21 | 2017 |

On chromatic number of colored mixed graphs S Das, S Nandi, S Sen Conference on Algorithms and Discrete Applied Mathematics, 130-140, 2017 | 10 | 2017 |

On oriented cliques with respect to push operation J Bensmail, S Nandi, S Sen Discrete Applied Mathematics 232, 50-63, 2017 | 8 | 2017 |

On L (k, k− 1,…, 1) labeling of triangular lattice S Nandi, S Sen, SC Ghosh, S Das Electronic Notes in Discrete Mathematics 48, 281-288, 2015 | 5 | 2015 |

Efficient channel assignment for cellular networks modeled as honeycomb grid. S Nandi, N Panigrahy, M Agrawal, SC Ghosh, S Das ICTCS, 183-295, 2014 | 5 | 2014 |

Pushable chromatic number of graphs with degree constraints J Bensmail, S Das, S Nandi, S Paul, T Pierron, S Sen, E Sopena Discrete Mathematics 344 (1), 112151, 2021 | 4 | 2021 |

Chromatic number of signed graphs with bounded maximum degree S Das, S Nandi, S Paul, S Sen arXiv preprint arXiv:1603.09557, 2016 | 4 | 2016 |

On Chromatic Number of (*n*, *m*)-graphsA Lahiri, S Nandi, S Taruni, S Sen Extended Abstracts EuroComb 2021, 745-751, 2021 | 3 | 2021 |

Classification of edge-critical underlying absolute planar cliques for signed graphs J Bensmail, S Nandi, M Roy, S Sen The Australasian Journal of Combinatorics 77 (1), 117-135, 2020 | 3 | 2020 |

Two-center of the convex hull of a point set: Dynamic model, and restricted streaming model S Sadhu, S Roy, S Nandi, A Maheshwari, SC Nandy Fundamenta Informaticae 164 (1), 119-138, 2019 | 3 | 2019 |

On the signed chromatic number of some classes of graphs J Bensmail, S Das, S Nandi, T Pierron, S Sen, E Sopena Discrete Mathematics 345 (2), 112664, 2022 | 2 | 2022 |

The relative oriented clique number of triangle-free planar graphs is 10 SS Das, S Nandi, S Sen Conference on Algorithms and Discrete Applied Mathematics, 260-266, 2020 | 2 | 2020 |

Erratum to “On oriented cliques with respect to push operation”[Discrete Appl. Math. 232 (2017) 50–63] J Bensmail, S Nandi, S Sen Discrete Applied Mathematics 258, 276-278, 2019 | 2 | 2019 |

On relative clique number of colored mixed graphs S Das, S Nandi, D Roy, S Sen arXiv preprint arXiv:1810.05503, 2018 | 2 | 2018 |

Optimal L (3, 2, 1)-labeling of triangular lattice S Das, SC Ghosh, S Nandi Discrete Applied Mathematics 228, 32-40, 2017 | 2 | 2017 |

The relative signed clique number of planar graphs is 8 S Das, S Nandi, S Sen, R Seth Conference on Algorithms and Discrete Applied Mathematics, 245-253, 2019 | 1 | 2019 |

Approximation algorithms for the two-center problem of convex polygon S Sadhu, S Roy, S Nandi, A Maheswari, SC Nandy arXiv preprint arXiv:1512.02356, 2015 | 1 | 2015 |

Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon S Sadhu, S Roy, S Nandi, SC Nandy, S Roy International Journal of Foundations of Computer Science 31 (04), 421-443, 2020 | | 2020 |

On oriented cliques with respect to push operation (vol 232, pg 50, 2017) J Bensmail, S Nandi, S Sen DISCRETE APPLIED MATHEMATICS 258, 276-278, 2019 | | 2019 |