Charlie Carlson

According to our database, Charlie Carlson authored at least 17 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Flip Dynamics for Sampling Colorings: Improving (11/6-ε) Using a Simple Metric.

Charlie Carlson, Eric Vigoda

CoRR, 2024

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree.

Charlie Carlson, Xiaoyu Chen, Weiming Feng, Eric Vigoda

CoRR, 2024

A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs.

Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Approximation Algorithms for Norm Multiway Cut.

Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan

CoRR, 2023

Approximately counting independent sets in dense bipartite graphs via subspace enumeration.

Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi

CoRR, 2023

Improved Distributed Algorithms for Random Colorings.

Charlie Carlson, Daniel Frishberg, Eric Vigoda

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Approximation Algorithm for Norm Multiway Cut.

Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Computational thresholds for the fixed-magnetization Ising model.

Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Algorithms for the ferromagnetic Potts model on expanders.

Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Improving the Smoothed Complexity of FLIP for Max Cut Problems.

Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran

ACM Trans. Algorithms, 2021

Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming.

Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan

SIAM J. Discret. Math., 2021

2020

Spectral aspects of symmetric matrix signings.

Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla

Discret. Optim., 2020

Efficient algorithms for the Potts model on small-set expanders.

Charles Carlson, Ewan Davies, Alexandra Kolla

CoRR, 2020

Lower Bounds for Max-Cut via Semidefinite Programming.

Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Optimal Lower Bounds for Sketching Graph Cuts.

Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs.

Charles Carlson, Alexandra Kolla, Luca Trevisan

CoRR, 2018

2016

Largest Eigenvalue and Invertibility of Symmetric Matrix Signings.

Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla

CoRR, 2016