Ke Chen

activity

20172025

collaborators

4 papers

cs.CG2025

A Couple of Simple Algorithms for $k$ -Dispersion

Ke Chen, Adrian Dumitrescu

Given a set $P$ of $n$ points in $R^{d}$ , and a positive integer $k \leq n$ , the $k$ -dispersion problem is that of selecting $k$ of the given points so that the minimum inte…

cs.DS2023

Finding Small Complete Subgraphs Efficiently

Ke Chen, Adrian Dumitrescu, Andrzej Lingas

(I) We revisit the algorithmic problem of finding all triangles in a graph $G = (V, E)$ with $n$ vertices and $m$ edges. According to a result of Chiba and Nishizeki (1985), this task…

cs.CG2019

On the Stretch Factor of Polygonal Chains

Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer +1

Let $P = (p_{1}, p_{2}, \dots, p_{n})$ be a polygonal chain in $R^{d}$ . The stretch factor of $P$ is the ratio between the total length of $P$ and the distance of its endpoints, $\s…

cs.CG2017

On the Longest Spanning Tree with Neighborhoods

Ke Chen, Adrian Dumitrescu

We study a maximization problem for geometric network design. Given a set of $n$ compact neighborhoods in $R^{d}$ , select a point in each neighborhood, so that the longest s…

A Couple of Simple Algorithms for k-Dispersion

Finding Small Complete Subgraphs Efficiently

On the Stretch Factor of Polygonal Chains

On the Longest Spanning Tree with Neighborhoods

A Couple of Simple Algorithms for $k$ -Dispersion