Sivaramakrishnan Sivasubramanian

According to our database, Sivaramakrishnan Sivasubramanian authored at least 13 papers between 2002 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Unimodality and peak location of the characteristic polynomials of two distance matrices of trees.

Rakesh Jana, Iswar Mahato, Sivaramakrishnan Sivasubramanian

Comput. Appl. Math., July, 2025

Enumerating alternating-runs with sign in Type A and Type B Coxeter groups.

Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian

Discret. Math., 2025

2023

Signed alternating descent enumeration in classical Weyl groups.

Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian

Discret. Math., 2023

The maximum four point condition matrix of a tree.

Ali Azimi, Rakesh Jana, Mukesh Kumar Nagar, Sivaramakrishnan Sivasubramanian

CoRR, 2023

2020

Gamma Positivity of the Descent Based Eulerian Polynomial in Positive Elements of Classical Weyl Groups.

Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian

Electron. J. Comb., 2020

2014

Signed Excedance Enumeration in the Hyperoctahedral group.

Sivaramakrishnan Sivasubramanian

Electron. J. Comb., 2014

2011

Signed excedance enumeration via determinants.

Sivaramakrishnan Sivasubramanian

Adv. Appl. Math., 2011

2010

A q-Analogue of Graham, Hoffman and Hosoya's Theorem.

Sivaramakrishnan Sivasubramanian

Electron. J. Comb., 2010

2009

Average distance in graphs and eigenvalues.

Sivaramakrishnan Sivasubramanian

Discret. Math., 2009

2008

On the two variable distance enumerator of the Shi hyperplane arrangement.

Sivaramakrishnan Sivasubramanian

Eur. J. Comb., 2008

2007

Complete partitions of graphs.

Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian

Comb., 2007

2005

Complete partitions of graphs.

Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2002

On the Hardness of Approximating Minimum Monopoly Problems.

S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian

Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002