Charles Carlson

12 papers A* 2B 2Journal 8
YearRankTypeTitle / Venue / Authors
2021 J jnl
Improving the Smoothed Complexity of FLIP for Max Cut Problems.
ACM Trans. Algorithms
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
2021 J jnl
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming.
SIAM J. Discret. Math.
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
2020 J jnl
Efficient algorithms for the Potts model on small-set expanders.
CoRR
Charles Carlson, Ewan Davies, Alexandra Kolla
2020 B conf
Lower Bounds for Max-Cut via Semidefinite Programming.
LATIN
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
2020 J jnl
Spectral aspects of symmetric matrix signings.
Discret. Optim.
Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
2019 A* conf
Improving the smoothed complexity of FLIP for max cut problems.
SODA
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
2019 A* conf
Optimal Lower Bounds for Sketching Graph Cuts.
SODA
Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan
2019 B conf
Spectral Aspects of Symmetric Matrix Signings.
MFCS
Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla
2018 J jnl
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs.
CoRR
Charles Carlson, Alexandra Kolla, Luca Trevisan
2018 J jnl
Improving the smoothed complexity of FLIP for max cut problems.
CoRR
Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran
2017 J jnl
Optimal Lower Bounds for Sketching Graph Cuts.
CoRR
Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan
2016 J jnl
Largest Eigenvalue and Invertibility of Symmetric Matrix Signings.
CoRR
Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla