default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZi Chen 0003
Person information
- affiliation: Nanjing University of Aeronautics and Astronautics, College of Computer Science and Technology, China
- affiliation (PhD 2021): East China Normal University, Software Engineering Institute, Shanghai, China
Other persons with the same name
- Zi Chen 0001
![[0000-0001-5100-8393]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-5100-8393")
— University of New South Wales, Sydney, Australia - Zi Chen 0002 — Dartmouth College, Thayer School of Engineering, Hanover, NH, USA
- Zi Chen 0004 — Wuhan Pulmonary Hospital, Department of Tuberculosis Prevention, China
- Zi Chen 0005 — Chang'an University, School of Geology Engineering and Geomatics, Xi'an, China
- Zi Chen 0006 — Brigham & Women's Hospital, Harvard Medical School, Boston, MA, USA
- Zi Chen 0007 — China Geological Survey, Nanjing, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Long Yuan, Xia Li, Zi Chen, Xuemin Lin, Xiang Zhao, Wenjie Zhang:
I/O Efficient Label-Constrained Reachability Queries in Large Graphs. Proc. VLDB Endow. 17(10): 2590-2602 (2024)- [j6]Yuwen Qian, Guodong Huang, Chuan Ma, Ming Ding, Long Yuan, Zi Chen, Kai Wang:
Enhancing Resilience in Website Fingerprinting: Novel Adversary Strategies for Noisy Traffic Environments. IEEE Trans. Inf. Forensics Secur. 19: 7216-7231 (2024) - [c10]Haofei Sui, Long Yuan, Zi Chen:
Towards Efficient Heuristic Graph Edge Coloring. APWeb/WAIM (3) 2024: 360-375 - [c9]Zi Chen, Long Yuan, Li Han, Zhengping Qian:
Higher-Order Truss Decomposition in Graphs (Extended Abstract). ICDE 2024: 5695-5696 - [c8]Yiwei Zhao, Zi Chen, Chen Chen, Xiaoyang Wang, Xuemin Lin, Wenjie Zhang:
Finding the Maximum k- Balanced Biclique on Weighted Bipartite Graphs (Extended abstract). ICDE 2024: 5697-5698 - [i5]Yiqi Wang, Long Yuan, Wenjie Zhang, Xuemin Lin, Zi Chen, Qing Liu:
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks. CoRR abs/2408.05432 (2024) - 2023
- [j5]Zi Chen, Bo Feng, Long Yuan, Xuemin Lin, Liping Wang:
Fully Dynamic Contraction Hierarchies with Label Restrictions on Road Networks. Data Sci. Eng. 8(3): 263-278 (2023) - [j4]Zongyu Xu, Yihao Zhang, Long Yuan, Yuwen Qian, Zi Chen, Mingliang Zhou, Qin Mao, Weibin Pan:
Effective Community Search on Large Attributed Bipartite Graphs. Int. J. Pattern Recognit. Artif. Intell. 37(2): 2359002:1-2359002:25 (2023) - [j3]Zi Chen, Long Yuan, Li Han, Zhengping Qian:
Higher-Order Truss Decomposition in Graphs. IEEE Trans. Knowl. Data Eng. 35(4): 3966-3978 (2023) - [j2]Yiwei Zhao, Zi Chen, Chen Chen, Xiaoyang Wang, Xuemin Lin, Wenjie Zhang:
Finding the Maximum $k$-Balanced Biclique on Weighted Bipartite Graphs. IEEE Trans. Knowl. Data Eng. 35(8): 7994-8007 (2023) - [j1]Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang:
Balanced Clique Computation in Signed Networks: Concepts and Algorithms. IEEE Trans. Knowl. Data Eng. 35(11): 11079-11092 (2023) - [c7]Zhepeng Huang, Long Yuan, Haofei Sui, Zi Chen, Shiyu Yang, Jianye Yang:
Edge Coloring on Dynamic Graphs. DASFAA (3) 2023: 137-153 - [c6]Bo Feng, Zi Chen, Long Yuan, Xuemin Lin, Liping Wang:
Contraction Hierarchies with Label Restrictions Maintenance in Dynamic Road Networks. DASFAA (3) 2023: 269-285 - [c5]Yiqi Wang, Long Yuan, Zi Chen, Wenjie Zhang, Xuemin Lin, Qing Liu:
Towards Efficient Shortest Path Counting on Billion-Scale Graphs. ICDE 2023: 2579-2592 - [c4]Zi Chen, Yiwei Zhao, Long Yuan, Xuemin Lin, Kai Wang:
Index-Based Biclique Percolation Communities Search on Bipartite Graphs. ICDE 2023: 2699-2712 - [i4]Zongyu Xu, Yihao Zhang, Long Yuan, Yuwen Qian, Zi Chen, Mingliang Zhou, Qin Mao, Weibin Pan:
Effective Community Search on Large Attributed Bipartite Graphs. CoRR abs/2302.14498 (2023) - [i3]Long Yuan, Zeyu Zhou, Xuemin Lin, Zi Chen, Xiang Zhao, Fan Zhang:
GPUSCAN++: Eficient Structural Graph Clustering on GPUs. CoRR abs/2311.12281 (2023) - 2022
- [c3]Lingkai Meng, Long Yuan, Zi Chen, Xuemin Lin, Shiyu Yang:
Index-based Structural Clustering on Directed Graphs. ICDE 2022: 2831-2844 - [i2]Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang:
Balanced Clique Computation in Signed Networks: Concepts and Algorithms. CoRR abs/2204.00515 (2022) - 2021
- [i1]Zi Chen, Long Yuan, Xuemin Lin, Zhengping Qian, Lu Qin:
Higher-Order Neighborhood Truss Decomposition. CoRR abs/2103.16037 (2021) - 2020
- [c2]Zhu Qing, Long Yuan, Zi Chen, Jingjing Lin, Guojie Ma:
Efficient Parallel Cycle Search in Large Graphs. DASFAA (2) 2020: 349-367 - [c1]Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Jianye Yang:
Efficient Maximal Balanced Clique Enumeration in Signed Networks. WWW 2020: 339-349
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-11-15 20:37 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:
