![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Longlong Lin
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Ziyu Liao
, Tao Liu
, Yue He, Longlong Lin
:
Effective Temporal Graph Learning via Personalized PageRank. Entropy 26(7): 588 (2024) - [j5]Yue He, Longlong Lin
, Pingpeng Yuan, Ronghua Li, Tao Jia, Zeli Wang:
CCSS: Towards conductance-based community search with size constraints. Expert Syst. Appl. 250: 123915 (2024) - [j4]Longlong Lin, Pingpeng Yuan, Rong-Hua Li, Chun-Xue Zhu, Hongchao Qin, Hai Jin, Tao Jia:
QTCS: Efficient Query-Centered Temporal Community Search. Proc. VLDB Endow. 17(6): 1187-1199 (2024) - [c9]Longlong Lin, Tao Jia, Zeli Wang, Jin Zhao, Rong-Hua Li:
PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering. KDD 2024: 1793-1803 - [c8]Xiaowei Ye, Rong-Hua Li, Lei Liang, Zhizhen Liu, Longlong Lin, Guoren Wang:
Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach. KDD 2024: 3907-3918 - [c7]Yunfeng Yu
, Longlong Lin
, Qiyu Liu
, Zeli Wang
, Xi Ou
, Tao Jia
:
GSD-GNN: Generalizable and Scalable Algorithms for Decoupled Graph Neural Networks. ICMR 2024: 64-72 - [c6]Zeli Wang
, Jian Li, Shuyin Xia
, Longlong Lin
, Guoyin Wang
:
Text Adversarial Defense via Granular-Ball Sample Enhancement. ICMR 2024: 348-356 - [c5]Zeli Wang
, Tuo Zhang
, Shuyin Xia
, Longlong Lin
, Guoyin Wang
:
GBRAIN: Combating Textual Label Noise by Granular-ball based Robust Training. ICMR 2024: 357-365 - [i4]Longlong Lin, Tao Jia, Zeli Wang, Jin Zhao, Rong-Hua Li:
PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering. CoRR abs/2406.07357 (2024) - 2023
- [c4]Longlong Lin, Ronghua Li, Tao Jia:
Scalable and Effective Conductance-Based Graph Clustering. AAAI 2023: 4471-4478 - [i3]Longlong Lin, Pingpeng Yuan, Rong-Hua Li, Chun-Xue Zhu, Hongchao Qin, Hai Jin, Tao Jia:
Query-Centered Temporal Community Search via Time-Constrained Personalized PageRank. CoRR abs/2302.08740 (2023) - 2022
- [j3]Chun-Xue Zhu, Longlong Lin, Pingpeng Yuan, Hai Jin:
Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration. J. Comput. Sci. Technol. 37(5): 1068-1085 (2022) - [j2]Longlong Lin
, Pingpeng Yuan
, Rong-Hua Li
, Hai Jin
:
Mining Diversified Top-$r$r Lasting Cohesive Subgraphs on Temporal Networks. IEEE Trans. Big Data 8(6): 1537-1549 (2022) - [j1]Longlong Lin
, Pingpeng Yuan
, Rong-Hua Li, Jifei Wang, Ling Liu
, Hai Jin
:
Mining Stable Quasi-Cliques on Temporal Networks. IEEE Trans. Syst. Man Cybern. Syst. 52(6): 3731-3745 (2022) - [c3]Yifei Zhang, Longlong Lin, Pingpeng Yuan, Hai Jin:
Significant Engagement Community Search on Temporal Networks. DASFAA (1) 2022: 250-258 - [i2]Yifei Zhang, Longlong Lin, Pingpeng Yuan, Hai Jin:
Significant Engagement Community Search on Temporal Networks: Concepts and Algorithms. CoRR abs/2206.06350 (2022) - [i1]Longlong Lin, Rong-Hua Li, Tao Jia:
Scalable and Effective Conductance-based Graph Clustering. CoRR abs/2211.12511 (2022)
2010 – 2019
- 2019
- [c2]Pingpeng Yuan, Longlong Lin, Zhijuan Kou, Ling Liu, Hai Jin:
Big RDF Data Storage, Computation, and Analysis: A Strawman's Arguments. ICDCS 2019: 1693-1703 - 2018
- [c1]Dongxiao Yu, Longlong Lin, Yong Zhang, Jiguo Yu, Yifei Zou, Qiang-Sheng Hua, Xiuzhen Cheng:
Fully Dynamic Broadcasting under SINR. IPCCC 2018: 1-8
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-29 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint