Author of the publication

Real-time recommendation of diverse related articles.

, , , and . WWW, page 1-12. International World Wide Web Conferences Steering Committee / ACM, (2013)

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

Tight Bounds for Volumetric Spanners and Applications., , and . CoRR, (2023)Towards Better Approximation of Graph Crossing Number., , and . FOCS, page 73-84. IEEE, (2020)Streaming Complexity of SVMs., , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 50:1-50:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Efficiently Computing Similarities to Private Datasets., , , , and . ICLR, OpenReview.net, (2024)Individual Fairness for k-Clustering., and . ICML, volume 119 of Proceedings of Machine Learning Research, page 6586-6596. PMLR, (2020)Improved Diversity Maximization Algorithms for Matching and Pseudoforest., and . APPROX/RANDOM, volume 275 of LIPIcs, page 25:1-25:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Real-time recommendation of diverse related articles., , , and . WWW, page 1-12. International World Wide Web Conferences Steering Committee / ACM, (2013)Fractional Set Cover in the Streaming Model., , , , , and . APPROX-RANDOM, volume 81 of LIPIcs, page 12:1-12:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Approximation Algorithms for Fair Range Clustering., , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 13270-13284. PMLR, (2023)Two-Sided Kirszbraun Theorem., , , and . SoCG, volume 189 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)