7 citations · 29 across the 31 of their papers we have counts for
4 papers · 1 filter
Global and fixed-terminal cuts in digraphs
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király +2
The computational complexity of multicut-like problems may vary significantly depending on whether the terminals are fixed or not. In this work we present a comprehensive study of…
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…
Additive Stabilizers for Unstable Graphs
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann +3
Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with…
Local Testing for Membership in Lattices
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota +1
Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study o…