default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJie Xue 0003
Person information
- affiliation: New York University Shanghai, China
- affiliation (2019 - 2021): University of California, Santa Barbara, CA, USA
- affiliation (PhD 2019): University of Minnesota-Twin Cities, Department of Computer Science and Engineering, Minneapolis, MN, USA
Other persons with the same name
- Jie Xue — disambiguation page
- Jie Xue 0001
![[0000-0002-4952-5583]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-4952-5583")
— Shandong Normal University, School of Management Science and Engineering, Jinan, China (and 1 more) - Jie Xue 0002 — Chinese University of Hong Kong, Department of Geography and Resource Management
- Jie Xue 0004 — East China Normal University, Department of Computer Science and Technology, Shanghai, China
- Jie Xue 0005 — Delft University of Technology, Faculty of Technology, Policy and Management, Safety and Security Science Group, The Netherlands (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]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): 20 (2024)- [c35]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. APPROX/RANDOM 2024: 6:1-6:14 - [c34]Sayan Bandyapadhyay, Jie Xue:
An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching. SoCG 2024: 12:1-12:15 - [c33]Timothy M. Chan, Qizheng He, Jie Xue:
Enclosing Points with Geometric Objects. SoCG 2024: 35:1-35:15 - [c32]Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue:
Optimal Algorithm for the Planar Two-Center Problem. SoCG 2024: 40:1-40:15 - [c31]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG 2024: 72:1-72:11 - [c30]Haitao Wang, Jie Xue:
Algorithms for Halfplane Coverage and Related Problems. SoCG 2024: 79:1-79:15 - [c29]Shinwoo An, Eunjin Oh, Jie Xue:
Sparse Outerstring Graphs Have Logarithmic Treewidth. ESA 2024: 10:1-10:18 - [c28]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA 2024: 699-711 - [i27]Sayan Bandyapadhyay, Jie Xue:
An O(n log n)-Time Approximation Scheme for Geometric Many-to-Many Matching. CoRR abs/2402.15837 (2024) - [i26]Timothy M. Chan, Qizheng He, Jie Xue:
Enclosing Points with Geometric Objects. CoRR abs/2402.17322 (2024) - [i25]Shinwoo An, Eunjin Oh, Jie Xue:
Sparse Outerstring Graphs Have Logarithmic Treewidth. CoRR abs/2406.17424 (2024) - [i24]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR abs/2407.09356 (2024) - [i23]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms for Hitting Subgraphs. CoRR abs/2409.04786 (2024) - [i22]Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue:
Efficient Approximation of Fractional Hypertree Width. CoRR abs/2409.20172 (2024) - 2023
- [j13]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering what Matters: Optimal Approximation for Clustering with Outliers. J. Artif. Intell. Res. 78: 143-166 (2023) - [c27]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI 2023: 6666-6674 - [c26]Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. SoCG 2023: 11:1-11:14 - [c25]Chinmay Sonar, Subhash Suri, Jie Xue:
Fault Tolerance in Euclidean Committee Selection. ESA 2023: 95:1-95:14 - [c24]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. SODA 2023: 2228-2241 - [i21]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR abs/2304.13695 (2023) - [i20]Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. CoRR abs/2305.03985 (2023) - [i19]Chinmay Sonar, Subhash Suri, Jie Xue:
Fault Tolerance in Euclidean Committee Selection. CoRR abs/2308.07268 (2023) - [i18]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR abs/2312.01589 (2023) - 2022
- [j12]Haitao Wang, Jie Xue:
Improved algorithms for the bichromatic two-center problem for pairs of points. Comput. Geom. 100: 101806 (2022) - [j11]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
New Bounds for Range Closest-Pair Problems. Discret. Comput. Geom. 68(1): 1-49 (2022) - [j10]Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue:
Dynamic Geometric Set Cover and Hitting Set. ACM Trans. Algorithms 18(4): 40:1-40:37 (2022) - [c23]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG 2022: 11:1-11:16 - [c22]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG 2022: 52:1-52:14 - [c21]Chinmay Sonar, Subhash Suri, Jie Xue:
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. IJCAI 2022: 475-481 - [c20]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA 2022: 2005-2031 - [c19]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: 2063-2084 - [c18]Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue:
Dynamic Geometric Set Cover, Revisited. SODA 2022: 3496-3528 - [i17]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR abs/2203.08193 (2022) - [i16]Chinmay Sonar, Subhash Suri, Jie Xue:
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. CoRR abs/2205.13598 (2022) - [i15]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. CoRR abs/2211.02717 (2022) - [i14]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering What Matters: Optimal Approximation for Clustering with Outliers. CoRR abs/2212.00696 (2022) - 2021
- [c17]Daniel Lokshtanov, Subhash Suri, Jie Xue:
Efficient Algorithms for Least Square Piecewise Polynomial Regression. ESA 2021: 63:1-63:15 - [c16]Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
An ETH-Tight Algorithm for Multi-Team Formation. FSTTCS 2021: 28:1-28:9 - [c15]Zhenyu Pan, Jie Xue, Tingjian Ge:
Intuitive Searching: An Approach to Search the Decision Policy of a Blackjack Agent. ICICT (2) 2021: 869-887 - [i13]Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue:
Dynamic Geometric Set Cover, Revisited. CoRR abs/2111.01196 (2021) - [i12]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR abs/2111.14196 (2021) - 2020
- [j9]Akash Agrawal, Yuan Li, Jie Xue, Ravi Janardan:
The most-likely skyline problem for stochastic points. Comput. Geom. 88: 101609 (2020) - [j8]Jie Xue, Yuan Li, Ravi Janardan:
Approximate range closest-pair queries. Comput. Geom. 90: 101654 (2020) - [j7]Timothy M. Chan, Saladi Rahul, Jie Xue:
Range closest-pair search in higher dimensions. Comput. Geom. 91: 101669 (2020) - [j6]Haitao Wang, Jie Xue:
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. Discret. Comput. Geom. 64(4): 1141-1166 (2020) - [j5]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the closest-pair in a query translate. J. Comput. Geom. 11(2): 26-61 (2020) - [c14]Daniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue:
Fair Covering of Points by Balls. CCCG 2020: 26-32 - [c13]Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue:
Dynamic Geometric Set Cover and Hitting Set. SoCG 2020: 2:1-2:15 - [i11]Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue:
Dynamic geometric set cover and hitting set. CoRR abs/2003.00202 (2020)
2010 – 2019
- 2019
- [j4]Jie Xue, Yuan Li, Ravi Janardan:
On the expected diameter, width, and complexity of a stochastic convex hull. Comput. Geom. 82: 16-31 (2019) - [j3]Yuan Li, Ahmed Eldawy, Jie Xue, Nadezda Knorozova, Mohamed F. Mokbel, Ravi Janardan:
Scalable computational geometry in MapReduce. VLDB J. 28(4): 523-548 (2019) - [c12]Haitao Wang, Jie Xue:
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. SoCG 2019: 60:1-60:13 - [c11]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the Closest-Pair in a Query Translate. SoCG 2019: 61:1-61:15 - [c10]Jie Xue:
Colored range closest-pair problem under general distance functions. SODA 2019: 373-390 - [c9]Timothy M. Chan, Saladi Rahul, Jie Xue:
Range Closest-Pair Search in Higher Dimensions. WADS 2019: 269-282 - [c8]Haitao Wang, Jie Xue:
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. WADS 2019: 578-591 - [i10]Haitao Wang, Jie Xue:
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. CoRR abs/1903.05255 (2019) - [i9]Haitao Wang, Jie Xue:
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. CoRR abs/1905.00157 (2019) - [i8]Timothy M. Chan, Saladi Rahul, Jie Xue:
Range closest-pair search in higher dimensions. CoRR abs/1905.01029 (2019) - 2018
- [j2]Jie Xue, Yuan Li, Ravi Janardan:
On the separability of stochastic geometric objects, with applications. Comput. Geom. 74: 1-20 (2018) - [c7]Jie Xue, Yuan Li, Ravi Janardan:
Approximate Range Closest-Pair Search. CCCG 2018: 282-287 - [c6]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
New Bounds for Range Closest-Pair Problems. SoCG 2018: 73:1-73:14 - [c5]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: 414-419 - [i7]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the closest-pair in a query translate. CoRR abs/1807.09498 (2018) - [i6]Jie Xue:
Colored range closest-pair problem under general distance functions. CoRR abs/1807.09977 (2018) - 2017
- [j1]Yuan Li, Jie Xue, Akash Agrawal, Ravi Janardan:
On the arrangement of stochastic lines in ℤ2. J. Discrete Algorithms 44: 1-20 (2017) - [c4]Akash Agrawal, Yuan Li, Jie Xue, Ravi Janardan:
The Most-Likely Skyline Problem for Stochastic Points. CCCG 2017: 78-83 - [c3]Jie Xue, Yuan Li:
Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces. WADS 2017: 569-580 - [c2]Jie Xue, Yuan Li, Ravi Janardan:
On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull. WADS 2017: 581-592 - [i5]Jie Xue, Yuan Li, Ravi Janardan:
On the expected diameter, width, and complexity of a stochastic convex-hull. CoRR abs/1704.07028 (2017) - [i4]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
New bounds for range closest-pair problems. CoRR abs/1712.09749 (2017) - 2016
- [c1]Jie Xue, Yuan Li, Ravi Janardan:
On the Separability of Stochastic Geometric Objects, with Applications. SoCG 2016: 62:1-62:16 - [i3]Jie Xue, Yuan Li, Ravi Janardan:
On the Separability of Stochastic Geometric Objects, with Applications. CoRR abs/1603.07021 (2016) - [i2]Jie Xue, Yuan Li:
Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces. CoRR abs/1612.04890 (2016) - [i1]Jie Xue, Yuan Li:
Colored stochastic dominance problems. CoRR abs/1612.06954 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
