A fast 25/6-approximation for the minimum unit disk cover problem. - Paul Liu 001; Daniel Lu (CoRR, 2014)

A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. - Ahmad Biniaz; Anil Maheshwari; Michiel H. M. Smid; Paul Liu 001 (CCCG, 2015)

SYM-ILDL: Incomplete $LDL^{T}$ Factorization of Symmetric Indefinite and Skew-Symmetric Matrices. - Chen Greif; Shiwen He; Paul Liu 001 (CoRR, 2015)

Approximation algorithms for the unit disk cover problem in 2D and 3D. - Ahmad Biniaz; Paul Liu 001; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2017)

SYM-ILDL: Incomplete LDLT Factorization of Symmetric Indefinite and Skew-Symmetric Matrices. - Chen Greif; Shiwen He; Paul Liu 001 (ACM Trans. Math. Softw., 2017)

Approximation Schemes for Covering and Packing in the Streaming Model. - Christopher Liaw; Paul Liu 001; Robert Reiss (CCCG, 2018)

Greedy and Local Ratio Algorithms in the MapReduce Model. - Nicholas J. A. Harvey; Christopher Liaw; Paul Liu 001 (SPAA, 2018)

A sampling framework for counting temporal motifs. - Paul Liu 001; Austin R. Benson; Moses Charikar (CoRR, 2018)

Submodular Optimization in the MapReduce Model. - Paul Liu 001; Jan Vondrák (SOSA, 2019)

Sampling Methods for Counting Temporal Motifs. - Paul Liu 001; Austin R. Benson; Moses Charikar (WSDM, 2019)

A polynomial lower bound on adaptive complexity of submodular maximization. - Wenzheng Li; Paul Liu 001; Jan Vondrák (STOC, 2020)

Retrieving Top Weighted Triangles in Graphs. - Raunak Kumar; Paul Liu 001; Moses Charikar; Austin R. Benson (WSDM, 2020)

A simple bipartite graph projection model for clustering in networks. - Austin R. Benson; Paul Liu 001; Hao Yin (CoRR, 2020)

Improving Taxonomy-based Categorization with Categorical Graph Neural Networks. - Tianchuan Du; Keng-hao Chang; Paul Liu 001; Ruofei Zhang (IEEE BigData, 2021)

Coordinated Motion Planning Through Randomized k-Opt (CG Challenge). - Paul Liu 001; Jack Spalding-Jamieson; Brandon Zhang; Da Wei Zheng (SoCG, 2021)

Cardinality constrained submodular maximization for random streams. - Paul Liu 001; Aviad Rubinstein; Jan Vondrák; Junyao Zhao 001 (NeurIPS, 2021)

Improved Algorithms for Edge Colouring in the W-Streaming Model. - Moses Charikar; Paul Liu 001 (SOSA, 2021)

Elo-MMR: A Rating System for Massive Multiplayer Competitions. - Aram Ebtekar; Paul Liu 001 (WWW, 2021)

Diversity on the Go! Streaming Determinantal Point Processes under a Maximum Induced Cardinality Objective. - Paul Liu 001; Akshay Soni; Eun Yong Kang; Yajun Wang 001; Mehul Parsana (WWW, 2021)

An Elo-like System for Massive Multiplayer Competitions. - Aram Ebtekar; Paul Liu 001 (CoRR, 2021)

Coordinated Motion Planning Through Randomized k-Opt. - Paul Liu 001; Jack Spalding-Jamieson; Brandon Zhang; Da Wei Zheng (CoRR, 2021)

MonoTrack: Shuttle trajectory reconstruction from monocular badminton video. - Paul Liu 001; Jui-Hsien Wang (CVPR Workshops, 2022)

Streaming Submodular Maximization Under Matroid Constraints. - Moran Feldman; Paul Liu 001; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (ICALP, 2022)

On the Complexity of Sampling Redistricting Plans. - Moses Charikar; Paul Liu 001; Tianyu Liu; Thuy-Duong Vuong (CoRR, 2022)

Coordinated Motion Planning Through Randomized k-Opt. - Paul Liu 001; Jack Spalding-Jamieson; Brandon Zhang; Da Wei Zheng (ACM J. Exp. Algorithmics, 2022)

Submodular optimization in massive datasets. - Paul Liu 001 (2022)

Faster Submodular Maximization for Several Classes of Matroids. - Monika Henzinger; Paul Liu 001; Jan Vondrák; Da Wei Zheng (ICALP, 2023)

Dynamic Data Layout Optimization with Worst-Case Guarantees. - Kexin Rong 001; Paul Liu 001; Sarah Ashok Sonje; Moses Charikar (ICDE, 2024)