Jie You

activity

20152026

most citedApproximate Association via Dissociation

15 citations · 17 across the 6 of their papers we have counts for

collaborators

7 papers

cs.CE2026

Product Costing in Data Pipelines

Li Peng, Jie You, Feng Shi +10

Large data-intensive enterprises spend millions of dollars monthly running data pipelines. Apportioning this cost back to individual products, known as product costing, is a prereq…

math.CO2023

Minimum $ℓ$ -degree thresholds for rainbow perfect matching in $k$ -uniform hypergraphs

Jie You

Given $n \in k N$ elements set $V$ and $k$ -uniform hypergraphs $H_{1}, \dots, H_{n / k}$ on $V$ . A rainbow perfect matching is a collection of pairwise disjoi…

math.CO2023

Minimum degree thresholds for Hamilton $(ℓ, k - ℓ)$ -cycles in $k$ -uniform hypergraphs

Jian Wang, Jie You

Let $n > k > ℓ$ be positive integers. We say a $k$ -uniform hypergraph $H$ contains a Hamilton $(ℓ, k - ℓ)$ -cycle if there is a partition $(L_0,R_0,L_1,R_1,\ldots,L_{t-1…

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★ 1 cited

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…

cs.DS2015★ 15 cited

Approximate Association via Dissociation

Jie You, Jianxin Wang, Yixin Cao

A vertex set $X$ of a graph $G$ is an association set if each component of $G - X$ is a clique, or a dissociation set if each component of $G - X$ is a single vertex or a single ed…