Jie Xue

CoRR, July, 2025

Dynamic Geometric Set Cover, Revisited.

[BibT_eX]

[DOI]

SIAM J. Comput., 2025

Subexponential Parameterized Algorithms for Hitting Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Approximation Algorithms for the Geometric Multimatching Problem.

[BibT_eX]

[DOI]

Shinwoo An

Eunjin Oh

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Parameterized Approximation for Capacitated <i>d</i>-Hitting Set with Hard Capacities.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Abhishek Sahu

Saket Saurabh

Vaishali Surianarayanan

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Crossing Number in Slightly Superexponential Time (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Dynamic Maximum Depth of Geometric Objects.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Computational Geometry, 2025

Embedding Graphs as Euclidean kNN-Graphs.

[BibT_eX]

[DOI]

Thomas Schibler

Proceedings of the 41st International Symposium on Computational Geometry, 2025

Single-Source Shortest Path Problem in Weighted Disk Graphs.

[BibT_eX]

[DOI]

Shinwoo An

Eunjin Oh

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, July, 2024

Optimal Algorithm for the Planar Two-Center Problem.

[BibT_eX]

[DOI]

TheoretiCS, 2024

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Efficient Approximation of Fractional Hypertree Width.

[BibT_eX]

[DOI]

Viktoriia Korchemna

Daniel Lokshtanov

Saket Saurabh

Vaishali Surianarayanan

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Sparse Outerstring Graphs Have Logarithmic Treewidth.

[BibT_eX]

[DOI]

Shinwoo An

Eunjin Oh

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Enclosing Points with Geometric Objects.

[BibT_eX]

[DOI]

Timothy M. Chan

Qizheng He

Proceedings of the 40th International Symposium on Computational Geometry, 2024

An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching.

[BibT_eX]

[DOI]

Sayan Bandyapadhyay

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Algorithms for Halfplane Coverage and Related Problems.

[BibT_eX]

[DOI]

Haitao Wang

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

ShadowAQP: Efficient Approximate Group-by and Join Query via Attribute-oriented Sample Size Allocation and Data Generation.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2023

Clustering what Matters: Optimal Approximation for Clustering with Outliers.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

A Framework for Approximation Schemes on Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Fault Tolerance in Euclidean Committee Selection.

[BibT_eX]

[DOI]

Chinmay Sonar

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Minimum-Membership Geometric Set Cover, Revisited.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Dynamic Geometric Set Cover and Hitting Set.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

New Bounds for Range Closest-Pair Problems.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Improved algorithms for the bichromatic two-center problem for pairs of points.

[BibT_eX]

[DOI]

Haitao Wang

Comput. Geom., 2022

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space.

[BibT_eX]

[DOI]

Chinmay Sonar

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Intuitive Searching: An Approach to Search the Decision Policy of a Blackjack Agent.

[BibT_eX]

[DOI]

Zhenyu Pan

Tingjian Ge

Proceedings of Sixth International Congress on Information and Communication Technology, 2021

An ETH-Tight Algorithm for Multi-Team Formation.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Efficient Algorithms for Least Square Piecewise Polynomial Regression.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Searching for the closest-pair in a query translate.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.

[BibT_eX]

[DOI]

Haitao Wang

Discret. Comput. Geom., 2020

Approximate range closest-pair queries.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Range closest-pair search in higher dimensions.

[BibT_eX]

[DOI]

Timothy M. Chan

Saladi Rahul

Comput. Geom., 2020

The most-likely skyline problem for stochastic points.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Fair Covering of Points by Balls.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Scalable computational geometry in MapReduce.

[BibT_eX]

[DOI]

VLDB J., 2019

On the expected diameter, width, and complexity of a stochastic convex hull.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Colored range closest-pair problem under general distance functions.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

On the separability of stochastic geometric objects, with applications.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Revealing the Relations between Learning Behaviors and Examination Scores via a Prediction System.

[BibT_eX]

[DOI]

Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence, 2018

Approximate Range Closest-Pair Search.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

On the arrangement of stochastic lines in ℤ<sup>2</sup>.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2017

Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Colored stochastic dominance problems.

[BibT_eX]

[DOI]