Artikel dengan mandat akses publik - Jie XuePelajari lebih lanjut
Tersedia di suatu tempat: 15
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)∗
D Lokshtanov, F Panolan, S Saurabh, J Xue, M Zehavi
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
Mandat: US National Science Foundation, European Commission
Clustering what matters: Optimal approximation for clustering with outliers
A Agrawal, T Inamdar, S Saurabh, J Xue
Journal of Artificial Intelligence Research 78, 143-166, 2023
Mandat: European Commission
Scalable computational geometry in MapReduce
Y Li, A Eldawy, J Xue, N Knorozova, MF Mokbel, R Janardan
The VLDB Journal 28, 523-548, 2019
Mandat: US National Science Foundation
A framework for approximation schemes on disk graphs
D Lokshtanov, F Panolan, S Saurabh, J Xue, M Zehavi
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
Mandat: US National Science Foundation, European Commission
Dynamic Geometric Set Cover, Revisited∗
TM Chan, Q He, S Suri, J Xue
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
Mandat: US National Science Foundation
Range closest-pair search in higher dimensions
TM Chan, S Rahul, J Xue
Computational Geometry 91, 101669, 2020
Mandat: US National Science Foundation
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs
S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
Mandat: US National Science Foundation, European Commission
Efficient algorithms for least square piecewise polynomial regression
D Lokshtanov, S Suri, J Xue
ESA21: Proceedings of European Symposium on Algorithms, 2021
Mandat: US National Science Foundation
A 1.9999-approximation algorithm for vertex cover on string graphs
D Lokshtanov, F Panolan, S Saurabh, J Xue, M Zehavi
40th International Symposium on Computational Geometry (SoCG 2024), 2024
Mandat: European Commission
Euclidean bottleneck steiner tree is fixed-parameter tractable
S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
Mandat: US National Science Foundation, European Commission
Crossing Number in Slightly Superexponential Time
D Lokshtanov, F Panolan, S Saurabh, R Sharma, J Xue, M Zehavi
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
Mandat: European Commission
ShadowAQP: Efficient Approximate Group-by and Join Query via Attribute-Oriented Sample Size Allocation and Data Generation
R Gu, H Li, H Dai, W Huang, J Xue, M Li, J Zheng, H Cai, Y Huang, ...
Proceedings of the VLDB Endowment 16 (13), 4216-4229, 2023
Mandat: National Natural Science Foundation of China
PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods
S Bandyapadhyay, K Clinch, W Lochet, D Lokshtanov, S Saurabh, J Xue
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
Mandat: European Commission
Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities
D Lokshtanov, A Sahu, S Saurabh, V Surianarayanan, J Xue
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
Mandat: European Commission
Efficient Approximation of Fractional Hypertree Width
V Korchemna, D Lokshtanov, S Saurabh, V Surianarayanan, J Xue
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024
Mandat: Austrian Science Fund, European Commission
Informasi terbitan dan pendanaan ditentukan secara otomatis oleh program komputer