Author of the publication

Min-Cost Bipartite Perfect Matching with Delays.

, , , , , , , , and . APPROX-RANDOM, volume 81 of LIPIcs, page 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Assortment Planning for Two-Sided Sequential Matching Markets., , , , and . WINE, volume 12495 of Lecture Notes in Computer Science, page 475. Springer, (2020)Gossip with transmission constraints., , and . ITA, page 1-4. IEEE, (2013)LORE: a large-scale offer recommendation engine with eligibility and capacity constraints., , , and . RecSys, page 160-168. ACM, (2019)How to gossip if you must., , and . CoRR, (2013)Parametric Models for Intransitivity in Pairwise Rankings., and . WWW, page 3056-3062. ACM, (2019)Technical Note - Assortment Planning for Two-Sided Sequential Matching Markets., , , , and . Oper. Res., 70 (5): 2784-2803 (2022)Assortment planning for two-sided sequential matching markets., , , , and . CoRR, (2019)QUEST: Queue Simulation for Content Moderation at Scale., , , , , and . CoRR, (2021)Asynchronous Gossip for Averaging and Spectral Ranking., , and . IEEE J. Sel. Top. Signal Process., 8 (4): 703-716 (2014)Min-Cost Bipartite Perfect Matching with Delays., , , , , , , , and . APPROX-RANDOM, volume 81 of LIPIcs, page 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)