Colored stochastic dominance problems. - Jie Xue 003; Yuan Li 013 (CoRR, 2016)

Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces. - Jie Xue 003; Yuan Li 013 (WADS, 2017)

On the arrangement of stochastic lines in ℤ2. - Yuan Li 013; Jie Xue 003; Akash Agrawal; Ravi Janardan (J. Discrete Algorithms, 2017)

Approximate Range Closest-Pair Search. - Jie Xue 003; Yuan Li 013; Ravi Janardan (CCCG, 2018)

Revealing the Relations between Learning Behaviors and Examination Scores via a Prediction System. - Zhenyu Pan; Jie Xue 003; Yang Gao; Honghao Wang; Guanling Chen (CSAI/ICIMT, 2018)

On the separability of stochastic geometric objects, with applications. - Jie Xue 003; Yuan Li 013; Ravi Janardan (Comput. Geom., 2018)

Colored range closest-pair problem under general distance functions. - Jie Xue 003 (SODA, 2019)

On the expected diameter, width, and complexity of a stochastic convex hull. - Jie Xue 003; Yuan Li 013; Ravi Janardan (Comput. Geom., 2019)

Scalable computational geometry in MapReduce. - Yuan Li 013; Ahmed Eldawy; Jie Xue 003; Nadezda Knorozova; Mohamed F. Mokbel; Ravi Janardan (VLDB J., 2019)

Fair Covering of Points by Balls. - Daniel Lokshtanov; Chinmay Sonar; Subhash Suri; Jie Xue 003 (CCCG, 2020)

The most-likely skyline problem for stochastic points. - Akash Agrawal; Yuan Li 013; Jie Xue 003; Ravi Janardan (Comput. Geom., 2020)

Range closest-pair search in higher dimensions. - Timothy M. Chan; Saladi Rahul; Jie Xue 003 (Comput. Geom., 2020)

Approximate range closest-pair queries. - Jie Xue 003; Yuan Li 013; Ravi Janardan (Comput. Geom., 2020)

Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. - Haitao Wang 001; Jie Xue 003 (Discret. Comput. Geom., 2020)

Searching for the closest-pair in a query translate. - Jie Xue 003; Yuan Li 013; Saladi Rahul; Ravi Janardan (J. Comput. Geom., 2020)

Efficient Algorithms for Least Square Piecewise Polynomial Regression. - Daniel Lokshtanov; Subhash Suri; Jie Xue 003 (ESA, 2021)

An ETH-Tight Algorithm for Multi-Team Formation. - Daniel Lokshtanov; Saket Saurabh 001; Subhash Suri; Jie Xue 003 (FSTTCS, 2021)

Intuitive Searching: An Approach to Search the Decision Policy of a Blackjack Agent. - Zhenyu Pan; Jie Xue 003; Tingjian Ge (ICICT (2), 2021)

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. - Neeraj Kumar 004; Daniel Lokshtanov; Saket Saurabh 001; Subhash Suri; Jie Xue 003 (SoCG, 2022)

Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. - Chinmay Sonar; Subhash Suri; Jie Xue 003 (IJCAI, 2022)

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2022)

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (SODA, 2022)

Improved algorithms for the bichromatic two-center problem for pairs of points. - Haitao Wang 001; Jie Xue 003 (Comput. Geom., 2022)

New Bounds for Range Closest-Pair Problems. - Jie Xue 003; Yuan Li 013; Saladi Rahul; Ravi Janardan (Discret. Comput. Geom., 2022)

Dynamic Geometric Set Cover and Hitting Set. - Pankaj K. Agarwal; Hsien-Chih Chang; Subhash Suri; Allen Xiao; Jie Xue 003 (ACM Trans. Algorithms, 2022)

Minimum-Membership Geometric Set Cover, Revisited. - Sayan Bandyapadhyay; William Lochet; Saket Saurabh 001; Jie Xue 003 (SoCG, 2023)

Fault Tolerance in Euclidean Committee Selection. - Chinmay Sonar; Subhash Suri; Jie Xue 003 (ESA, 2023)

A Framework for Approximation Schemes on Disk Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (SODA, 2023)

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (CoRR, 2023)

Clustering what Matters: Optimal Approximation for Clustering with Outliers. - Akanksha Agrawal 001; Tanmay Inamdar 002; Saket Saurabh 001; Jie Xue 003 (J. Artif. Intell. Res., 2023)

ShadowAQP: Efficient Approximate Group-by and Join Query via Attribute-oriented Sample Size Allocation and Data Generation. - Rong Gu; Han Li; Haipeng Dai 001; Wenjie Huang; Jie Xue 003; Meng Li 010; Jiaqi Zheng 001; Haoran Cai; Yihua Huang 001; Guihai Chen (Proc. VLDB Endow., 2023)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (APPROX/RANDOM, 2024)

Algorithms for Halfplane Coverage and Related Problems. - Haitao Wang 001; Jie Xue 003 (SoCG, 2024)

An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching. - Sayan Bandyapadhyay; Jie Xue 003 (SoCG, 2024)

Enclosing Points with Geometric Objects. - Timothy M. Chan; Qizheng He; Jie Xue 003 (SoCG, 2024)

A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (SoCG, 2024)

Sparse Outerstring Graphs Have Logarithmic Treewidth. - Shinwoo An; Eunjin Oh 001; Jie Xue 003 (ESA, 2024)

Efficient Approximation of Fractional Hypertree Width. - Viktoriia Korchemna; Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan; Jie Xue 003 (FOCS, 2024)

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2024)

Optimal Algorithm for the Planar Two-Center Problem. - Kyungjin Cho; Eunjin Oh 001; Haitao Wang 001; Jie Xue 003 (TheoretiCS, 2024)

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (ACM Trans. Algorithms, 2024)

Single-Source Shortest Path Problem in Weighted Disk Graphs. - Shinwoo An; Eunjin Oh 001; Jie Xue 003 (SoCG, 2025)

Embedding Graphs as Euclidean kNN-Graphs. - Thomas Schibler; Subhash Suri; Jie Xue 003 (SoCG, 2025)

Dynamic Maximum Depth of Geometric Objects. - Subhash Suri; Jie Xue 003; Xiongxin Yang; Jiumu Zhu (SoCG, 2025)

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Dániel Marx; Pranabendu Misra; Daniel Neuen; Saket Saurabh 001; Prafullkumar Tale; Jie Xue 003 (ICALP, 2025)

PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. - Sayan Bandyapadhyay; Katie Clinch; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2025)

Crossing Number in Slightly Superexponential Time (Extended Abstract). - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Roohani Sharma; Jie Xue 003; Meirav Zehavi (SODA, 2025)

Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities. - Daniel Lokshtanov; Abhishek Sahu; Saket Saurabh 001; Vaishali Surianarayanan; Jie Xue 003 (SODA, 2025)

Approximation Algorithms for the Geometric Multimatching Problem. - Shinwoo An; Eunjin Oh 001; Jie Xue 003 (STOC, 2025)

Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (STOC, 2025)

Subexponential Parameterized Algorithms for Hitting Subgraphs. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Jie Xue 003; Meirav Zehavi (STOC, 2025)

Parameterized algorithms on geometric intersection graphs. - Jie Xue 003; Meirav Zehavi (Comput. Sci. Rev., 2025)

Dynamic Geometric Set Cover, Revisited. - Timothy M. Chan; Qizheng He; Subhash Suri; Jie Xue 003 (SIAM J. Comput., 2025)

Approximation and Hardness of Polychromatic TSP. - Thomas Schibler; Subhash Suri; Jie Xue 003 (CoRR, 2025)