2 citations · 4 across the 5 of their papers we have counts for
6 papers
Proper -caterpillars are distinguished by their Chromatic Symmetric Functions
G. Arunkumar, Narayanan Narayanan, Raghavendra Rao B. V. +1
Stanley's Tree Isomorphism Conjecture posits that the chromatic symmetric function can distinguish non-isomorphic trees. While already established for caterpillars and other subcla…
Regularity of Binomial Edge Ideals of Certain Block Graphs
A. V. Jayanthan, N. Narayanan, B. V. Raghavendra Rao
We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclas…
Limitations of sum of products of Read-Once Polynomials
C. Ramya, B. V. Raghavendra Rao
We study limitations of polynomials computed by depth two circuits built over read-once polynomials (ROPs) and depth three syntactically multi-linear formulas. We prove an exponent…
Parameterized Analogues of Probabilistic Computation
Ankit Chauhan, B. V. Raghavendra Rao
We study structural aspects of randomized parameterized computation. We introduce a new class - as a natural parameterized analogue of . Our defin…
New Algorithms and Hard Instances for Non-Commutative Computation
Christian Engels, B. V. Raghavendra Rao
Motivated by the recent developments on the complexity of non-com\-mu\-ta\-tive determinant and permanent [Chien et al.\ STOC 2011, Bläser ICALP 2013, Gentry CCC 2014] we attempt a…
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
Karl Bringmann, Christian Engels, Bodo Manthey +1
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions…