Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWensheng Luo 0002
Person information
- affiliation: Hunan University, College of Computer Science and Electronic Engineering, Changsha, China
- affiliation: National Supercomputing Center, Changsha, Hunan, China
Other persons with the same name
- Wensheng Luo (aka: WenSheng Luo) — disambiguation page
- Wensheng Luo 0001
![[0000-0002-8516-4498]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8516-4498")
(aka: WenSheng Luo 0001) — Harbin Institute of Technology, School of Astronautics, China (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Haoxuan Xie, Yixiang Fang, Yuyang Xia, Wensheng Luo, Chenhao Ma:
On Querying Connected Components in Large Temporal Graphs. Proc. ACM Manag. Data 1(2): 170:1-170:27 (2023)- [j8]Wensheng Luo, Qiaoyuan Yang, Yixiang Fang, Xu Zhou:
Efficient Core Maintenance in Large Bipartite Graphs. Proc. ACM Manag. Data 1(3): 208:1-208:26 (2023) - [j7]Yingli Zhou, Yixiang Fang, Wensheng Luo, Yunming Ye:
Influential Community Search over Large Heterogeneous Information Networks. Proc. VLDB Endow. 16(8): 2047-2060 (2023) - [j6]Wensheng Luo, Xu Zhou, Kenli Li, Yunjun Gao, Keqin Li:
Efficient Influential Community Search in Large Uncertain Graphs. IEEE Trans. Knowl. Data Eng. 35(4): 3779-3793 (2023) - [c2]Wensheng Luo, Zhuo Tang, Yixiang Fang, Chenhao Ma, Xu Zhou:
Scalable Algorithms for Densest Subgraph Discovery. ICDE 2023: 287-300 - [i1]Wensheng Luo, Chenhao Ma, Yixiang Fang, Laks V. S. Lakshmanan:
A Survey of Densest Subgraph Discovery on Large Graphs. CoRR abs/2306.07927 (2023) - 2022
- [j5]Peiying Lin, Yangfan Li, Wensheng Luo, Xu Zhou, Yuanyuan Zeng, Kenli Li, Keqin Li:
Personalized query techniques in graphs: A survey. Inf. Sci. 607: 961-1000 (2022) - [j4]Yixiang Fang, Wensheng Luo, Chenhao Ma:
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques. Proc. VLDB Endow. 15(12): 3766-3769 (2022) - [j3]Yuanyuan Zeng, Kenli Li, Xu Zhou, Wensheng Luo, Yunjun Gao:
An Efficient Index-Based Approach to Distributed Set Reachability on Small-World Graphs. IEEE Trans. Parallel Distributed Syst. 33(10): 2358-2371 (2022) - [j2]ZhiBang Yang, Xiaoxue Li, Xu Zhang, Wensheng Luo, Kenli Li:
K-truss community most favorites query based on top-t. World Wide Web 25(2): 949-969 (2022) - [c1]Wensheng Luo, Kenli Li, Xu Zhou, Yunjun Gao, Keqin Li:
Maximum Biplex Search over Bipartite Graphs. ICDE 2022: 898-910 - 2021
- [j1]Wensheng Luo, Xu Zhou, Jianye Yang, Peng Peng, Guoqing Xiao, Yunjun Gao:
Efficient Approaches to Top-r Influential Community Search. IEEE Internet Things J. 8(16): 12650-12657 (2021)
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-04-25 01:52 CEST 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:
