Niranjan Balachandran

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