Eunjin Oh | DeepAI

DeepAI AI Chat

Featured Co-authors

Sariel Har-Peled
44 publications
Dan Halperin
26 publications
Micha Sharir
26 publications
Kurt Mehlhorn
21 publications
Hee-Kap Ahn
21 publications
Darren Strash
20 publications
Jean-Lou De Carufel
13 publications
Sang Won Bae
10 publications
Luis Barba
8 publications
Lena Schlipf
7 publications
Kyungjin Cho
5 publications

∙ 06/29/2023

Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs

In this paper, we study the maximum clique problem on hyperbolic random ...

0 Eunjin Oh, et al. ∙

∙ 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...

0 Kyungjin Cho, et al. ∙

∙ 07/08/2021

Feedback Vertex Set on Geometric Intersection Graphs

In this paper, we present an algorithm for computing a feedback vertex s...

0 Shinwoo An, et al. ∙

∙ 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...

0 Kyungjin Cho, et al. ∙

∙ 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...

0 Shinwoo An, et al. ∙

∙ 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 ...

0 Kyungjin Cho, et al. ∙

∙ 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...

0 Dan Halperin, et al. ∙

∙ 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...

0 Eunjin Oh, et al. ∙

∙ 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...

0 Eunjin Oh, et al. ∙

∙ 10/19/2019

Polygon Queries for Convex Hulls of Points

We study the following range searching problem: Preprocess a set P of n ...

0 Eunjin Oh, et al. ∙

∙ 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 ...

0 Hee-Kap Ahn, et al. ∙

∙ 09/27/2018

Point Location in Incremental Planar Subdivisions

We study the point location problem in incremental (possibly disconnecte...

0 Eunjin Oh, et al. ∙

∙ 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...

0 Eunjin Oh, et al. ∙

∙ 03/12/2018

Point Location in Dynamic Planar Subdivisions

We study the point location problem on dynamic planar subdivisions that ...

0 Eunjin Oh, et al. ∙

∙ 03/11/2018

Approximate Range Queries for Clustering

We study the approximate range searching for three variants of the clust...

0 Eunjin Oh, et al. ∙

∙ 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...

0 Eunjin Oh, et al. ∙

∙ 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...

0 Eunjin Oh, et al. ∙

∙ 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 ...

0 Eunjin Oh, et al. ∙

∙ 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...

0 Eunjin Oh, et al. ∙

∙ 09/28/2017

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms

We are given a read-only memory for input and a write-only stream for ou...

0 Eunjin Oh, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world