Chao Xu

Orcid: 0000-0003-4417-3299

  • University of Electronic Science and Technology of China, Chengdu, China
  • Yahoo! Research, New York, USA (former)
  • University of Illinois at Urbana-Champaign, IL, USA (former)

According to our database1, Chao Xu authored at least 28 papers between 2015 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing.
CoRR, 2024

On the Congruency-Constrained Matroid Base.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

Multicriteria cuts and size-constrained k-cuts in hypergraphs.
Math. Program., January, 2023

A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

1000 FPS HDR Video with a Spike-RGB Hybrid Camera.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

Solving Systems of Linear Equations Through Zero Forcing Set.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Linear tree shap.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Improved Approximation Algorithms for the Traveling Tournament Problem.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Hypergraph k-cut in randomized polynomial time.
Math. Program., 2021

High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system.
Eur. J. Oper. Res., 2021

LP Relaxation and Tree Packing for Minimum k-Cut.
SIAM J. Discret. Math., 2020

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs.
CoRR, 2020

Faster Pseudopolynomial Time Algorithms for Subset Sum.
ACM Trans. Algorithms, 2019

Beating the 2-approximation factor for global bicut.
Math. Program., 2019

LP Relaxation and Tree Packing for Minimum k-cuts.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Cuts and connectivity in graphs and hypergraphs
PhD thesis, 2018

Minimum Cuts and Sparsification in Hypergraphs.
SIAM J. Comput., 2018

The shortest kinship description problem.
Inf. Process. Lett., 2018

Subset Sum Made Simple.
CoRR, 2018

Hypergraph <i>k</i>-Cut in Randomized Polynomial Time.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A note on approximate strengths of edges in a hypergraph.
CoRR, 2017

A Faster Pseudopolynomial Time Algorithm for Subset Sum.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Computing minimum cuts in hypergraphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Global and Fixed-Terminal Cuts in Digraphs.
Proceedings of the Approximation, 2017

Reconstructing edge-disjoint paths faster.
Oper. Res. Lett., 2016

Detecting Weakly Simple Polygons.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On Element-Connectivity Preserving Graph Simplification.
Proceedings of the Algorithms - ESA 2015, 2015