Niranjan Balachandran

Orcid: 0000-0002-4142-3857

According to our database1, Niranjan Balachandran authored at least 30 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cascaded Group Testing.
CoRR, 2024

2023
The Weighted Davenport constant of a group and a related extremal problem-II.
Eur. J. Comb., June, 2023

Revisiting Randomness Extraction and Key Derivation Using the CBC and Cascade Modes.
IACR Trans. Symmetric Cryptol., 2023

On Hierarchically Closed Fractional Intersecting Families.
Electron. J. Comb., 2023

5-List Coloring Toroidal 6-Regular Triangulations in Linear Time.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

Cyclability, Connectivity and Circumference.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2021
Minimal Perturbations for Zero Controllability of Discrete-Time Linear Systems: Complexity Analysis.
IEEE Trans. Autom. Control., 2021

Zero sums in restricted sequences.
Discret. Math., 2021

The Choice Number Versus the Chromatic Number for Graphs Embeddable on Orientable Surfaces.
Electron. J. Comb., 2021

The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs.
Electron. J. Comb., 2021

Complexity of constrained sensor placement problems for optimal observability.
Autom., 2021

2020
Bisecting and D-secting families for set systems.
Discret. Appl. Math., 2020

System of unbiased representatives for a collection of bicolorings.
Discret. Appl. Math., 2020

2019
The Weighted Davenport Constant of a Group and a Related Extremal Problem.
Electron. J. Comb., 2019

Fractional L-intersecting Families.
Electron. J. Comb., 2019

Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group.
Ars Math. Contemp., 2019

2018
Induced-bisecting families of bicolorings for hypergraphs.
Discret. Math., 2018

The list distinguishing number of Kneser graphs.
Discret. Appl. Math., 2018

2017
Distinguishing chromatic number of random Cayley graphs.
Discret. Math., 2017

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

Resilience of Complex Networks.
CoRR, 2017

<i>χ</i><sub><i>D</i></sub>(<i>G</i>), |Aut(<i>G</i>)|, and a variant of the Motion Lemma.
Ars Math. Contemp., 2017

2016
Persistence based convergence rate analysis of consensus protocols for dynamic graph networks.
Eur. J. Control, 2016

Bisecting families for set systems.
CoRR, 2016

2014
On an extremal hypergraph problem related to combinatorial batch codes.
Discret. Appl. Math., 2014

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

2012
Forbidden configurations and Steiner designs.
Des. Codes Cryptogr., 2012

Note on an Extremal Hypergraph Problem Related to Combinatorial Batch Codes
CoRR, 2012

2009
Graphs with restricted valency and matching number.
Discret. Math., 2009

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


  Loading...