On the Hardness of Approximating Minimum Monopoly Problems. - S. Mishra; Jaikumar Radhakrishnan; Sivaramakrishnan Sivasubramanian (FSTTCS, 2002)

Complete partitions of graphs. - Guy Kortsarz; Jaikumar Radhakrishnan; Sivaramakrishnan Sivasubramanian (SODA, 2005)

Complete partitions of graphs. - Magnús M. Halldórsson; Guy Kortsarz; Jaikumar Radhakrishnan; Sivaramakrishnan Sivasubramanian (Comb., 2007)

On the two variable distance enumerator of the Shi hyperplane arrangement. - Sivaramakrishnan Sivasubramanian (Eur. J. Comb., 2008)

Average distance in graphs and eigenvalues. - Sivaramakrishnan Sivasubramanian (Discret. Math., 2009)

A q-Analogue of Graham, Hoffman and Hosoya's Theorem. - Sivaramakrishnan Sivasubramanian (Electron. J. Comb., 2010)

Signed excedance enumeration via determinants. - Sivaramakrishnan Sivasubramanian (Adv. Appl. Math., 2011)

Signed Excedance Enumeration in the Hyperoctahedral group. - Sivaramakrishnan Sivasubramanian (Electron. J. Comb., 2014)

Gamma Positivity of the Descent Based Eulerian Polynomial in Positive Elements of Classical Weyl Groups. - Hiranya Kishore Dey; Sivaramakrishnan Sivasubramanian (Electron. J. Comb., 2020)

The maximum four point condition matrix of a tree. - Ali Azimi; Rakesh Jana; Mukesh Kumar Nagar; Sivaramakrishnan Sivasubramanian (CoRR, 2023)

Signed alternating descent enumeration in classical Weyl groups. - Hiranya Kishore Dey; Sivaramakrishnan Sivasubramanian (Discret. Math., 2023)

Enumerating alternating-runs with sign in Type A and Type B Coxeter groups. - Hiranya Kishore Dey; Sivaramakrishnan Sivasubramanian (Discret. Math., 2025)

Unimodality and peak location of the characteristic polynomials of two distance matrices of trees. - Rakesh Jana; Iswar Mahato; Sivaramakrishnan Sivasubramanian (Comput. Appl. Math., 2025)