default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNiranjan Balachandran
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Waqar Mirza, Nikhil Karamchandani, Niranjan Balachandran:
Cascaded Group Testing. CoRR abs/2405.17917 (2024)- 2023
- [j22]Niranjan Balachandran, Srimanta Bhattacharya, Krishn Kher, Rogers Mathew, Brahadeesh Sankarnarayanan:
On Hierarchically Closed Fractional Intersecting Families. Electron. J. Comb. 30(4) (2023) - [j21]Niranjan Balachandran, Eshita Mazumdar:
The Weighted Davenport constant of a group and a related extremal problem-II. Eur. J. Comb. 111: 103691 (2023) - [j20]Niranjan Balachandran, Ashwin Jha, Mridul Nandi, Soumit Pal:
Revisiting Randomness Extraction and Key Derivation Using the CBC and Cascade Modes. IACR Trans. Symmetric Cryptol. 2023(4): 391-419 (2023) - [c2]Niranjan Balachandran
, Brahadeesh Sankarnarayanan:
5-List Coloring Toroidal 6-Regular Triangulations in Linear Time. CALDAM 2023: 134-146 - [c1]Niranjan Balachandran, Anish Hebbar:
Cyclability, Connectivity and Circumference. CALDAM 2023: 257-268 - 2022
- [e1]Niranjan Balachandran, R. Inkulu:
Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings. Lecture Notes in Computer Science 13179, Springer 2022, ISBN 978-3-030-95017-0 [contents] - [i9]Niranjan Balachandran, Anish Hebbar:
Cyclability, Connectivity and Circumference. CoRR abs/2211.03095 (2022) - 2021
- [j19]Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee:
Complexity of constrained sensor placement problems for optimal observability. Autom. 131: 109758 (2021) - [j18]Niranjan Balachandran, Deepanshu Kush:
The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j17]Brahadeesh Sankarnarayanan, Niranjan Balachandran:
The Choice Number Versus the Chromatic Number for Graphs Embeddable on Orientable Surfaces. Electron. J. Comb. 28(4) (2021) - [j16]Niranjan Balachandran, Eshita Mazumdar:
Zero sums in restricted sequences. Discret. Math. 344(7): 112394 (2021) - [j15]Priyanka Dey, Niranjan Balachandran:
Minimal Perturbations for Zero Controllability of Discrete-Time Linear Systems: Complexity Analysis. IEEE Trans. Autom. Control. 66(3): 1391-1398 (2021) - 2020
- [j14]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bisecting and D-secting families for set systems. Discret. Appl. Math. 280: 2-13 (2020) - [j13]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
System of unbiased representatives for a collection of bicolorings. Discret. Appl. Math. 286: 116-127 (2020)
2010 – 2019
- 2019
- [j12]Niranjan Balachandran, Sajith Padinhatteeri, Pablo Spiga:
Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group. Ars Math. Contemp. 17(1): 311-318 (2019) - [j11]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra:
Fractional L-intersecting Families. Electron. J. Comb. 26(2): 2 (2019) - [j10]Niranjan Balachandran, Eshita Mazumdar:
The Weighted Davenport Constant of a Group and a Related Extremal Problem. Electron. J. Comb. 26(4): 4 (2019) - [i8]Niranjan Balachandran, Deepanshu Kush:
The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs. CoRR abs/1908.02628 (2019) - 2018
- [j9]Niranjan Balachandran, Sajith Padinhatteeri:
The list distinguishing number of Kneser graphs. Discret. Appl. Math. 236: 30-41 (2018) - [j8]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Induced-bisecting families of bicolorings for hypergraphs. Discret. Math. 341(6): 1732-1739 (2018) - [i7]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra:
Fractional L-intersecting families. CoRR abs/1803.03954 (2018) - 2017
- [j7]Niranjan Balachandran, Sajith Padinhatteeri:
χD(G), |Aut(G)|, and a variant of the Motion Lemma. Ars Math. Contemp. 12(1): 89-109 (2017) - [j6]Niranjan Balachandran, Sajith Padinhatteeri:
Distinguishing chromatic number of random Cayley graphs. Discret. Math. 340(10): 2447-2455 (2017) - [i6]Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee:
Resilience of Complex Networks. CoRR abs/1703.07316 (2017) - [i5]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
System of unbiased representatives for a collection of bicolorings. CoRR abs/1704.07716 (2017) - [i4]Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee:
Efficient constrained sensor placement for observability of linear systems via greedy algorithms. CoRR abs/1711.08264 (2017) - 2016
- [j5]Nilanjan Roy Chowdhury, Srikant Sukumar, Niranjan Balachandran:
Persistence based convergence rate analysis of consensus protocols for dynamic graph networks. Eur. J. Control 29: 33-43 (2016) - [i3]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bisecting families for set systems. CoRR abs/1604.01482 (2016) - 2014
- [j4]Niranjan Balachandran, Srimanta Bhattacharya:
On an extremal hypergraph problem related to combinatorial batch codes. Discret. Appl. Math. 162: 373-380 (2014) - [i2]Atreyee Kundu, Niranjan Balachandran, Debasish Chatterjee:
Algorithmic synthesis of stabilizing switching signals for discrete-time switched linear systems. CoRR abs/1405.1857 (2014) - 2012
- [j3]Niranjan Balachandran:
Forbidden configurations and Steiner designs. Des. Codes Cryptogr. 65(3): 353-364 (2012) - [i1]Niranjan Balachandran, Srimanta Bhattacharya:
Note on an Extremal Hypergraph Problem Related to Combinatorial Batch Codes. CoRR abs/1206.1996 (2012)
2000 – 2009
- 2009
- [j2]Niranjan Balachandran, Niraj Khare:
Graphs with restricted valency and matching number. Discret. Math. 309(12): 4176-4180 (2009) - 2007
- [j1]Niranjan Balachandran, Dijen K. Ray-Chaudhuri:
Simple 3-designs and PSL(2, q) with q == 1 (mod 4). Des. Codes Cryptogr. 44(1-3): 263-274 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
