Jie You

activity

20172021

most citedVertex Deletion Problems on Chordal Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2021

Extremal Problem for Matchings and Rainbow Matchings on Direct Products

Jian Wang, Jie You

Let $n_{1}, \dots, n_{ℓ}, k_{1}, \dots, k_{ℓ}$ be integers and let $V_{1}, \dots, V_{ℓ}$ be disjoint sets with $∣ V_{i} ∣ = n_{i}$ for $i = 1, \dots, ℓ$ . Define $⊔_{i = 1}^{ℓ} (k _{i} V _{i})$ a…

math.CO2018

Local Coloring and its Complexity

Jie You, Yixin Cao, Jianxin Wang

A $k$ -coloring of a graph is an assignment of integers between $1$ and $k$ to vertices in the graph such that the endpoints of each edge receive different numbers. We study a local…

cs.DS2017★ 1 cited

Vertex Deletion Problems on Chordal Graphs

Yixin Cao, Yuping Ke, Yota Otachi +1

Containing many classic optimization problems, the family of vertex deletion problems has an important position in algorithm and complexity study. The celebrated result of Lewis an…