Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Fair Clustering Under a Bounded Cost., , , and . NeurIPS, page 14345-14357. (2021)Improved Bound for Online Square-into-Square Packing.. WAOA, volume 8952 of Lecture Notes in Computer Science, page 47-58. Springer, (2014)Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience., , , and . AISTATS, volume 130 of Proceedings of Machine Learning Research, page 2872-2880. PMLR, (2021)Algorithms to Approximate Column-Sparse Packing Problems., , , and . SODA, page 311-330. SIAM, (2018)Approximating Two-Stage Stochastic Supplier Problems., , , , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 23:1-23:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Further Improvement in Approximating the Maximum Duo-Preservation String Mapping Problem.. WABI, volume 9838 of Lecture Notes in Computer Science, page 52-64. Springer, (2016)Markets, Elections, and Microbes: Data-driven Algorithms from Theory to Practice.. University of Maryland, College Park, MD, USA, (2020)base-search.net (ftunivmaryland:oai:drum.lib.umd.edu:1903/26557).Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts., , , and . AAMAS, page 1223-1231. ACM, (2017)It's COMPASlicated: The Messy Relationship between RAI Datasets and Algorithmic Fairness Benchmarks., , , , , , , and . NeurIPS Datasets and Benchmarks, (2021)Characterizing Properties and Trade-offs of Centralized Delegation Mechanisms in Liquid Democracy., , and . FAccT, page 1629-1638. ACM, (2022)