| Improving the smoothed complexity of FLIP for max cut problems A Bibak, C Carlson, K Chandrasekaran ACM Transactions on Algorithms (TALG) 17 (3), 1-38, 2021 | 17 | 2021 |
| Search-and rescue robots for integrated research and education in cyber-physical systems O Lawlor, M Moss, S Kibler, C Carson, S Bond, S Bogosyan 2013 7th IEEE International Conference on e-Learning in Industrial …, 2013 | 17 | 2013 |
| Optimal lower bounds for sketching graph cuts C Carlson, A Kolla, N Srivastava, L Trevisan Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 16 | 2019 |
| Efficient algorithms for the Potts model on small-set expanders C Carlson, E Davies, A Kolla arXiv preprint arXiv:2003.01154, 2020 | 14 | 2020 |
| Lower Bounds for Max-Cut in -Free Graphs via Semidefinite Programming C Carlson, A Kolla, R Li, N Mani, B Sudakov, L Trevisan SIAM Journal on Discrete Mathematics 35 (3), 1557-1568, 2021 | 9* | 2021 |
| Lower bounds for max-cut via semidefinite programming C Carlson, A Kolla, R Li, N Mani, B Sudakov, L Trevisan Latin American Symposium on Theoretical Informatics, 479-490, 2020 | 2 | 2020 |
| Invertibility and largest eigenvalue of symmetric matrix signings C Carlson, K Chandrasekaran, HC Chang, A Kolla arXiv preprint arXiv:1611.03624, 2016 | 2 | 2016 |
| Spectral aspects of symmetric matrix signings C Carlson, K Chandrasekaran, HC Chang, N Kakimura, A Kolla Discrete Optimization 37, 100582, 2020 | 1 | 2020 |
| Lower Bounds for Max-Cut in -Free Graphs via Semidefinite Programming C Carlson, A Kolla, R Li, N Mani, B Sudakov, L Trevisan SIAM Journal on Discrete Mathematics 35 (3), 1557-1568, 2021 | | 2021 |
| Some Results on Symmetric Signings CA Carlson University of Illinois at Urbana-Champaign, 2017 | | 2017 |
| Largest Eigenvalue and Invertibility of Symmetric Matrix Signings C Carlson, K Chandrasekaran, HCCA Kolla arXiv preprint arXiv:1611.03624, 2016 | | 2016 |
