Niranjan Balachandran

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 28

Top Topics

Bipartite Graph

Top Venues

Electron. J. Comb.

Discret. Appl. Math.

Publications

Waqar Mirza, Nikhil Karamchandani, Niranjan Balachandran
Cascaded Group Testing. CoRR (2024)
Niranjan Balachandran, Brahadeesh Sankarnarayanan
5-List Coloring Toroidal 6-Regular Triangulations in Linear Time. CALDAM (2023)
Niranjan Balachandran, Srimanta Bhattacharya, Krishn Kher, Rogers Mathew, Brahadeesh Sankarnarayanan
On Hierarchically Closed Fractional Intersecting Families. Electron. J. Comb. 30 (4) (2023)
Niranjan Balachandran, Eshita Mazumdar
The Weighted Davenport constant of a group and a related extremal problem-II. Eur. J. Comb. 111 (2023)
Niranjan Balachandran, Ashwin Jha, Mridul Nandi, Soumitra Pal
Revisiting Randomness Extraction and Key Derivation Using the CBC and Cascade Modes. IACR Trans. Symmetric Cryptol. 2023 (4) (2023)
Niranjan Balachandran, Anish Hebbar
Cyclability, Connectivity and Circumference. CALDAM (2023)
Anish Hebbar, Niranjan Balachandran
Cyclability, Connectivity and Circumference. CoRR (2022)
Niranjan Balachandran, Eshita Mazumdar
Zero sums in restricted sequences. Discret. Math. 344 (7) (2021)
Niranjan Balachandran, Deepanshu Kush
The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs. Electron. J. Comb. 28 (2) (2021)
Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee
Complexity of constrained sensor placement problems for optimal observability. Autom. 131 (2021)
Brahadeesh Sankarnarayanan, Niranjan Balachandran
The Choice Number Versus the Chromatic Number for Graphs Embeddable on Orientable Surfaces. Electron. J. Comb. 28 (4) (2021)
Priyanka Dey, Niranjan Balachandran
Minimal Perturbations for Zero Controllability of Discrete-Time Linear Systems: Complexity Analysis. IEEE Trans. Autom. Control. 66 (3) (2021)
Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
System of unbiased representatives for a collection of bicolorings. Discret. Appl. Math. 286 (2020)
Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
Bisecting and D-secting families for set systems. Discret. Appl. Math. 280 (2020)
Niranjan Balachandran, Eshita Mazumdar
The Weighted Davenport Constant of a Group and a Related Extremal Problem. Electron. J. Comb. 26 (4) (2019)
Niranjan Balachandran, Sajith Padinhatteeri, Pablo Spiga
Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group. Ars Math. Contemp. 17 (1) (2019)
Niranjan Balachandran, Deepanshu Kush
The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs. CoRR (2019)
Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra
Fractional L-intersecting Families. Electron. J. Comb. 26 (2) (2019)
Niranjan Balachandran, Sajith Padinhatteeri
The list distinguishing number of Kneser graphs. Discret. Appl. Math. 236 (2018)
Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra
Fractional L-intersecting families. CoRR (2018)
Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
Induced-bisecting families of bicolorings for hypergraphs. Discret. Math. 341 (6) (2018)
Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
System of unbiased representatives for a collection of bicolorings. CoRR (2017)
Niranjan Balachandran, Sajith Padinhatteeri
Distinguishing chromatic number of random Cayley graphs. Discret. Math. 340 (10) (2017)
Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee
Resilience of Complex Networks. CoRR (2017)
Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee
Efficient constrained sensor placement for observability of linear systems via greedy algorithms. CoRR (2017)
Niranjan Balachandran, Sajith Padinhatteeri
)|, and a variant of the Motion Lemma. Ars Math. Contemp. 12 (1) (2017)
Nilanjan Roy Chowdhury, Srikant Sukumar, Niranjan Balachandran
Persistence based convergence rate analysis of consensus protocols for dynamic graph networks. Eur. J. Control 29 (2016)
Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
Bisecting families for set systems. CoRR (2016)
Niranjan Balachandran, Srimanta Bhattacharya
On an extremal hypergraph problem related to combinatorial batch codes. Discret. Appl. Math. 162 (2014)
Atreyee Kundu, Niranjan Balachandran, Debasish Chatterjee
Algorithmic synthesis of stabilizing switching signals for discrete-time switched linear systems. CoRR (2014)
Niranjan Balachandran, Srimanta Bhattacharya
Note on an Extremal Hypergraph Problem Related to Combinatorial Batch Codes CoRR (2012)
Niranjan Balachandran
Forbidden configurations and Steiner designs. Des. Codes Cryptogr. 65 (3) (2012)
Niranjan Balachandran, Niraj Khare
Graphs with restricted valency and matching number. Discret. Math. 309 (12) (2009)
Niranjan Balachandran, Dijen K. Ray-Chaudhuri
Simple 3-designs and PSL(2, q) with q == 1 (mod 4). Des. Codes Cryptogr. 44 (1-3) (2007)