| 2024 | AAAI | Implications of Distance over Redistricting Maps: Central and Outlier Maps. | Seyed A. Esmaeili, Darshan Chakrabarti, Hayley Grape, Brian Brubach |
| 2022 | KDD | Fair Labeled Clustering. | Seyed A. Esmaeili, Sharmila Duppala, John P. Dickerson, Brian Brubach |
| 2021 | AAAI | Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. | Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas |
| 2021 | AISTATS | Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. | Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan |
| 2020 | ICML | A Pairwise Fair and Community-preserving Approach to k-Center Clustering. | Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas |
| 2018 | CPM | Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant. | Brian Brubach |
| 2018 | CPM | A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment. | Brian Brubach, Jay Ghurye |
| 2018 | SODA | Algorithms to Approximate Column-Sparse Packing Problems. | Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu |
| 2017 | WABI | Better Greedy Sequence Clustering with Fast Banded Alignment. | Brian Brubach, Jay Ghurye, Mihai Pop, Aravind Srinivasan |
| 2016 | ESA | New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. | Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu |
| 2016 | WABI | Further Improvement in Approximating the Maximum Duo-Preservation String Mapping Problem. | Brian Brubach |
| 2014 | WAOA | Improved Bound for Online Square-into-Square Packing. | Brian Brubach |