Niranjan Balachandran

From MaRDI portal
Person:328045

Available identifiers

zbMath Open balachandran.niranjanWikidataQ102355495 ScholiaQ102355495MaRDI QIDQ328045

List of research outcomes





PublicationDate of PublicationType
Low-rank matrices, tournaments, and symmetric designs2024-05-17Paper
Almost full rank matrices arising from transitive tournaments2024-02-23Paper
On hierarchically closed fractional intersecting families2024-02-16Paper
5-list coloring toroidal 6-regular triangulations in linear time2023-08-17Paper
Cyclability, connectivity and circumference2023-08-17Paper
The weighted Davenport constant of a group and a related extremal problem. II2023-07-18Paper
An ensemble of high rank matrices arising from tournaments2022-12-08Paper
The choice number versus the chromatic number for graphs embeddable on orientable surfaces2022-04-04Paper
Complexity of constrained sensor placement problems for optimal observability2021-11-19Paper
The normalized matching property in random and pseudorandom bipartite graphs2021-06-21Paper
Zero sums in restricted sequences2021-06-14Paper
Minimal Perturbations for Zero Controllability of Discrete-Time Linear Systems: Complexity Analysis2021-05-28Paper
The Harborth Constant of Dihedral Groups2020-10-31Paper
System of unbiased representatives for a collection of bicolorings2020-09-17Paper
Bisecting and \(D\)-secting families for set systems2020-05-18Paper
Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group2020-02-21Paper
The Weighted Davenport Constant of a group and a related extremal problem2020-01-17Paper
Randomized algorithms for stabilizing switching signals2019-10-15Paper
Fractional \(L\)-intersecting families2019-07-11Paper
On Minimum Cost Sparsest Input-Connectivity for Controllability of Linear Systems2018-06-02Paper
Induced-bisecting families of bicolorings for hypergraphs2018-04-19Paper
The list distinguishing number of Kneser graphs2018-01-11Paper
χ_D(G), |Aut(G)|, and a variant of the motion lemma2017-09-14Paper
Distinguishing chromatic number of random Cayley graphs2017-08-01Paper
Persistence based convergence rate analysis of consensus protocols for dynamic graph networks2016-10-20Paper
A transform of complementary aspects with applications to entropic uncertainty relations2015-05-27Paper
On an extremal hypergraph problem related to combinatorial batch codes2014-09-12Paper
https://portal.mardi4nfdi.de/entity/Q53270722013-08-01Paper
Forbidden configurations and Steiner designs2012-11-28Paper
Graphs with restricted valency and matching number2009-12-09Paper
Simple 3-designs and PSL\((2,q )\) with \(q \equiv 1\pmod4\)2007-09-20Paper
Low-rank matrices, tournaments, and symmetric designsN/APaper
Bounded fractional intersecting families are linear in sizeN/APaper

Research outcomes over time

This page was built for person: Niranjan Balachandran