The following pages link to Niranjan Balachandran (Q328045):
Displaying 8 items.
- Persistence based convergence rate analysis of consensus protocols for dynamic graph networks (Q328046) (← links)
- Forbidden configurations and Steiner designs (Q690672) (← links)
- On an extremal hypergraph problem related to combinatorial batch codes (Q741768) (← links)
- Graphs with restricted valency and matching number (Q1043593) (← links)
- The list distinguishing number of Kneser graphs (Q1693128) (← links)
- Induced-bisecting families of bicolorings for hypergraphs (Q1744760) (← links)
- Low-rank matrices, tournaments, and symmetric designs (Q6518853) (← links)
- Bounded fractional intersecting families are linear in size (Q6523060) (← links)
