


default search action
Chengzhi Piao
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j5]Chengzhi Piao
, Eunsam Kim
, Choonhwa Lee
:
Optimizing Cloud Service Efficiency With Infrastructure-Aware Scheduling. IEEE Access 14: 24686-24699 (2026)
[i3]Tian Bian, Yifan Niu, Chaohao Yuan, Chengzhi Piao, Bingzhe Wu, Long-Kai Huang, Yu Rong, Tingyang Xu, Hong Cheng, Jia Li:
IBCircuit: Towards Holistic Circuit Discovery with Information Bottleneck. CoRR abs/2602.22581 (2026)- 2025
[j4]Zijin Feng
, Miao Qiao
, Chengzhi Piao
, Hong Cheng
:
On Graph Representation for Attributed Hypergraph Clustering. Proc. ACM Manag. Data 3(1): 59:1-59:26 (2025)
[j3]Jie Tan
, Kangfei Zhao
, Rui Li
, Jeffrey Xu Yu
, Chengzhi Piao
, Hong Cheng
, Helen Meng
, Deli Zhao
, Yu Rong
:
Can Large Language Models Be Query Optimizer for Relational Databases? Proc. ACM Manag. Data 3(6): 1-28 (2025)
[c5]Tian Bian, Yifan Niu, Chaohao Yuan, Chengzhi Piao, Bingzhe Wu, Long-Kai Huang, Yu Rong, Tingyang Xu, Hong Cheng, Jia Li:
IBCircuit: Towards Holistic Circuit Discovery with Information Bottleneck. ICML 2025
[c4]Hengyu Zhang
, Chunxu Shen
, Xiangguo Sun
, Jie Tan
, Yu Rong
, Chengzhi Piao
, Hong Cheng
, Lingling Yi
:
Adaptive Graph Integration for Cross-Domain Recommendation via Heterogeneous Graph Coordinators. SIGIR 2025: 1860-1869
[i2]Jie Tan, Kangfei Zhao, Rui Li, Jeffrey Xu Yu, Chengzhi Piao, Hong Cheng, Helen Meng, Deli Zhao, Yu Rong
:
Can Large Language Models Be Query Optimizer for Relational Databases? CoRR abs/2502.05562 (2025)- 2024
[c3]Zitan Sun, Xin Huang
, Chengzhi Piao
, Cheng Long, Jianliang Xu:
Adaptive Truss Maximization on Large Graphs: A Minimum Cut Approach. ICDE 2024: 3270-3282
[i1]Hengyu Zhang, Chunxu Shen, Xiangguo Sun
, Jie Tan, Yu Rong
, Chengzhi Piao, Hong Cheng, Lingling Yi:
Adaptive Coordinators and Prompts on Heterogeneous Graphs for Cross-Domain Recommendations. CoRR abs/2410.11719 (2024)- 2023
[j2]Chengzhi Piao
, Tingyang Xu
, Xiangguo Sun
, Yu Rong
, Kangfei Zhao, Hong Cheng:
Computing Graph Edit Distance via Neural Graph Matching. Proc. VLDB Endow. 16(8): 1817-1829 (2023)- 2021
[c2]Weiguo Zheng, Yifan Yang, Chengzhi Piao
:
Accelerating Set Intersections over Graphs by Reducing-Merging. KDD 2021: 2349-2359- 2020
[j1]Chengzhi Piao, Weiguo Zheng, Yu Rong, Hong Cheng:
Maximizing the Reduction Ability for Near-maximum Independent Set Computation. Proc. VLDB Endow. 13(11): 2466-2478 (2020)
2010 – 2019
- 2019
[c1]Weiguo Zheng, Chengzhi Piao
, Hong Cheng, Jeffrey Xu Yu:
Computing a Near-Maximum Independent Set in Dynamic Graphs. ICDE 2019: 76-87
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 2026-04-09 00:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID







