Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. - Charles Carlson 002; Karthekeyan Chandrasekaran; Hsien-Chih Chang; Alexandra Kolla (CoRR, 2016)

A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs. - Charles Carlson 002; Alexandra Kolla; Luca Trevisan 001 (CoRR, 2018)

Optimal Lower Bounds for Sketching Graph Cuts. - Charles Carlson 002; Alexandra Kolla; Nikhil Srivastava; Luca Trevisan 001 (SODA, 2019)

Lower Bounds for Max-Cut via Semidefinite Programming. - Charles Carlson 002; Alexandra Kolla; Ray Li; Nitya Mani; Benny Sudakov; Luca Trevisan 001 (LATIN, 2020)

Efficient algorithms for the Potts model on small-set expanders. - Charles Carlson 002; Ewan Davies; Alexandra Kolla (CoRR, 2020)

Spectral aspects of symmetric matrix signings. - Charles Carlson 002; Karthekeyan Chandrasekaran; Hsien-Chih Chang; Naonori Kakimura; Alexandra Kolla (Discret. Optim., 2020)

Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. - Charles Carlson 002; Alexandra Kolla; Ray Li; Nitya Mani; Benny Sudakov; Luca Trevisan 001 (SIAM J. Discret. Math., 2021)

Improving the Smoothed Complexity of FLIP for Max Cut Problems. - Ali Bibak; Charles Carlson 002; Karthekeyan Chandrasekaran (ACM Trans. Algorithms, 2021)

Computational thresholds for the fixed-magnetization Ising model. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Will Perkins 001 (STOC, 2022)

Approximation Algorithm for Norm Multiway Cut. - Charlie Carlson; Jafar Jafarov; Konstantin Makarychev; Yury Makarychev; Liren Shan (ESA, 2023)

Improved Distributed Algorithms for Random Colorings. - Charlie Carlson; Daniel Frishberg; Eric Vigoda (OPODIS, 2023)

Approximately counting independent sets in dense bipartite graphs via subspace enumeration. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Aditya Potukuchi (CoRR, 2023)

Approximation Algorithms for Norm Multiway Cut. - Charlie Carlson; Jafar Jafarov; Konstantin Makarychev; Yury Makarychev; Liren Shan (CoRR, 2023)

A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Aditya Potukuchi (ICALP, 2024)

Algorithms for the ferromagnetic Potts model on expanders. - Charlie Carlson; Ewan Davies; Nicolas Fraiman; Alexandra Kolla; Aditya Potukuchi; Corrine Yap (Comb. Probab. Comput., 2024)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree. - Charlie Carlson; Xiaoyu Chen; Weiming Feng 001; Eric Vigoda (SODA, 2025)

Flip Dynamics for Sampling Colorings: Improving (11/6 - ε) Using A Simple Metric. - Charlie Carlson; Eric Vigoda (SODA, 2025)