Jie Xue

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 65

Top Topics

Geometric Objects

Top Venues

Publications

Sayan Bandyapadhyay, Jie Xue
An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching. SoCG (2024)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA (2024)
Timothy M. Chan, Qizheng He, Jie Xue
Enclosing Points with Geometric Objects. CoRR (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR (2024)
Sayan Bandyapadhyay, Jie Xue
An O(n log n)-Time Approximation Scheme for Geometric Many-to-Many Matching. CoRR (2024)
Timothy M. Chan, Qizheng He, Jie Xue
Enclosing Points with Geometric Objects. SoCG (2024)
Shinwoo An, Eunjin Oh, Jie Xue
Sparse Outerstring Graphs Have Logarithmic Treewidth. CoRR (2024)
Haitao Wang, Jie Xue
Algorithms for Halfplane Coverage and Related Problems. SoCG (2024)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms 20 (3) (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG (2024)
Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue
Optimal Algorithm for the Planar Two-Center Problem. SoCG (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A Framework for Approximation Schemes on Disk Graphs. SODA (2023)
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
Clustering what Matters: Optimal Approximation for Clustering with Outliers. J. Artif. Intell. Res. 78 (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
Minimum-Membership Geometric Set Cover, Revisited. CoRR (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
Minimum-Membership Geometric Set Cover, Revisited. SoCG (2023)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR (2023)
Chinmay Sonar, Subhash Suri, Jie Xue
Fault Tolerance in Euclidean Committee Selection. ESA (2023)
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI (2023)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR (2023)
Chinmay Sonar, Subhash Suri, Jie Xue
Fault Tolerance in Euclidean Committee Selection. CoRR (2023)
Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
Dynamic Geometric Set Cover, Revisited. SODA (2022)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG (2022)
Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue
Dynamic Geometric Set Cover and Hitting Set. ACM Trans. Algorithms 18 (4) (2022)
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR (2022)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A Framework for Approximation Schemes on Disk Graphs. CoRR (2022)
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
New Bounds for Range Closest-Pair Problems. Discret. Comput. Geom. 68 (1) (2022)
Chinmay Sonar, Subhash Suri, Jie Xue
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. IJCAI (2022)
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
Clustering What Matters: Optimal Approximation for Clustering with Outliers. CoRR (2022)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA (2022)
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG (2022)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA (2022)
Chinmay Sonar, Subhash Suri, Jie Xue
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. CoRR (2022)
Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
Dynamic Geometric Set Cover, Revisited. CoRR (2021)
Zhenyu Pan, Jie Xue, Tingjian Ge
Intuitive Searching: An Approach to Search the Decision Policy of a Blackjack Agent. ICICT (2) (2021)
Akash Agrawal, Yuan Li, Jie Xue, Ravi Janardan
The most-likely skyline problem for stochastic points. Comput. Geom. 88 (2020)
Jie Xue, Yuan Li, Ravi Janardan
Approximate range closest-pair queries. Comput. Geom. 90 (2020)
Haitao Wang, Jie Xue
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. Discret. Comput. Geom. 64 (4) (2020)
Timothy M. Chan, Saladi Rahul, Jie Xue
Range closest-pair search in higher dimensions. Comput. Geom. 91 (2020)
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
Searching for the closest-pair in a query translate. J. Comput. Geom. 11 (2) (2020)
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
Searching for the Closest-Pair in a Query Translate. SoCG (2019)
Haitao Wang, Jie Xue
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. CoRR (2019)
Haitao Wang, Jie Xue
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. SoCG (2019)
Jie Xue, Yuan Li, Ravi Janardan
On the expected diameter, width, and complexity of a stochastic convex hull. Comput. Geom. 82 (2019)
Timothy M. Chan, Saladi Rahul, Jie Xue
Range closest-pair search in higher dimensions. CoRR (2019)
Haitao Wang, Jie Xue
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. WADS (2019)
Yuan Li, Ahmed Eldawy, Jie Xue, Nadezda Knorozova, Mohamed F. Mokbel, Ravi Janardan
Scalable computational geometry in MapReduce. VLDB J. 28 (4) (2019)
Jie Xue
Colored range closest-pair problem under general distance functions. SODA (2019)
Timothy M. Chan, Saladi Rahul, Jie Xue
Range Closest-Pair Search in Higher Dimensions. WADS (2019)
Haitao Wang, Jie Xue
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. CoRR (2019)
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
New Bounds for Range Closest-Pair Problems. SoCG (2018)
Jie Xue, Yuan Li, Ravi Janardan
Approximate Range Closest-Pair Search. CCCG (2018)
Zhenyu Pan, Jie Xue, Yang Gao, Honghao Wang, Guanling Chen
Revealing the Relations between Learning Behaviors and Examination Scores via a Prediction System. CSAI/ICIMT (2018)
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
Searching for the closest-pair in a query translate. CoRR (2018)
Jie Xue
Colored range closest-pair problem under general distance functions. CoRR (2018)
Jie Xue, Yuan Li, Ravi Janardan
On the separability of stochastic geometric objects, with applications. Comput. Geom. 74 (2018)
Yuan Li, Jie Xue, Akash Agrawal, Ravi Janardan
. J. Discrete Algorithms 44 (2017)
Jie Xue, Yuan Li, Ravi Janardan
On the expected diameter, width, and complexity of a stochastic convex-hull. CoRR (2017)
Akash Agrawal, Yuan Li, Jie Xue, Ravi Janardan
The Most-Likely Skyline Problem for Stochastic Points. CCCG (2017)
Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
New bounds for range closest-pair problems. CoRR (2017)
Jie Xue, Yuan Li
Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces. WADS (2017)
Jie Xue, Yuan Li, Ravi Janardan
On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull. WADS (2017)
Jie Xue, Yuan Li, Ravi Janardan
On the Separability of Stochastic Geometric Objects, with Applications. CoRR (2016)
Jie Xue, Yuan Li, Ravi Janardan
On the Separability of Stochastic Geometric Objects, with Applications. SoCG (2016)
Jie Xue, Yuan Li
Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces. CoRR (2016)
Jie Xue, Yuan Li
Colored stochastic dominance problems. CoRR (2016)