21 citations · 67 across the 19 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2016★ 1 cited
Invertibility and Largest Eigenvalue of Symmetric Matrix Signings
Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang +1
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of ident…
cs.DM2013
On the Expansion of Group-Based Lifts
Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla +1
A -lift of an -vertex base graph is a graph on vertices, where each vertex of is replaced by vertices and each edge …
cs.DM2009★ 1 cited
Subgraph Sparsification and Nearly Optimal Ultrasparsifiers
Alexandra Kolla, Yury Makarychev, Amin Saberi +1
We consider a variation of the spectral sparsification problem where we are required to keep a subgraph of the original graph. Formally, given a union of two weighted graphs an…