Chao Xu
Title
Cited by
Cited by
Year
Faster pseudopolynomial time algorithms for subset sum
K Koiliaris, C Xu
ACM Transactions on Algorithms (TALG) 15 (3), 1-20, 2019
772019
A Faster Pseudopolynomial Time Algorithm for Subset Sum
K Koiliaris, C Xu
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
772017
Extended defects in CdZnTe radiation detectors
AE Bolotnikov, SO Babalola, GS Camarda, H Chen, S Awadalla, Y Cui, ...
IEEE Transactions on Nuclear Science 56 (4), 1775-1783, 2009
602009
Detecting Weakly Simple Polygons
HC Chang, J Erickson, C Xu
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2015
362015
Computing minimum cuts in hypergraphs
C Chekuri, C Xu
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
242017
Hypergraph k-cut in randomized polynomial time
K Chandrasekaran, C Xu, X Yu
Mathematical Programming, 1-29, 2019
202019
Hypergraph k-cut in randomized polynomial time
K Chandrasekaran, C Xu, X Yu
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
202018
LP Relaxation and Tree Packing for Minimum -Cut
C Chekuri, K Quanrud, C Xu
SIAM Journal on Discrete Mathematics 34 (2), 1334-1353, 2020
152020
LP Relaxation and Tree Packing for Minimum k-Cut
C Chekuri, K Quanrud, C Xu
2nd Symposium on Simplicity in Algorithms (SOSA 2019) 69, 7:1--7:18, 2019
152019
Global and fixed-terminal cuts in digraphs
K Bérczi, K Chandrasekaran, T Király, E Lee, C Xu
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017
92017
Minimum Cuts and Sparsification in Hypergraphs
C Chekuri, C Xu
SIAM Journal on Computing 47 (6), 2118-2156, 2018
82018
On Element-Connectivity Preserving Graph Simplification
C Chekuri, T Rukkanchanunt, C Xu
Algorithms–ESA 2015, 313-324, 2015
82015
Subset Sum Made Simple
K Koiliaris, C Xu
arXiv preprint arXiv:1807.08248, 2018
52018
High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
A Gharehgozli, C Xu, W Zhang
European Journal of Operational Research 289 (2), 495-507, 2021
32021
On the computational complexity of the probabilistic label tree algorithms
R Busa-Fekete, K Dembczynski, A Golovnev, K Jasinska, M Kuznetsov, ...
arXiv preprint arXiv:1906.00294, 2019
32019
Minimum Violation Vertex Maps and Their Applications to Cut Problems
K Kawarabayashi, C Xu
SIAM Journal on Discrete Mathematics 34 (4), 2183-2207, 2020
22020
Beating the 2-approximation factor for Global Bicut
K Bérczi, K Chandrasekaran, T Király, E Lee, C Xu
Mathematical Programming 177 (1-2), 291-320, 2019
12019
Cuts and connectivity in graphs and hypergraphs
C Xu
University of Illinois at Urbana-Champaign, 2018
12018
A note on approximate strengths of edges in a hypergraph
C Chekuri, C Xu
arXiv preprint arXiv:1703.03849, 2017
12017
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs
C Beideman, K Chandrasekaran, C Xu
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20