default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChao Xu 0002
Person information
- unicode name: 许超
- affiliation: University of Electronic Science and Technology of China, Chengdu, China
- affiliation (former): Yahoo! Research, New York, USA
- affiliation (former): University of Illinois at Urbana-Champaign, IL, USA
Other persons with the same name
- Chao Xu — disambiguation page
- Chao Xu 0001
![[0000-0002-2759-6364]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-2759-6364")
— Zhejiang University, College of Control Science and Engineering, Hangzhou, China - Chao Xu 0003 — Tianjin University, School of Computer Software, China
- Chao Xu 0004 — New Jersey Institute of Technology, USA
- Chao Xu 0005 — University of Southampton, UK
- Chao Xu 0006 — Peking University, Key Laboratory of Machine Perception, Beijing, China
- Chao Xu 0007 — Northwest A&F University, School of Information Engineering, Yangling, China (and 1 more)
- Chao Xu 0008 — National University of Defense Technology, Changsha
- Chao Xu 0009 — Amazon (and 1 more)
- Chao Xu 0010 — Central South University, Changsha
- Chao Xu 0011 — Xuzhou College of Industrial Technology
- Chao Xu 0012 — Rice University
- Chao Xu 0013 — Northwestern Polytechnical University, School of Astronautics, Xi'an, China
- Chao Xu 0014 — Tulane University, New Orleans, LA, USA
- Chao Xu 0015 — Tsinghua University, Institute for Network Sciences and Cyberspace, BNRist, Beijing, China
- Chao Xu 0016 — University of California, Los Angeles, UCLA, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu:
A polynomial time algorithm for finding a minimum 4-partition of a submodular function. Math. Program. 207(1): 717-732 (2024)- [c15]Siyue Liu, Chao Xu:
On the Congruency-Constrained Matroid Base. IPCO 2024: 280-293 - [i10]Jingyang Zhao, Mingyu Xiao, Chao Xu:
The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing. CoRR abs/2404.10955 (2024) - 2023
- [j9]Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu:
Multicriteria cuts and size-constrained k-cuts in hypergraphs. Math. Program. 197(1): 27-69 (2023) - [c14]Jianbo Wang, Chao Xu, Siyun Zhou:
Solving Systems of Linear Equations Through Zero Forcing Set. COCOON (2) 2023: 353-365 - [c13]Yakun Chang, Chu Zhou, Yuchen Hong, Liwen Hu, Chao Xu, Tiejun Huang, Boxin Shi:
1000 FPS HDR Video with a Spike-RGB Hybrid Camera. CVPR 2023: 22180-22190 - [c12]Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu:
A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function. SODA 2023: 1680-1691 - 2022
- [c11]Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu:
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS 2022: 6:1-6:18 - [c10]Jingyang Zhao, Mingyu Xiao, Chao Xu:
Improved Approximation Algorithms for the Traveling Tournament Problem. MFCS 2022: 83:1-83:15 - [c9]Peng Yu, Albert Bifet, Jesse Read, Chao Xu:
Linear tree shap. NeurIPS 2022 - [i9]Peng Yu, Chao Xu, Albert Bifet, Jesse Read:
Linear TreeShap. CoRR abs/2209.08192 (2022) - 2021
- [j8]Amir Hossein Gharehgozli, Chao Xu, Wenda Zhang:
High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system. Eur. J. Oper. Res. 289(2): 495-507 (2021) - [j7]Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu:
Hypergraph k-cut in randomized polynomial time. Math. Program. 186(1): 85-113 (2021) - 2020
- [j6]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-Cut. SIAM J. Discret. Math. 34(2): 1334-1353 (2020) - [c8]Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu:
Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. APPROX-RANDOM 2020: 17:1-17:21 - [i8]Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu:
Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs. CoRR abs/2006.11589 (2020)
2010 – 2019
- 2019
- [j5]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Beating the 2-approximation factor for global bicut. Math. Program. 177(1-2): 291-320 (2019) - [j4]Konstantinos Koiliaris, Chao Xu:
Faster Pseudopolynomial Time Algorithms for Subset Sum. ACM Trans. Algorithms 15(3): 40:1-40:20 (2019) - [c7]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-cuts. SOSA 2019: 7:1-7:18 - 2018
- [b1]Chao Xu:
Cuts and connectivity in graphs and hypergraphs. University of Illinois Urbana-Champaign, USA, 2018 - [j3]Chao Xu, Qian Zhang:
The shortest kinship description problem. Inf. Process. Lett. 138: 61-66 (2018) - [j2]Chandra Chekuri, Chao Xu:
Minimum Cuts and Sparsification in Hypergraphs. SIAM J. Comput. 47(6): 2118-2156 (2018) - [c6]Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu:
Hypergraph k-Cut in Randomized Polynomial Time. SODA 2018: 1426-1438 - [i7]Konstantinos Koiliaris, Chao Xu:
Subset Sum Made Simple. CoRR abs/1807.08248 (2018) - [i6]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-cuts. CoRR abs/1808.05765 (2018) - 2017
- [c5]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM 2017: 2:1-2:20 - [c4]Konstantinos Koiliaris, Chao Xu:
A Faster Pseudopolynomial Time Algorithm for Subset Sum. SODA 2017: 1062-1072 - [c3]Chandra Chekuri, Chao Xu:
Computing minimum cuts in hypergraphs. SODA 2017: 1085-1100 - [i5]Chandra Chekuri, Chao Xu:
A note on approximate strengths of edges in a hypergraph. CoRR abs/1703.03849 (2017) - 2016
- [j1]Chao Xu:
Reconstructing edge-disjoint paths faster. Oper. Res. Lett. 44(2): 174-176 (2016) - [i4]Chandra Chekuri, Chao Xu:
Computing minimum cuts in hypergraphs. CoRR abs/1607.08682 (2016) - [i3]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and fixed-terminal cuts in digraphs. CoRR abs/1612.00156 (2016) - 2015
- [c2]Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu:
On Element-Connectivity Preserving Graph Simplification. ESA 2015: 313-324 - [c1]Hsien-Chih Chang, Jeff Erickson, Chao Xu:
Detecting Weakly Simple Polygons. SODA 2015: 1655-1670 - [i2]Konstantinos Koiliaris, Chao Xu:
A Faster Pseudopolynomial Time Algorithm for Subset Sum. CoRR abs/1507.02318 (2015) - 2014
- [i1]Hsien-Chih Chang, Jeff Erickson, Chao Xu:
Detecting Weakly Simple Polygons. CoRR abs/1407.3340 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-03 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
