Clustering Data Streams. - Sudipto Guha; Nina Mishra; Rajeev Motwani 001; Liadan O'Callaghan (FOCS, 2000)

Streaming-Data Algorithms for High-Quality Clustering. - Liadan O'Callaghan; Adam Meyerson; Rajeev Motwani 001; Nina Mishra; Sudipto Guha (ICDE, 2002)

Truth revelation in approximately efficient combinatorial auctions. - Daniel Lehmann 001; Liadan O'Callaghan; Yoav Shoham (J. ACM, 2002)

Maintaining variance and k-medians over data stream windows. - Brian Babcock; Mayur Datar; Rajeev Motwani 001; Liadan O'Callaghan (PODS, 2003)

Representing Graph Metrics with Fewest Edges. - Tomás Feder; Adam Meyerson; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy (STACS, 2003)

Better streaming algorithms for clustering problems. - Moses Charikar; Liadan O'Callaghan; Rina Panigrahy (STOC, 2003)

Clustering Data Streams: Theory and Practice. - Sudipto Guha; Adam Meyerson; Nina Mishra; Rajeev Motwani 001; Liadan O'Callaghan (IEEE Trans. Knowl. Data Eng., 2003)

Approximation algorithms for clustering streams and large data sets. - Liadan O'Callaghan (2003)

A k-Median Algorithm with Running Time Independent of Data Size. - Adam Meyerson; Liadan O'Callaghan; Serge A. Plotkin (Mach. Learn., 2004)

Computing shortest paths with uncertainty. - Tomás Feder; Rajeev Motwani 001; Liadan O'Callaghan; Chris Olston; Rina Panigrahy (J. Algorithms, 2007)

Querying priced information in databases: The conjunctive case. - Renato Carmo; Tomás Feder; Yoshiharu Kohayakawa; Eduardo Sany Laber; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy; Dilys Thomas (ACM Trans. Algorithms, 2007)

Asymptotic Polynomial-Time Approximation Schemes. - An Zhu; Rajeev Motwani 001; Liadan O'Callaghan (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Asymptotic Polynomial Time Approximation Schemes. - Rajeev Motwani 001; Liadan O'Callaghan; An Zhu (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)