引用次数
引用: 497
H-指数: 11
I10-指数 : 11
出版物: 34
Detecting weakly simple polygons
Hsien-Chih Chang , Chao Xu , Jeff Erickson
symposium on discrete algorithms 1655 -1670
25
2015
Computing minimum cuts in hypergraphs
Chandra Chekuri , Chao Xu
symposium on discrete algorithms 1085 -1100
15
2017
A faster pseudopolynomial time algorithm for subset sum
Chao Xu , Konstantinos Koiliaris
symposium on discrete algorithms 1062 -1072
37
2017
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.
Chao Xu , Karthekeyan Chandrasekaran , Calvin Beideman
international workshop and international workshop on approximation, randomization, and combinatorial optimization. algorithms and techniques 21
2020
Extended Defects in CdZnTe Radiation Detectors
Aleksey E. Bolotnikov , Stephen O. Babalola , Giuseppe S. Camarda , Henry Chen
IEEE Transactions on Nuclear Science 56 ( 4) 1775 -1783
45
2009
Minimum Cuts and Sparsification in Hypergraphs
Chandra Chekuri , Chao Xu
SIAM Journal on Computing 47 ( 6) 2118 -2156
9
2018
High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
Amir Gharehgozli , Chao Xu , Wenda Zhang
European Journal of Operational Research 289 ( 2) 495 -507
3
2021
Reconstructing edge-disjoint paths faster
Chao Xu
Operations Research Letters 44 ( 2) 174 -176
2016
Hypergraph k-cut in randomized polynomial time
Karthekeyan Chandrasekara , Chao Xu , Xilin Yu
symposium on discrete algorithms 1426 -1438
15
2018
The shortest kinship description problem
Chao Xu , Qian Zhang
Information Processing Letters 138 61 -66
2018
Faster Pseudopolynomial Time Algorithms for Subset Sum
Konstantinos Koiliaris , Chao Xu
ACM Transactions on Algorithms 15 ( 3) 1 -20
7
2019
Beating the 2-approximation factor for global bicut
Kristóf Bérczi , Karthekeyan Chandrasekaran , Tamás Király , Euiwoong Lee
Mathematical Programming 177 ( 1) 291 -320
2019
Hypergraph k -cut in randomized polynomial time
Karthekeyan Chandrasekaran , Chao Xu , Xilin Yu
Mathematical Programming 186 ( 1) 85 -113
1
2021
Minimum Violation Vertex Maps and Their Applications to Cut Problems
Ken-ichi Kawarabayashi , Chao Xu
SIAM Journal on Discrete Mathematics 34 ( 4) 2183 -2207
2020
Lp relaxation and tree packing for minimum k-CUT
Chandra Chekuri , Kent Quanrud , Chao Xu
SIAM Journal on Discrete Mathematics 34 ( 2) 1334 -1353
3
2020
A polynomial time algorithm for finding a minimum 4-partition of a submodular function
Tsuyoshi Hirayama , Yuhao Liu , Kazuhisa Makino , Ke Shi
Smpte Journal 1680 -1691
2023
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions
Calvin Beideman , Karthekeyan Chandrasekaran , Chandra Chekuri , Chao Xu
Smpte Journal
2022
On the computational complexity of the probabilistic label tree algorithms
Róbert Busa-Fekete , Krzysztof Dembczynski , Alexander Golovnev , Kalina Jasinska
arXiv preprint arXiv:1906.00294
4
2019
Linear treeshap
Peng Yu , Chao Xu , Albert Bifet , Jesse Read
arXiv preprint arXiv:2209.08192
3
2022
Global and fixed-terminal cuts in digraphs
Kristóf Bérczi , Karthekeyan Chandrasekaran , Tamás Király , Euiwoong Lee
arXiv preprint arXiv:1612.00156
8
2016