Sivaramakrishnan Sivasubramanian

13 papers A* 1Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Enumerating alternating-runs with sign in Type A and Type B Coxeter groups.
Discret. Math.
Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian
2025 J jnl
Unimodality and peak location of the characteristic polynomials of two distance matrices of trees.
Comput. Appl. Math.
Rakesh Jana, Iswar Mahato, Sivaramakrishnan Sivasubramanian
2023 J jnl
Signed alternating descent enumeration in classical Weyl groups.
Discret. Math.
Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian
2023 J jnl
The maximum four point condition matrix of a tree.
CoRR
Ali Azimi, Rakesh Jana, Mukesh Kumar Nagar, Sivaramakrishnan Sivasubramanian
2020 J jnl
Gamma Positivity of the Descent Based Eulerian Polynomial in Positive Elements of Classical Weyl Groups.
Electron. J. Comb.
Hiranya Kishore Dey, Sivaramakrishnan Sivasubramanian
2014 J jnl
Signed Excedance Enumeration in the Hyperoctahedral group.
Electron. J. Comb.
Sivaramakrishnan Sivasubramanian
2011 J jnl
Signed excedance enumeration via determinants.
Adv. Appl. Math.
Sivaramakrishnan Sivasubramanian
2010 J jnl
A q-Analogue of Graham, Hoffman and Hosoya's Theorem.
Electron. J. Comb.
Sivaramakrishnan Sivasubramanian
2009 J jnl
Average distance in graphs and eigenvalues.
Discret. Math.
Sivaramakrishnan Sivasubramanian
2008 J jnl
On the two variable distance enumerator of the Shi hyperplane arrangement.
Eur. J. Comb.
Sivaramakrishnan Sivasubramanian
2007 J jnl
Complete partitions of graphs.
Comb.
Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
2005 A* conf
Complete partitions of graphs.
SODA
Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
2002 — conf
On the Hardness of Approximating Minimum Monopoly Problems.
FSTTCS
S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian