default search action
Wenqing Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Xin Chen, Jieming Shi, You Peng, Wenqing Lin, Sibo Wang, Wenjie Zhang:
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs. Proc. VLDB Endow. 17(6): 1324-1336 (2024) - [j11]Qintian Guo
, Dandan Lin
Efficient Algorithms for Group Hitting Probability Queries on Large Graphs. IEEE Trans. Knowl. Data Eng. 36(7): 2995-3008 (2024) - [c23]Wenqing Lin, Hemeng Wang, Haodong Deng, Qingxiao Sun:
ScalFrag: Efficient Tiled-MTTKRP with Adaptive Launching on GPUs. CLUSTER 2024: 335-345 - [c22]Zulun Zhu, Siqiang Luo, Wenqing Lin, Sibo Wang, Dingheng Mo, Chunbo Li:
Personalized PageRanks over Dynamic Graphs - The Case for Optimizing Quality of Service. ICDE 2024: 409-422 - [c21]Chang Liu
Beyond Binary Preference: Leveraging Bayesian Approaches for Joint Optimization of Ranking and Calibration. KDD 2024: 5442-5453 - [c20]Chang Liu
DAG: Deep Adaptive and Generative K-Free Community Detection on Attributed Graphs. KDD 2024: 5454-5465 - [c19]Shiqi Zhang
Information Diffusion Meets Invitation Mechanism. WWW (Companion Volume) 2024: 383-392 - [i10]Yanbiao Ji, Chang Liu, Xin Chen, Yue Ding, Dan Luo, Mei Li, Wenqing Lin, Hongtao Lu:
NT-LLM: A Novel Node Tokenizer for Integrating Graph Structure into Large Language Models. CoRR abs/2410.10743 (2024) - [i9]Yiqian Huang, Shiqi Zhang, Laks V. S. Lakshmanan, Wenqing Lin, Xiaokui Xiao, Bo Tang:
Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint. CoRR abs/2410.16603 (2024) - 2023
- [j10]Zhifeng Bao, Panagiotis Bouros, Reynold Cheng, Byron Choi, Anton Dignös, Wei Ding, Yixiang Fang, Boyang Han, Jilin Hu, Arijit Khan, Wenqing Lin, Xuemin Lin, Cheng Long, Nikos Mamoulis, Jian Pei, Matthias Renz, Shashi Shekhar, Jieming Shi, Eleni Tzirita Zacharatou, Sibo Wang, Xiao Wang, Xue Wang, Raymond Chi-Wing Wong, Da Yan, Xifeng Yan, Bin Yang, Dezhong Yao, Ce Zhang, Peilin Zhao, Rong Zhu:
A Summary of ICDE 2022 Research Session Panels. IEEE Data Eng. Bull. 46(4): 4-17 (2023) - [j9]Shixun Huang
Managing Conflicting Interests of Stakeholders in Influencer Marketing. Proc. ACM Manag. Data 1(1): 80:1-80:27 (2023) - [j8]Shaowei Wang
Analyzing Preference Data With Local Privacy: Optimal Utility and Enhanced Robustness. IEEE Trans. Knowl. Data Eng. 35(8): 7753-7767 (2023) - [c18]Shiqi Zhang
Capacity Constrained Influence Maximization in Social Networks. KDD 2023: 3376-3385 - [c17]Xingyi Zhang
Constrained Social Community Recommendation. KDD 2023: 5586-5596 - [i8]Shiqi Zhang, Yiqian Huang, Jiachen Sun, Wenqing Lin, Xiaokui Xiao, Bo Tang:
Capacity Constrained Influence Maximization in Social Networks. CoRR abs/2306.01782 (2023) - 2022
- [j7]Shixun Huang
Influence Maximization in Real-World Closed Social Networks. Proc. VLDB Endow. 16(2): 180-192 (2022) - [j6]Qintian Guo
Influence Maximization Revisited: Efficient Sampling with Bound Tightened. ACM Trans. Database Syst. 47(3): 12:1-12:45 (2022) - [c16]Shiqi Zhang, Jiachen Sun, Wenqing Lin, Xiaokui Xiao, Bo Tang:
Measuring Friendship Closeness: A Perspective of Social Identity Theory. CIKM 2022: 3664-3673 - [i7]Shiqi Zhang, Jiachen Sun, Wenqing Lin, Xiaokui Xiao, Bo Tang:
Measuring Friendship Closeness: A Perspective of Social Identity Theory. CoRR abs/2208.09176 (2022) - [i6]Shixun Huang, Wenqing Lin, Zhifeng Bao, Jiachen Sun:
Influence Maximization in Real-World Closed Social Networks. CoRR abs/2209.10286 (2022) - 2021
- [j5]Yuan Fang
Metagraph-Based Learning on Heterogeneous Graphs. IEEE Trans. Knowl. Data Eng. 33(1): 154-168 (2021) - [c15]Shaowei Wang, Jin Li, Yuqiu Qian, Jiachun Du, Wenqing Lin, Wei Yang:
Hiding Numerical Vectors in Local Private and Shuffled Messages. IJCAI 2021: 3706-3712 - [c14]Wenqing Lin
Large-Scale Network Embedding in Apache Spark. KDD 2021: 3271-3279 - [i5]Wenqing Lin:
Large-Scale Network Embedding in Apache Spark. CoRR abs/2106.10620 (2021) - 2020
- [j4]Siqiang Luo
BATON: Batch One-Hop Personalized PageRanks with Efficiency and Accuracy. IEEE Trans. Knowl. Data Eng. 32(10): 1897-1908 (2020) - [c13]Wenqing Lin
Initialization for Network Embedding: A Graph Partition Approach. WSDM 2020: 367-374
2010 – 2019
- 2019
- [j3]Sibo Wang
Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries. ACM Trans. Database Syst. 44(4): 18:1-18:37 (2019) - [c12]Siqiang Luo
Efficient Batch One-Hop Personalized PageRanks. ICDE 2019: 1562-1565 - [c11]Wenqing Lin
Distributed Algorithms for Fully Personalized PageRank on Large Graphs. WWW 2019: 1084-1094 - [i4]Wenqing Lin:
Distributed Algorithms for Fully Personalized PageRank on Large Graphs. CoRR abs/1903.11749 (2019) - [i3]Sibo Wang, Renchi Yang, Runhui Wang, Xiaokui Xiao, Zhewei Wei, Wenqing Lin, Yin Yang, Nan Tang:
Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries. CoRR abs/1908.10583 (2019) - [i2]Wenqing Lin, Feng He, Faqiang Zhang, Xu Cheng, Hongyun Cai:
Effective and Efficient Network Embedding Initialization via Graph Partitioning. CoRR abs/1908.10697 (2019) - 2017
- [j2]Wenqing Lin
Network Motif Discovery: A GPU Approach. IEEE Trans. Knowl. Data Eng. 29(3): 513-528 (2017) - 2016
- [j1]Sibo Wang
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks. Proc. VLDB Endow. 10(2): 61-72 (2016) - [c10]Qirong Ho, Wenqing Lin
A Distributed Graph Algorithm for Discovering Unique Behavioral Groups from Large-Scale Telco Data. CIKM 2016: 1353-1362 - [c9]Yuan Fang
Semantic proximity search on graphs with metagraph-based learning. ICDE 2016: 277-288 - 2015
- [b1]Wenqing Lin:
Efficient techniques for subgraph mining and query processing. Nanyang Technological University, Singapore, 2015 - [c8]Wenqing Lin
Network motif discovery: A GPU approach. ICDE 2015: 831-842 - [c7]Sibo Wang
Efficient Route Planning on Public Transportation Networks: A Labelling Approach. SIGMOD Conference 2015: 967-982 - 2014
- [c6]Wenqing Lin
Large-scale frequent subgraph mining in MapReduce. ICDE 2014: 844-855 - [c5]Andy Diwen Zhu, Wenqing Lin
Reachability queries on large dynamic graphs: a total order approach. SIGMOD Conference 2014: 1323-1334 - 2013
- [c4]Lingkun Wu, Wenqing Lin
LSII: An indexing structure for exact real-time search on microblogs. ICDE 2013: 482-493 - [c3]Andy Diwen Zhu, Xiaokui Xiao
Efficient single-source shortest path and distance queries on large graphs. KDD 2013: 998-1006 - [c2]Yufei Tao
Minimal MapReduce algorithms. SIGMOD Conference 2013: 529-540 - [i1]Andy Diwen Zhu, Xiaokui Xiao, Sibo Wang, Wenqing Lin:
Efficient Single-Source Shortest Path and Distance Queries on Large Graphs. CoRR abs/1306.1153 (2013) - 2012
- [c1]Wenqing Lin
Efficient algorithms for generalized subgraph query processing. CIKM 2012: 325-334
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-22 19:04 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: