Jie Xue

98 papers A* 32A 4B 4Journal 50Unranked 8
YearRankTypeTitle / Venue / Authors
2026 — conf
The Sparsification Lemma via Measure and Conquer.
SOSA
Daniel Lokshtanov, Saket Saurabh, Jie Xue
2025 A* conf
Approximation Algorithms for the Geometric Multimatching Problem.
STOC
Shinwoo An, Eunjin Oh, Jie Xue
2025 — conf
Approximation and Hardness of Polychromatic TSP.
CCCG
Thomas Schibler, Subhash Suri, Jie Xue
2025 J jnl
Approximation and Hardness of Polychromatic TSP.
CoRR
Thomas Schibler, Subhash Suri, Jie Xue
2025 A* conf
Crossing Number in Slightly Superexponential Time (Extended Abstract).
SODA
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi
2025 J jnl
Dynamic Geometric Set Cover, Revisited.
SIAM J. Comput.
Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
2025 A* conf
Dynamic Maximum Depth of Geometric Objects.
SoCG
Subhash Suri, Jie Xue, Xiongxin Yang, Jiumu Zhu
2025 A* conf
Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs.
STOC
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2025 A* conf
Embedding Graphs as Euclidean kNN-Graphs.
SoCG
Thomas Schibler, Subhash Suri, Jie Xue
2025 A* conf
PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods.
SODA
Sayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2025 A* conf
Parameterized Approximation for Capacitated
SODA
Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2025 J jnl
Parameterized algorithms on geometric intersection graphs.
Comput. Sci. Rev.
Jie Xue, Meirav Zehavi
2025 A* conf
Robust Contraction Decomposition for Minor-Free Graphs and Its Applications.
ICALP
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2025 A* conf
Single-Source Shortest Path Problem in Weighted Disk Graphs.
SoCG
Shinwoo An, Eunjin Oh, Jie Xue
2025 J jnl
Single-Source Shortest Path Problem in Weighted Disk Graphs.
CoRR
Shinwoo An, Eunjin Oh, Jie Xue
2025 A* conf
Subexponential Parameterized Algorithms for Hitting Subgraphs.
STOC
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024 A* conf
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs.
SoCG
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024 A* conf
Algorithms for Halfplane Coverage and Related Problems.
SoCG
Haitao Wang, Jie Xue
2024 J jnl
Algorithms for Halfplane Coverage and Related Problems.
CoRR
Haitao Wang, Jie Xue
2024 A* conf
An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching.
SoCG
Sayan Bandyapadhyay, Jie Xue
2024 J jnl
An O(n log n)-Time Approximation Scheme for Geometric Many-to-Many Matching.
CoRR
Sayan Bandyapadhyay, Jie Xue
2024 A conf
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3.
APPROX/RANDOM
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024 J jnl
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3.
CoRR
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024 A* conf
Efficient Approximation of Fractional Hypertree Width.
FOCS
Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024 J jnl
Efficient Approximation of Fractional Hypertree Width.
CoRR
Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024 A* conf
Enclosing Points with Geometric Objects.
SoCG
Timothy M. Chan, Qizheng He, Jie Xue
2024 J jnl
Enclosing Points with Geometric Objects.
CoRR
Timothy M. Chan, Qizheng He, Jie Xue
2024 A* conf
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.
SODA
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2024 A* conf
Optimal Algorithm for the Planar Two-Center Problem.
SoCG
Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue
2024 J jnl
Optimal Algorithm for the Planar Two-Center Problem.
TheoretiCS
Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue
2024 J jnl
Parameterized Approximation for Capacitated
CoRR
Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024 J jnl
Robust Contraction Decomposition for Minor-Free Graphs and its Applications.
CoRR
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2024 A conf
Sparse Outerstring Graphs Have Logarithmic Treewidth.
ESA
Shinwoo An, Eunjin Oh, Jie Xue
2024 J jnl
Sparse Outerstring Graphs Have Logarithmic Treewidth.
CoRR
Shinwoo An, Eunjin Oh, Jie Xue
2024 J jnl
Subexponential Parameterized Algorithms for Hitting Subgraphs.
CoRR
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024 J jnl
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs.
ACM Trans. Algorithms
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2023 A* conf
A Framework for Approximation Schemes on Disk Graphs.
SODA
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023 A* conf
Clustering What Matters: Optimal Approximation for Clustering with Outliers.
AAAI
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2023 J jnl
Clustering what Matters: Optimal Approximation for Clustering with Outliers.
J. Artif. Intell. Res.
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2023 J jnl
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.
CoRR
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2023 A conf
Fault Tolerance in Euclidean Committee Selection.
ESA
Chinmay Sonar, Subhash Suri, Jie Xue
2023 J jnl
Fault Tolerance in Euclidean Committee Selection.
CoRR
Chinmay Sonar, Subhash Suri, Jie Xue
2023 J jnl
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs.
CoRR
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023 A* conf
Minimum-Membership Geometric Set Cover, Revisited.
SoCG
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
2023 J jnl
Minimum-Membership Geometric Set Cover, Revisited.
CoRR
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
2023 J jnl
ShadowAQP: Efficient Approximate Group-by and Join Query via Attribute-oriented Sample Size Allocation and Data Generation.
Proc. VLDB Endow.
Rong Gu, Han Li, Haipeng Dai, Wenjie Huang, Jie Xue, Meng Li, Jiaqi Zheng, Haoran Cai, Yihua Huang, Guihai Chen
2022 J jnl
A Framework for Approximation Schemes on Disk Graphs.
CoRR
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022 J jnl
Clustering What Matters: Optimal Approximation for Clustering with Outliers.
CoRR
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2022 J jnl
Dynamic Geometric Set Cover and Hitting Set.
ACM Trans. Algorithms
Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue
2022 A* conf
Dynamic Geometric Set Cover, Revisited.
SODA
Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
2022 J jnl
Improved algorithms for the bichromatic two-center problem for pairs of points.
Comput. Geom.
Haitao Wang, Jie Xue
2022 A* conf
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space.
IJCAI
Chinmay Sonar, Subhash Suri, Jie Xue
2022 J jnl
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space.
CoRR
Chinmay Sonar, Subhash Suri, Jie Xue
2022 J jnl
New Bounds for Range Closest-Pair Problems.
Discret. Comput. Geom.
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
2022 A* conf
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles.
SoCG
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2022 J jnl
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles.
CoRR
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2022 A* conf
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs.
SODA
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2022 A* conf
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract).
SODA
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022 A* conf
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs.
SoCG
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2021 — conf
An ETH-Tight Algorithm for Multi-Team Formation.
FSTTCS
Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2021 J jnl
Dynamic Geometric Set Cover, Revisited.
CoRR
Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
2021 A conf
Efficient Algorithms for Least Square Piecewise Polynomial Regression.
ESA
Daniel Lokshtanov, Subhash Suri, Jie Xue
2021 — conf
Intuitive Searching: An Approach to Search the Decision Policy of a Blackjack Agent.
ICICT (2)
Zhenyu Pan, Jie Xue, Tingjian Ge
2021 J jnl
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs.
CoRR
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2020 J jnl
Approximate range closest-pair queries.
Comput. Geom.
Jie Xue, Yuan Li, Ravi Janardan
2020 A* conf
Dynamic Geometric Set Cover and Hitting Set.
SoCG
Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue
2020 J jnl
Dynamic geometric set cover and hitting set.
CoRR
Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue
2020 — conf
Fair Covering of Points by Balls.
CCCG
Daniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue
2020 J jnl
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
Discret. Comput. Geom.
Haitao Wang, Jie Xue
2020 J jnl
Range closest-pair search in higher dimensions.
Comput. Geom.
Timothy M. Chan, Saladi Rahul, Jie Xue
2020 J jnl
Searching for the closest-pair in a query translate.
J. Comput. Geom.
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
2020 J jnl
The most-likely skyline problem for stochastic points.
Comput. Geom.
Akash Agrawal, Yuan Li, Jie Xue, Ravi Janardan
2019 A* conf
Colored range closest-pair problem under general distance functions.
SODA
Jie Xue
2019 B conf
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points.
WADS
Haitao Wang, Jie Xue
2019 J jnl
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points.
CoRR
Haitao Wang, Jie Xue
2019 A* conf
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
SoCG
Haitao Wang, Jie Xue
2019 J jnl
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
CoRR
Haitao Wang, Jie Xue
2019 J jnl
On the expected diameter, width, and complexity of a stochastic convex hull.
Comput. Geom.
Jie Xue, Yuan Li, Ravi Janardan
2019 B conf
Range Closest-Pair Search in Higher Dimensions.
WADS
Timothy M. Chan, Saladi Rahul, Jie Xue
2019 J jnl
Range closest-pair search in higher dimensions.
CoRR
Timothy M. Chan, Saladi Rahul, Jie Xue
2019 J jnl
Scalable computational geometry in MapReduce.
VLDB J.
Yuan Li, Ahmed Eldawy, Jie Xue, Nadezda Knorozova, Mohamed F. Mokbel, Ravi Janardan
2019 A* conf
Searching for the Closest-Pair in a Query Translate.
SoCG
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
2018 — conf
Approximate Range Closest-Pair Search.
CCCG
Jie Xue, Yuan Li, Ravi Janardan
2018 J jnl
Colored range closest-pair problem under general distance functions.
CoRR
Jie Xue
2018 A* conf
New Bounds for Range Closest-Pair Problems.
SoCG
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
2018 J jnl
On the separability of stochastic geometric objects, with applications.
Comput. Geom.
Jie Xue, Yuan Li, Ravi Janardan
2018 — conf
Revealing the Relations between Learning Behaviors and Examination Scores via a Prediction System.
CSAI/ICIMT
Zhenyu Pan, Jie Xue, Yang Gao, Honghao Wang, Guanling Chen
2018 J jnl
Searching for the closest-pair in a query translate.
CoRR
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
2017 J jnl
New bounds for range closest-pair problems.
CoRR
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
2017 B conf
On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull.
WADS
Jie Xue, Yuan Li, Ravi Janardan
2017 J jnl
On the arrangement of stochastic lines in ℤ
J. Discrete Algorithms
Yuan Li, Jie Xue, Akash Agrawal, Ravi Janardan
2017 J jnl
On the expected diameter, width, and complexity of a stochastic convex-hull.
CoRR
Jie Xue, Yuan Li, Ravi Janardan
2017 B conf
Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces.
WADS
Jie Xue, Yuan Li
2017 — conf
The Most-Likely Skyline Problem for Stochastic Points.
CCCG
Akash Agrawal, Yuan Li, Jie Xue, Ravi Janardan
2016 J jnl
Colored stochastic dominance problems.
CoRR
Jie Xue, Yuan Li
2016 A* conf
On the Separability of Stochastic Geometric Objects, with Applications.
SoCG
Jie Xue, Yuan Li, Ravi Janardan
2016 J jnl
On the Separability of Stochastic Geometric Objects, with Applications.
CoRR
Jie Xue, Yuan Li, Ravi Janardan
2016 J jnl
Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces.
CoRR
Jie Xue, Yuan Li