On Element-Connectivity Preserving Graph Simplification. - Chandra Chekuri; Thapanapong Rukkanchanunt; Chao Xu 002 (ESA, 2015)

Detecting Weakly Simple Polygons. - Hsien-Chih Chang; Jeff Erickson 001; Chao Xu 002 (SODA, 2015)

Reconstructing edge-disjoint paths faster. - Chao Xu 002 (Oper. Res. Lett., 2016)

Global and Fixed-Terminal Cuts in Digraphs. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (APPROX-RANDOM, 2017)

Computing minimum cuts in hypergraphs. - Chandra Chekuri; Chao Xu 002 (SODA, 2017)

A Faster Pseudopolynomial Time Algorithm for Subset Sum. - Konstantinos Koiliaris; Chao Xu 002 (SODA, 2017)

A note on approximate strengths of edges in a hypergraph. - Chandra Chekuri; Chao Xu 002 (CoRR, 2017)

Hypergraph k-Cut in Randomized Polynomial Time. - Karthekeyan Chandrasekaran; Chao Xu 002; Xilin Yu (SODA, 2018)

Subset Sum Made Simple. - Konstantinos Koiliaris; Chao Xu 002 (CoRR, 2018)

The shortest kinship description problem. - Chao Xu 002; Qian Zhang 011 (Inf. Process. Lett., 2018)

Minimum Cuts and Sparsification in Hypergraphs. - Chandra Chekuri; Chao Xu 002 (SIAM J. Comput., 2018)

Cuts and connectivity in graphs and hypergraphs - Chao Xu 002 (2018)

LP Relaxation and Tree Packing for Minimum k-cuts. - Chandra Chekuri; Kent Quanrud; Chao Xu 002 (SOSA, 2019)

Beating the 2-approximation factor for global bicut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (Math. Program., 2019)

Faster Pseudopolynomial Time Algorithms for Subset Sum. - Konstantinos Koiliaris; Chao Xu 002 (ACM Trans. Algorithms, 2019)

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs. - Calvin Beideman; Karthekeyan Chandrasekaran; Chao Xu 002 (CoRR, 2020)

LP Relaxation and Tree Packing for Minimum k-Cut. - Chandra Chekuri; Kent Quanrud; Chao Xu 002 (SIAM J. Discret. Math., 2020)

High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system. - Amir Hossein Gharehgozli 001; Chao Xu 002; Wenda Zhang (Eur. J. Oper. Res., 2021)

Hypergraph k-cut in randomized polynomial time. - Karthekeyan Chandrasekaran; Chao Xu 002; Xilin Yu (Math. Program., 2021)

Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. - Calvin Beideman; Karthekeyan Chandrasekaran; Chandra Chekuri; Chao Xu 002 (FSTTCS, 2022)

Improved Approximation Algorithms for the Traveling Tournament Problem. - Jingyang Zhao 001; Mingyu Xiao 001; Chao Xu 002 (MFCS, 2022)

Linear tree shap. - Peng Yu; Albert Bifet; Jesse Read; Chao Xu 002 (NeurIPS, 2022)

Linear TreeShap. - Peng Yu; Chao Xu 002; Albert Bifet; Jesse Read (CoRR, 2022)

Solving Systems of Linear Equations Through Zero Forcing Set. - Jianbo Wang; Chao Xu 002; Siyun Zhou (COCOON (2), 2023)

1000 FPS HDR Video with a Spike-RGB Hybrid Camera. - Yakun Chang; Chu Zhou; Yuchen Hong; Liwen Hu 002; Chao Xu 002; Tiejun Huang 001; Boxin Shi (CVPR, 2023)

Multicriteria cuts and size-constrained k-cuts in hypergraphs. - Calvin Beideman; Karthekeyan Chandrasekaran; Chao Xu 002 (Math. Program., 2023)

Almost Optimum ℓ-Covering of $ mathbb {Z}_n$. - Ke Shi; Chao Xu 002 (COCOON (1), 2024)

Nested and Interleaved Ticketing for Multiple Travelers. - Dongyu Lv; Yizhi Song; Chao Xu 002 (IJTCS-FAW, 2024)

On the Congruency-Constrained Matroid Base. - Siyue Liu; Chao Xu 002 (IPCO, 2024)

A polynomial time algorithm for finding a minimum 4-partition of a submodular function. - Tsuyoshi Hirayama; Yuhao Liu 003; Kazuhisa Makino; Ke Shi; Chao Xu 002 (Math. Program., 2024)

The traveling tournament problem: Improved algorithms based on cycle packing. - Jingyang Zhao 001; Mingyu Xiao 001; Chao Xu 002 (Theor. Comput. Sci., 2025)