Karthekeyan Chandrasekaran, Ph.D.

Affiliations: 
2012 Georgia Institute of Technology, Atlanta, GA 
Area:
Computer Science, Operations Research, Mathematics
Google:
"Karthekeyan Chandrasekaran"

Parents

Sign in to add mentor
Santosh Vempala grad student 2012 Georgia Tech
 (New approaches to integer programming.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Chandrasekaran K, Mnich M, Mozaffari S. (2020) Odd Multiway Cut in Directed Acyclic Graphs Siam Journal On Discrete Mathematics. 34: 1385-1408
Carlson C, Chandrasekaran K, Chang HC, et al. (2020) Spectral aspects of symmetric matrix signings Discrete Optimization. 37: 100582
Agarwal N, Chandrasekaran K, Kolla A, et al. (2019) On the Expansion of Group-Based Lifts Siam Journal On Discrete Mathematics. 33: 1338-1373
Chandrasekaran K, Gottschalk C, Könemann J, et al. (2019) Additive stabilizers for unstable graphs Discrete Optimization. 31: 56-78
Chandrasekaran K, Xu C, Yu X. (2019) Hypergraph k -cut in randomized polynomial time Mathematical Programming. 1-29
Bérczi K, Chandrasekaran K, Király T, et al. (2019) A tight \(\sqrt{2}\)-approximation for linear 3-cut Mathematical Programming. 1-33
Bérczi K, Chandrasekaran K, Király T, et al. (2019) Beating the 2-approximation factor for global bicut Mathematical Programming. 177: 291-320
Chandrasekaran K, Gandikota V, Grigorescu E. (2017) Deciding Orthogonality in Construction-A Lattices Siam Journal On Discrete Mathematics. 31: 1244-1262
Chandrasekaran K, Velingker A. (2017) Shift lifts preserving Ramanujan property Linear Algebra and Its Applications. 529: 199-214
Chandrasekaran K, Végh LA, Vempala SS. (2016) The Cutting Plane Method is Polynomial for Perfect Matchings Mathematics of Operations Research. 41: 23-48
See more...