research
∙
06/29/2023
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs
In this paper, we study the maximum clique problem on hyperbolic random ...
share
research
∙
11/07/2022
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k^2 and Linear in n
In this paper, we study the problem: Given an undirected planar graph G...
research
∙
07/08/2021
Feedback Vertex Set on Geometric Intersection Graphs
In this paper, we present an algorithm for computing a feedback vertex s...
research
∙
06/27/2021
Linear-Time Approximation Scheme for k-Means Clustering of Affine Subspaces
In this paper, we present a linear-time approximation scheme for k-means...
research
∙
06/09/2021
Reachability Problems for Transmission Graphs
Let P be a set of n points in the plane where each point p of P is assoc...
research
∙
07/17/2020
Optimal Algorithm for the Planar Two-Center Problem
In this paper, we consider the planar two-center problem: Given a set S ...
research
∙
03/01/2020
The Maximum-Level Vertex in an Arrangement of Lines
Let L be a set of n lines in the plane, not necessarily in general posit...
research
∙
10/27/2019
Computing a Geodesic Two-Center of Points in a Simple Polygon
Given a simple polygon P and a set Q of points contained in P, we consid...
research
∙
10/27/2019
Computing the Center Region and Its Variants
We present an O(n^2log^4 n)-time algorithm for computing the center regi...
research
∙
10/19/2019
Polygon Queries for Convex Hulls of Points
We study the following range searching problem: Preprocess a set P of n ...
research
∙
06/03/2019
On Romeo and Juliet Problems: Minimizing Distance-to-Sight
We introduce a variant of the watchman route problem, which we call the ...
research
∙
09/27/2018
Point Location in Incremental Planar Subdivisions
We study the point location problem in incremental (possibly disconnecte...
research
∙
04/01/2018
Assigning Weights to Minimize the Covering Radius in the Plane
Given a set P of n points in the plane and a multiset W of k weights wit...
research
∙
03/12/2018
Point Location in Dynamic Planar Subdivisions
We study the point location problem on dynamic planar subdivisions that ...
research
∙
03/11/2018
Approximate Range Queries for Clustering
We study the approximate range searching for three variants of the clust...
research
∙
02/17/2018
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon
Given a set of point sites in a simple polygon, the geodesic farthest-po...
research
∙
01/23/2018
Finding Pairwise Intersections of Rectangles in a Query Rectangle
We consider the following problem: Preprocess a set S of n axis-parallel...
research
∙
01/08/2018
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of ...
research
∙
10/25/2017
The Geodesic 2-center Problem in a Simple Polygon
The geodesic k-center problem in a simple polygon with n vertices consis...
research
∙
09/28/2017
