Peng-An Chen

most citedOn the chromatic number of almost s-stable Kneser graphs

6 citations · 7 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2017★ 6 cited

On the chromatic number of almost s-stable Kneser graphs

Peng-An Chen

In 2011, Meunier conjectured that for positive integers $n, k, r, s$ with $k \geq 2$ , $r \geq 2$ , and $n \geq max ({r, s}) k$ , the chromatic number of $s$ -stable $r$ -uniform Kneser hy…

cs.DS2008

Algorithms for Locating Constrained Optimal Intervals

Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao

In this work, we obtain the following new results. 1. Given a sequence $D = ((h_{1}, s_{1}), (h_{2}, s_{2}) ..., (h_{n}, s_{n}))$ of number pairs, where $s_{i} > 0$ for all $i$ , and a number $L_{h}$ , we…

cs.DS2008★ 1 cited

Minkowski Sum Selection and Finding

Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen +1

For the \textsc{Minkowski Sum Selection} problem with linear objective functions, we obtain the following results: (1) optimal $O (n lo g n)$ time algorithms for $λ = 1$ ; (2) $O(n\log^…