Graphs with restricted valency and matching number N Balachandran, N Khare
Discrete Mathematics 309 (12), 4176-4180, 2009
30 2009 On an extremal hypergraph problem related to combinatorial batch codes N Balachandran, S Bhattacharya
Discrete Applied Mathematics 162, 373-380, 2014
20 2014 A transform of complementary aspects with applications to entropic uncertainty relations P Mandayam, S Wehner, N Balachandran
Journal of Mathematical Physics 51 (8), 2010
17 2010 Fractional L-intersecting families N Balachandran, R Mathew, TK Mishra
arXiv preprint arXiv:1803.03954, 2018
12 2018 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
11 2016 Simple 3-designs and PSL(2, q ) with q ≡ 1 (mod 4) N Balachandran, D Ray-Chaudhuri
Designs, Codes and Cryptography 44 (1), 263-274, 2007
10 2007 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
6 2018 , , and a variant of the Motion LemmaN Balachandran, S Padinhatteeri
arXiv preprint arXiv:1505.03396, 2015
6 2015 Bisecting and D-secting families for set systems N Balachandran, R Mathew, TK Mishra, SP Pal
Discrete Applied Mathematics 280, 2-13, 2020
5 2020 An ensemble of high rank matrices arising from tournaments N Balachandran, S Bhattacharya, B Sankarnarayanan
Linear Algebra and its Applications 658, 310-318, 2023
4 2023 The choice number versus the chromatic number for graphs embeddable on orientable surfaces N Balachandran, B Sankarnarayanan
arXiv preprint arXiv:2102.06993, 2021
4 2021 Randomized algorithms for stabilizing switching signals N Balachandran, A Kundu, D Chatterjee
Math. Control Relat. Fields 9, 159-174, 2019
4 2019 The list distinguishing number of Kneser graphs N Balachandran, S Padinhatteeri
Discrete Applied Mathematics 236, 30-41, 2018
3 2018 Deterministic and probabilistic algorithms for stabilizing discrete-time switched linear systems A Kundu, N Balachandran, D Chatterjee
arXiv preprint arXiv:1405.1857, 2014
3 2014 The Weighted Davenport constant of a group and a related extremal problem-II N Balachandran, E Mazumdar
European Journal of Combinatorics 111, 103691, 2023
2 2023 On hierarchically closed fractional intersecting families N Balachandran, S Bhattacharya, KV Kher, R Mathew, ...
arXiv preprint arXiv:2211.02540, 2022
2 2022 Complexity of constrained sensor placement problems for optimal observability P Dey, N Balachandran, D Chatterjee
Automatica 131, 109758, 2021
2 2021 System of unbiased representatives for a collection of bicolorings N Balachandran, R Mathew, TK Mishra, SP Pal
Discrete Applied Mathematics 286, 116-127, 2020
2 2020 Induced-bisecting families of bicolorings for hypergraphs N Balachandran, R Mathew, TK Mishra, SP Pal
Discrete Mathematics 341 (6), 1732-1739, 2018
2 2018 Distinguishing chromatic number of random Cayley graphs N Balachandran, S Padinhatteeri
Discrete Mathematics 340 (10), 2447-2455, 2017
2 2017