research
∙
08/14/2023
Fault Tolerance in Euclidean Committee Selection
In the committee selection problem, the goal is to choose a subset of si...
share
research
∙
05/06/2023
Minimum-Membership Geometric Set Cover, Revisited
We revisit a natural variant of geometric set cover, called minimum-memb...
research
∙
04/26/2023
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs
We investigate a fundamental vertex-deletion problem called (Induced) Su...
research
∙
12/01/2022
Clustering What Matters: Optimal Approximation for Clustering with Outliers
Clustering with outliers is one of the most fundamental problems in Comp...
research
∙
11/04/2022
A Framework for Approximation Schemes on Disk Graphs
We initiate a systematic study of approximation schemes for fundamental ...
research
∙
05/26/2022
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space
We consider multiwinner elections in Euclidean space using the minimax C...
research
∙
05/10/2022
A spatial-temporal short-term traffic flow prediction model based on dynamical-learning graph convolution mechanism
Short-term traffic flow prediction is a vital branch of the Intelligent ...
research
∙
03/15/2022
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles
Suppose we are given a pair of points s, t and a set S of n geometric ob...
research
∙
11/28/2021
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs
We design the first subexponential-time (parameterized) algorithms for s...
research
∙
11/01/2021
Dynamic Geometric Set Cover, Revisited
Geometric set cover is a classical problem in computational geometry, wh...
research
∙
02/29/2020
Dynamic geometric set cover and hitting set
We investigate dynamic versions of geometric set cover and hitting set w...
research
∙
05/03/2019
Range closest-pair search in higher dimensions
Range closest-pair (RCP) search is a range-search variant of the classic...
research
∙
05/01/2019
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points
We consider a bichromatic two-center problem for pairs of points. Given ...
research
∙
03/12/2019
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs
We revisit a classical graph-theoretic problem, the single-source shorte...
research
∙
07/26/2018
Colored range closest-pair problem under general distance functions
The range closest-pair (RCP) problem is the range-search version of the ...
research
∙
07/25/2018
Searching for the closest-pair in a query translate
In this paper, we consider a range-search variant of the closest-pair pr...
research
∙
12/28/2017
