11 citations · 27 across the 9 of their papers we have counts for
11 papers
Improved Approximation for Maximum Edge Colouring Problem
L Sunil Chandran, Abhiruk Lahiri, Nitin Singh
The anti-Ramsey number, is the minimum integer such that in any edge colouring of with colours there is a rainbow subgraph isomorphic to , i.e., a copy of…
Change Point Detection for Compositional Multivariate Data
Prabuchandran K. J., Nitin Singh, Pankaj Dayama +1
Change point detection algorithms have numerous applications in fields of scientific and economic importance. We consider the problem of change point detection on compositional mul…
New bounds on the anti-Ramsey numbers of star graphs
L. Sunil Chandran, Talha Hashim, Dalu Jacob +3
The anti-Ramsey number with input graph and pattern graph , is the maximum positive integer such that there exists an edge coloring of using colors, in…
A construction principle for tight and minimal triangulations of manifolds
Benjamin A. Burton, Basudeb Datta, Nitin Singh +1
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as…
Efficient algorithms to decide tightness
Bhaskar Bagchi, Benjamin A. Burton, Basudeb Datta +2
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex…
Separation index of graphs and stacked 2-spheres
Benjamin A. Burton, Basudeb Datta, Nitin Singh +1
In 1987, Kalai proved that stacked spheres of dimension are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result…