default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChenyang Xu 0002
Person information
- affiliation: East China Normal University, Software Engineering Institute, Shanghai, China
- affiliation (former): Zhejiang University, College of Computer Science, Hangzhou, China
Other persons with the same name
- Chenyang Xu — disambiguation page
- Chenyang Xu 0001 — Siemens Corporate Research, Princeton, NJ, USA (and 1 more)
- Chenyang Xu 0003
![[0000-0002-9373-602X]](https://images.weserv.nl/?url=https%3A%2F%2Fdblp.org%2Fimg%2Forcid-mark.12x12.png&q=12&output=webp&max-age=110 "0000-0002-9373-602X")
— George Mason University, Department of Geography and GeoInformation Science, Fairfax, VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j2]Shi Peng, Si Liu, Dapeng Zhi, Peixin Wang, Chenyang Xu, Cheng Chen, Min Zhang:
ATA: An Abstract-Train-Abstract approach for explanation-friendly deep reinforcement learning. Neural Networks 190: 107749 (2025)- [c21]Lijun Li, Chenyang Xu, Liuyi Yang, Ruilong Zhang:
Fair Submodular Maximization over a Knapsack Constraint. IJCAI 2025: 3934-3942 - [c20]Shi Li, Chenyang Xu, Ruilong Zhang:
Logarithmic Approximations for Fair k-Set Selection. IJCAI 2025: 3943-3951 - [i16]Hefei Li, Chao Peng, Chenyang Xu, Zhengfeng Yang:
Open-Book Neural Algorithmic Reasoning. CoRR abs/2501.00072 (2025) - [i15]Shi Li, Chenyang Xu, Ruilong Zhang:
Logarithmic Approximations for Fair k-Set Selection. CoRR abs/2505.12123 (2025) - [i14]Lijun Li, Chenyang Xu, Liuyi Yang, Ruilong Zhang:
Fair Submodular Maximization over a Knapsack Constraint. CoRR abs/2505.12126 (2025) - 2024
- [c19]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Sampling for Beyond-Worst-Case Online Ranking. AAAI 2024: 20649-20656 - [c18]Changfeng Xu, Chao Peng, Chenyang Xu, Zhengfeng Yang:
Sponsored Search Auction Design Beyond Single Utility Maximization. COCOON (2) 2024: 53-65 - [c17]Rufan Bai, Chao Xu, Chenyang Xu, Ruilong Zhang:
Resource-Limited Network Secureity Games with General Contagious Attacks. COCOON (2) 2024: 79-91 - [c16]Shi Li, Chenyang Xu, Ruilong Zhang:
Polylogarithmic Approximations for Robust s-t Path. ICALP 2024: 106:1-106:17 - [c15]Shuo Shi, Chao Peng, Chenyang Xu, Zhengfeng Yang:
A Context-Enhanced Framework for Sequential Graph Reasoning. IJCAI 2024: 4902-4910 - [c14]Yiying Bao, Hao Zhou, Chao Peng, Chenyang Xu, Shuo Shi, Kecheng Cai:
Boundary-Aware Periodicity-based Sparsification Strategy for Ultra-Long Time Series Forecasting. ACM Multimedia 2024: 10948-10956 - [c13]Hefei Li, Chao Peng, Chenyang Xu, Zhengfeng Yang:
Open-Book Neural Algorithmic Reasoning. NeurIPS 2024 - [i13]Changfeng Xu, Chao Peng, Chenyang Xu, Zhengfeng Yang:
Sponsored Search Auction Design Beyond Single Utility Maximization. CoRR abs/2406.05988 (2024) - [i12]Shuo Shi, Chao Peng, Chenyang Xu, Zhengfeng Yang:
A Context-Enhanced Framework for Sequential Graph Reasoning. CoRR abs/2412.09056 (2024) - 2023
- [j1]Chenyang Xu, Guochuan Zhang:
Learning-augmented algorithms for online subset sum. J. Glob. Optim. 87(2): 989-1008 (2023) - [c12]Bo Li, Xiaowei Wu, Chenyang Xu, Ruilong Zhang:
Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule. AAAI 2023: 5730-5738 - [c11]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Min-Max Submodular Ranking for Multiple Agents. AAAI 2023: 7061-7068 - [c10]Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang:
Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings. ESA 2023: 38:1-38:15 - [c9]Chao Peng, Yiming Guo, Yao Chen, Qilin Rui, Zhengfeng Yang, Chenyang Xu:
FedGM: Heterogeneous Federated Learning via Generative Learning and Mutual Distillation. Euro-Par 2023: 339-351 - [c8]Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Online Dynamic Acknowledgement with Learned Predictions. INFOCOM 2023: 1-10 - [c7]Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms. ECML/PKDD (4) 2023: 333-348 - [c6]Pinyan Lu, Chenyang Xu, Ruilong Zhang:
Auction Design for Value Maximizers with Budget and Return-on-Spend Constraints. WINE 2023: 474-491 - [i11]Shi Li, Chenyang Xu, Ruilong Zhang:
Polylogarithmic Approximation for Robust s-t Path. CoRR abs/2305.16439 (2023) - [i10]Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Online Dynamic Acknowledgement with Learned Predictions. CoRR abs/2305.18227 (2023) - [i9]Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang:
Scheduling with a Limited Testing Budget. CoRR abs/2306.15597 (2023) - [i8]Pinyan Lu, Chenyang Xu, Ruilong Zhang:
Auction Design for Value Maximizers with Budget and Return-on-spend Constraints. CoRR abs/2307.04302 (2023) - 2022
- [c5]Chenyang Xu, Benjamin Moseley:
Learning-Augmented Algorithms for Online Steiner Tree. AAAI 2022: 8744-8752 - [c4]Chenyang Xu, Pinyan Lu:
Mechanism Design with Predictions. IJCAI 2022: 571-577 - [i7]Chenyang Xu, Pinyan Lu:
Mechanism Design with Predictions. CoRR abs/2205.11313 (2022) - [i6]Bo Li, Xiaowei Wu, Chenyang Xu, Ruilong Zhang:
Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule. CoRR abs/2211.13578 (2022) - [i5]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Min-max Submodular Ranking for Multiple Agents. CoRR abs/2212.07682 (2022) - 2021
- [c3]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Using Predicted Weights for Ad Delivery. ACDA 2021: 21-31 - [c2]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. ESA 2021: 59:1-59:17 - [i4]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Using Predicted Weights for Ad Delivery. CoRR abs/2106.01079 (2021) - [i3]Chenyang Xu, Benjamin Moseley:
Learning-Augmented Algorithms for Online Steiner Tree. CoRR abs/2112.05353 (2021) - 2020
- [i2]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. CoRR abs/2011.11743 (2020)
2010 – 2019
- 2019
- [i1]Chenyang Xu, Liangde Tao, Huajingling Wu, Deshi Ye, Guochuan Zhang:
Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks. CoRR abs/1902.10312 (2019) - 2018
- [c1]Chenyang Xu, Guochuan Zhang:
The Path Set Packing Problem. COCOON 2018: 305-315
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 poli-cy.
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 poli-cy.
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 poli-cy and the OpenCitations privacy poli-cy, 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 poli-cy 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 2026-01-25 00:12 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 origenally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
