On an extremal hypergraph problem related to combinatorial batch codes N Balachandran, S Bhattacharya Discrete Applied Mathematics 162, 373-380, 2014 | 17 | 2014 |

Graphs with restricted valency and matching number N Balachandran, N Khare Discrete Mathematics 309 (12), 4176-4180, 2009 | 16 | 2009 |

A transform of complementary aspects with applications to entropic uncertainty relations P Mandayam, S Wehner, N Balachandran Journal of mathematical physics 51 (8), 082201, 2010 | 15 | 2010 |

Persistence based convergence rate analysis of consensus protocols for dynamic graph networks NR Chowdhury, S Sukumar, N Balachandran European Journal of Control 29, 33-43, 2016 | 8 | 2016 |

Simple 3-designs and PSL (2, q) with q≡ 1 (mod 4) N Balachandran, D Ray-Chaudhuri Designs, Codes and Cryptography 44 (1-3), 263-274, 2007 | 5 | 2007 |

Randomized algorithms for stabilizing switching signals N Balachandran, A Kundu, D Chatterjee Mathematical Control & Related Fields 9 (1), 159, 2018 | 4 | 2018 |

Bisecting and D-secting families for set systems N Balachandran, R Mathew, TK Mishra, SP Pal Discrete Applied Mathematics, 2017 | 4 | 2017 |

, , and a variant of the Motion Lemma N Balachandran, S Padinhatteeri arXiv preprint arXiv:1505.03396, 2015 | 4 | 2015 |

Fractional L-intersecting families N Balachandran, R Mathew, TK Mishra arXiv preprint arXiv:1803.03954, 2018 | 3 | 2018 |

Distinguishing chromatic number of random Cayley graphs N Balachandran, S Padinhatteeri Discrete Mathematics 340 (10), 2447-2455, 2017 | 2 | 2017 |

Bisecting families for set systems N Balachandran, R Mathew, TK Mishra, SP Pal arXiv preprint arXiv:1604.01482, 2016 | 2 | 2016 |

Deterministic and probabilistic algorithms for stabilizing discrete-time switched linear systems A Kundu, N Balachandran, D Chatterjee arXiv preprint arXiv:1405.1857, 2014 | 2 | 2014 |

Algorithmic synthesis of stabilizing switching signals for discrete-time switched linear systems A Kundu, N Balachandran, D Chatterjee arXiv preprint arXiv:1405.1857, 2014 | 2 | 2014 |

System of unbiased representatives for a collection of bicolorings N Balachandran, R Mathew, TK Mishra, SP Pal Discrete Applied Mathematics, 2019 | 1 | 2019 |

On minimum cost sparsest input-connectivity for controllability of linear systems P Dey, N Balachandran, D Chatterjee 2018 57th Annual Conference of the Society of Instrument and Control …, 2018 | 1 | 2018 |

Induced-bisecting families of bicolorings for hypergraphs N Balachandran, R Mathew, TK Mishra, SP Pal Discrete Mathematics 341 (6), 1732-1739, 2018 | 1 | 2018 |

The Harborth Constant of Dihedral Groups N Balachandran, E Mazumdar, K Zhao arXiv preprint arXiv:1803.08286, 2018 | 1 | 2018 |

The list distinguishing number of Kneser graphs N Balachandran, S Padinhatteeri Discrete Applied Mathematics 236, 30-41, 2018 | 1 | 2018 |

Forbidden configurations and Steiner designs N Balachandran Designs, Codes and Cryptography 65 (3), 353-364, 2012 | 1 | 2012 |

The Normalized Matching Property in Random and Pseudorandom Graphs N Balachandran, D Kush arXiv preprint arXiv:1908.02628, 2019 | | 2019 |