Chao Xu - RankMe

45 papers A* 8A 2B 3Journal 24Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Binary Split Categorical Feature with Mean Absolute Error Criteria in CART. AAAI Peng Yu, Yike Chen, Chao Xu, Albert Bifet, Jesse Read
2025	B	`conf`	An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies. ISAAC Yike Chen, Ke Shi, Chao Xu
2025	J	`jnl`	Binary Split Categorical feature with Mean Absolute Error Criteria in CART. CoRR Peng Yu, Yike Chen, Chao Xu, Albert Bifet, Jesse Read
2025	A	`conf`	Efficient Branch-and-Bound for Submodular Function Maximization Under Knapsack Constraint. ECAI Yimin Hao, Yi Zhou, Chao Xu, Zhang-Hua Fu
2025	J	`jnl`	Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint. CoRR Yimin Hao, Yi Zhou, Chao Xu, Zhang-Hua Fu
2025	J	`jnl`	The traveling tournament problem: Improved algorithms based on cycle packing. Theor. Comput. Sci. Jingyang Zhao, Mingyu Xiao, Chao Xu
2024	J	`jnl`	A polynomial time algorithm for finding a minimum 4-partition of a submodular function. Math. Program. Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu
2024	—	`conf`	Almost Optimum ℓ-Covering of $\mathbb {Z}_n$. COCOON (1) Ke Shi, Chao Xu
2024	J	`jnl`	An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies. CoRR Yike Chen, Ke Shi, Chao Xu
2024	—	`conf`	Nested and Interleaved Ticketing for Multiple Travelers. IJTCS-FAW Dongyu Lv, Yizhi Song, Chao Xu
2024	B	`conf`	On the Congruency-Constrained Matroid Base. IPCO Siyue Liu, Chao Xu
2024	J	`jnl`	The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing. CoRR Jingyang Zhao, Mingyu Xiao, Chao Xu
2023	A*	`conf`	1000 FPS HDR Video with a Spike-RGB Hybrid Camera. CVPR Yakun Chang, Chu Zhou, Yuchen Hong, Liwen Hu, Chao Xu, Tiejun Huang, Boxin Shi
2023	A*	`conf`	A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function. SODA Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu
2023	J	`jnl`	Multicriteria cuts and size-constrained k-cuts in hypergraphs. Math. Program. Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
2023	—	`conf`	Solving Systems of Linear Equations Through Zero Forcing Set. COCOON (2) Jianbo Wang, Chao Xu, Siyun Zhou
2022	—	`conf`	Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu
2022	B	`conf`	Improved Approximation Algorithms for the Traveling Tournament Problem. MFCS Jingyang Zhao, Mingyu Xiao, Chao Xu
2022	J	`jnl`	Linear TreeShap. CoRR Peng Yu, Chao Xu, Albert Bifet, Jesse Read
2022	A*	`conf`	Linear tree shap. NeurIPS Peng Yu, Albert Bifet, Jesse Read, Chao Xu
2021	J	`jnl`	High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system. Eur. J. Oper. Res. Amir Hossein Gharehgozli, Chao Xu, Wenda Zhang
2021	J	`jnl`	Hypergraph k-cut in randomized polynomial time. Math. Program. Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu
2020	J	`jnl`	LP Relaxation and Tree Packing for Minimum k-Cut. SIAM J. Discret. Math. Chandra Chekuri, Kent Quanrud, Chao Xu
2020	J	`jnl`	Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs. CoRR Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
2020	—	`conf`	Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. APPROX-RANDOM Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu
2019	J	`jnl`	Beating the 2-approximation factor for global bicut. Math. Program. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2019	J	`jnl`	Faster Pseudopolynomial Time Algorithms for Subset Sum. ACM Trans. Algorithms Konstantinos Koiliaris, Chao Xu
2019	—	`conf`	LP Relaxation and Tree Packing for Minimum k-cuts. SOSA Chandra Chekuri, Kent Quanrud, Chao Xu
2018	—	`—`	Cuts and connectivity in graphs and hypergraphs Chao Xu
2018	A*	`conf`	Hypergraph SODA Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu
2018	J	`jnl`	LP Relaxation and Tree Packing for Minimum k-cuts. CoRR Chandra Chekuri, Kent Quanrud, Chao Xu
2018	J	`jnl`	Minimum Cuts and Sparsification in Hypergraphs. SIAM J. Comput. Chandra Chekuri, Chao Xu
2018	J	`jnl`	Subset Sum Made Simple. CoRR Konstantinos Koiliaris, Chao Xu
2018	J	`jnl`	The shortest kinship description problem. Inf. Process. Lett. Chao Xu, Qian Zhang
2017	A*	`conf`	A Faster Pseudopolynomial Time Algorithm for Subset Sum. SODA Konstantinos Koiliaris, Chao Xu
2017	J	`jnl`	A note on approximate strengths of edges in a hypergraph. CoRR Chandra Chekuri, Chao Xu
2017	A*	`conf`	Computing minimum cuts in hypergraphs. SODA Chandra Chekuri, Chao Xu
2017	—	`conf`	Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2016	J	`jnl`	Computing minimum cuts in hypergraphs. CoRR Chandra Chekuri, Chao Xu
2016	J	`jnl`	Global and fixed-terminal cuts in digraphs. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2016	J	`jnl`	Reconstructing edge-disjoint paths faster. Oper. Res. Lett. Chao Xu
2015	J	`jnl`	A Faster Pseudopolynomial Time Algorithm for Subset Sum. CoRR Konstantinos Koiliaris, Chao Xu
2015	A*	`conf`	Detecting Weakly Simple Polygons. SODA Hsien-Chih Chang, Jeff Erickson, Chao Xu
2015	A	`conf`	On Element-Connectivity Preserving Graph Simplification. ESA Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu
2014	J	`jnl`	Detecting Weakly Simple Polygons. CoRR Hsien-Chih Chang, Jeff Erickson, Chao Xu