Author of the publication

Banishing Bias from Consensus Sequences.

, , , and . CPM, volume 1264 of Lecture Notes in Computer Science, page 247-261. Springer, (1997)

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

Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders, , and . CoRR, (2009)Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem., , , and . SODA, page 619-628. ACM/SIAM, (1997)A new system-wide diversity measure for recommendations with efficient algorithms., , and . CoRR, (2018)We know who you followed last summer: inferring social link creation times in twitter., , , , , and . WWW, page 517-526. ACM, (2011)On Two-Stage Stochastic Minimum Spanning Trees., , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 321-334. Springer, (2005)Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs., and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 169-180. Springer, (2006)Inventory Routing Problem with Facility Location., and . WADS, volume 11646 of Lecture Notes in Computer Science, page 452-465. Springer, (2019)The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures., , , and . Algorithmica, 82 (9): 2474-2501 (2020)Scrutiny of unruly and abuse in wireless networks to mitigate physical layer threats using discriminate based misbehavior prevention., and . Clust. Comput., 19 (1): 87-97 (2016)An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph., , and . Inf. Process. Lett., (2021)