Niranjan Balachandran

According to our database, Niranjan Balachandran authored at least 29 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The Weighted Davenport constant of a group and a related extremal problem-II.

Niranjan Balachandran, Eshita Mazumdar

Eur. J. Comb., June, 2023

Revisiting Randomness Extraction and Key Derivation Using the CBC and Cascade Modes.

Niranjan Balachandran, Ashwin Jha, Mridul Nandi, Soumit Pal

IACR Trans. Symmetric Cryptol., 2023

On Hierarchically Closed Fractional Intersecting Families.

Niranjan Balachandran, Srimanta Bhattacharya, Krishn Kher, Rogers Mathew, Brahadeesh Sankarnarayanan

Electron. J. Comb., 2023

5-List Coloring Toroidal 6-Regular Triangulations in Linear Time.

Niranjan Balachandran, Brahadeesh Sankarnarayanan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

Cyclability, Connectivity and Circumference.

Niranjan Balachandran, Anish Hebbar

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2021

Minimal Perturbations for Zero Controllability of Discrete-Time Linear Systems: Complexity Analysis.

Priyanka Dey, Niranjan Balachandran

IEEE Trans. Autom. Control., 2021

Zero sums in restricted sequences.

Niranjan Balachandran, Eshita Mazumdar

Discret. Math., 2021

The Choice Number Versus the Chromatic Number for Graphs Embeddable on Orientable Surfaces.

Brahadeesh Sankarnarayanan, Niranjan Balachandran

Electron. J. Comb., 2021

The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs.

Niranjan Balachandran, Deepanshu Kush

Electron. J. Comb., 2021

Complexity of constrained sensor placement problems for optimal observability.

Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee

Autom., 2021

2020

Bisecting and D-secting families for set systems.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal

Discret. Appl. Math., 2020

System of unbiased representatives for a collection of bicolorings.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal

Discret. Appl. Math., 2020

2019

The Weighted Davenport Constant of a Group and a Related Extremal Problem.

Niranjan Balachandran, Eshita Mazumdar

Electron. J. Comb., 2019

Fractional L-intersecting Families.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra

Electron. J. Comb., 2019

Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group.

Niranjan Balachandran, Sajith Padinhatteeri, Pablo Spiga

Ars Math. Contemp., 2019

2018

Induced-bisecting families of bicolorings for hypergraphs.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal

Discret. Math., 2018

The list distinguishing number of Kneser graphs.

Niranjan Balachandran, Sajith Padinhatteeri

Discret. Appl. Math., 2018

2017

Distinguishing chromatic number of random Cayley graphs.

Niranjan Balachandran, Sajith Padinhatteeri

Discret. Math., 2017

Efficient constrained sensor placement for observability of linear systems via greedy algorithms.

Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee

CoRR, 2017

Resilience of Complex Networks.

Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee

CoRR, 2017

<i>χ</i>_<i>D</i>(<i>G</i>), |Aut(<i>G</i>)|, and a variant of the Motion Lemma.

Niranjan Balachandran, Sajith Padinhatteeri

Ars Math. Contemp., 2017

2016

Persistence based convergence rate analysis of consensus protocols for dynamic graph networks.

Nilanjan Roy Chowdhury, Srikant Sukumar, Niranjan Balachandran

Eur. J. Control, 2016

Bisecting families for set systems.

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal

CoRR, 2016

2014

On an extremal hypergraph problem related to combinatorial batch codes.

Niranjan Balachandran, Srimanta Bhattacharya

Discret. Appl. Math., 2014

Algorithmic synthesis of stabilizing switching signals for discrete-time switched linear systems.

Atreyee Kundu, Niranjan Balachandran, Debasish Chatterjee

CoRR, 2014

2012

Forbidden configurations and Steiner designs.

Niranjan Balachandran

Des. Codes Cryptogr., 2012

Note on an Extremal Hypergraph Problem Related to Combinatorial Batch Codes

Niranjan Balachandran, Srimanta Bhattacharya

CoRR, 2012

2009

Graphs with restricted valency and matching number.

Niranjan Balachandran, Niraj Khare

Discret. Math., 2009

2007

Simple 3-designs and PSL(2, q) with q == 1 (mod 4).

Niranjan Balachandran, Dijen K. Ray-Chaudhuri

Des. Codes Cryptogr., 2007