Chao Xu

activity

20142026

most citedDetecting Weakly Simple Polygons

24 citations · 38 across the 14 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Sharp Bounds on the Number of Small Cuts

Chao Xu, Mingdong Yang

Let $λ$ be the minimum cut value of an $n$ -vertex undirected multigraph. For every fixed $α > 1$ , we prove that there are $O (n^{⌈ 2 α ⌉ - 1})$ cuts of size strictly below $α λ$ .…

cs.DS2026

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning

Chao Xu, Mingdong Yang

Cardinality-constrained diameter partitioning asks for a partition of $n$ items into two classes of prescribed sizes that minimizes the larger of the two class diameters. We give a…