Chao Xu

According to our database, Chao Xu authored at least 29 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A polynomial time algorithm for finding a minimum 4-partition of a submodular function.

Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu

Math. Program., September, 2024

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

Jingyang Zhao, Mingyu Xiao, Chao Xu

CoRR, 2024

On the Congruency-Constrained Matroid Base.

Siyue Liu, Chao Xu

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

Multicriteria cuts and size-constrained k-cuts in hypergraphs.

Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu

Math. Program., January, 2023

1000 FPS HDR Video with a Spike-RGB Hybrid Camera.

Yakun Chang, Chu Zhou, Yuchen Hong, Liwen Hu, Chao Xu, Tiejun Huang, Boxin Shi

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

Solving Systems of Linear Equations Through Zero Forcing Set.

Jianbo Wang, Chao Xu, Siyun Zhou

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Linear TreeShap.

Peng Yu, Chao Xu, Albert Bifet, Jesse Read

CoRR, 2022

Linear tree shap.

Peng Yu, Albert Bifet, Jesse Read, Chao Xu

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.

Jingyang Zhao, Mingyu Xiao, Chao Xu

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions.

Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Hypergraph k-cut in randomized polynomial time.

Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu

Math. Program., 2021

High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system.

Amir Hossein Gharehgozli, Chao Xu, Wenda Zhang

Eur. J. Oper. Res., 2021

2020

LP Relaxation and Tree Packing for Minimum k-Cut.

Chandra Chekuri, Kent Quanrud, Chao Xu

SIAM J. Discret. Math., 2020

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs.

Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu

CoRR, 2020

2019

Faster Pseudopolynomial Time Algorithms for Subset Sum.

Konstantinos Koiliaris, Chao Xu

ACM Trans. Algorithms, 2019

Beating the 2-approximation factor for global bicut.

Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu

Math. Program., 2019

LP Relaxation and Tree Packing for Minimum k-cuts.

Chandra Chekuri, Kent Quanrud, Chao Xu

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

2018

Cuts and connectivity in graphs and hypergraphs

Chao Xu

PhD thesis, 2018

Minimum Cuts and Sparsification in Hypergraphs.

Chandra Chekuri, Chao Xu

SIAM J. Comput., 2018

The shortest kinship description problem.

Chao Xu, Qian Zhang

Inf. Process. Lett., 2018

Subset Sum Made Simple.

Konstantinos Koiliaris, Chao Xu

CoRR, 2018

Hypergraph <i>k</i>-Cut in Randomized Polynomial Time.

Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

A note on approximate strengths of edges in a hypergraph.

Chandra Chekuri, Chao Xu

CoRR, 2017

A Faster Pseudopolynomial Time Algorithm for Subset Sum.

Konstantinos Koiliaris, Chao Xu

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Computing minimum cuts in hypergraphs.

Chandra Chekuri, Chao Xu

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Global and Fixed-Terminal Cuts in Digraphs.

Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu

Proceedings of the Approximation, 2017

2016

Reconstructing edge-disjoint paths faster.

Chao Xu

Oper. Res. Lett., 2016

2015

Detecting Weakly Simple Polygons.

Hsien-Chih Chang, Jeff Erickson, Chao Xu

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On Element-Connectivity Preserving Graph Simplification.

Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu

Proceedings of the Algorithms - ESA 2015, 2015