Faster pseudopolynomial time algorithms for subset sum K Koiliaris, C Xu ACM Transactions on Algorithms (TALG) 15 (3), 1-20, 2019 | 139 | 2019 |
A Faster Pseudopolynomial Time Algorithm for Subset Sum K Koiliaris, C Xu Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 139 | 2017 |
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 | 79 | 2009 |
Detecting Weakly Simple Polygons HC Chang, J Erickson, C Xu Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2015 | 57 | 2015 |
Hypergraph k-cut in randomized polynomial time K Chandrasekaran, C Xu, X Yu Mathematical Programming 186, 85-113, 2021 | 43 | 2021 |
LP Relaxation and Tree Packing for Minimum -Cut C Chekuri, K Quanrud, C Xu SIAM Journal on Discrete Mathematics 34 (2), 1334-1353, 2020 | 35 | 2020 |
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 | 35 | 2019 |
Minimum Cuts and Sparsification in Hypergraphs C Chekuri, C Xu SIAM Journal on Computing 47 (6), 2118-2156, 2018 | 34 | 2018 |
Computing minimum cuts in hypergraphs C Chekuri, C Xu Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 34 | 2017 |
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 | 18 | 2021 |
On element-connectivity preserving graph simplification C Chekuri, T Rukkanchanunt, C Xu Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 16 | 2015 |
Improved Approximation Algorithms for the Traveling Tournament Problem J Zhao, M Xiao, C Xu 47th International Symposium on Mathematical Foundations of Computer Science …, 2022 | 11 | 2022 |
Subset Sum Made Simple K Koiliaris, C Xu arXiv preprint arXiv:1807.08248, 2018 | 11 | 2018 |
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 | 8 | 2017 |
Linear tree shap A Bifet, J Read, C Xu Advances in Neural Information Processing Systems 35, 25818-25828, 2022 | 5 | 2022 |
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 | 4 | 2019 |
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs C Beideman, K Chandrasekaran, C Xu Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 3 | 2020 |
On the Congruency-Constrained Matroid Base S Liu, C Xu International Conference on Integer Programming and Combinatorial …, 2024 | 2 | 2024 |
A polynomial time algorithm for finding a minimum 4-partition of a submodular function T Hirayama, Y Liu, K Makino, K Shi, C Xu Mathematical Programming, 1-16, 2023 | 2 | 2023 |
Minimum Violation Vertex Maps and Their Applications to Cut Problems K Kawarabayashi, C Xu SIAM Journal on Discrete Mathematics 34 (4), 2183-2207, 2020 | 2 | 2020 |