Brian Brubach

CoRR, 2022

Fair Labeled Clustering.

[BibT_eX]

[DOI]

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Characterizing Properties and Trade-offs of Centralized Delegation Mechanisms in Liquid Democracy.

[BibT_eX]

[DOI]

Suresh Venkatasubramanian

Audrey Ballarin

Heeba Nazeer

Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022

2021

Fair Clustering Under a Bounded Cost.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

It's COMPASlicated: The Messy Relationship between RAI Datasets and Algorithmic Fairness Benchmarks.

[BibT_eX]

[DOI]

Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, 2021

Approximating Two-Stage Stochastic Supplier Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2021

Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Markets, Elections, and Microbes: Data-driven Algorithms from Theory to Practice.

[BibT_eX]

[DOI]

PhD thesis, 2020

Algorithms to Approximate Column-sparse Packing Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Improved Approximation Algorithms for Stochastic-Matching Problems.

[BibT_eX]

[DOI]

Marek Adamczyk

Fabrizio Grandoni

CoRR, 2020

Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints.

[BibT_eX]

[DOI]

CoRR, 2020

Online Stochastic Matching: New Algorithms and Bounds.

[BibT_eX]

[DOI]

Algorithmica, 2020

Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts.

[BibT_eX]

[DOI]

Algorithmica, 2020

Meddling Metrics: the Effects of Measuring and Constraining Partisan Gerrymandering on Voter Incentives.

[BibT_eX]

[DOI]

Shawn Zhao

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Probabilistic Fair Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

A Pairwise Fair and Community-preserving Approach to k-Center Clustering.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Vertex-weighted Online Stochastic Matching with Patience Constraints.

[BibT_eX]

[DOI]

Nathaniel Grammel

CoRR, 2019

2018

A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment.

[BibT_eX]

[DOI]

Jay Ghurye

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

Better Greedy Sequence Clustering with Fast Banded Alignment.

[BibT_eX]

[DOI]

Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Further Improvement in Approximating the Maximum Duo-Preservation String Mapping Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2014

Improved Online Square-into-Square Packing.

[BibT_eX]

[DOI]

CoRR, 2014

Improved Bound for Online Square-into-Square Packing.

[BibT_eX]

[DOI]