Longlong Lin

Orcid: 0000-0002-2194-8146

According to our database1, Longlong Lin authored at least 45 papers between 2018 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Scalable Similarity Search Over Large Attributed Bipartite Graphs.
IEEE Trans. Knowl. Data Eng., May, 2026

Robust Smart Contract Vulnerability Detection via Contrastive Learning-Enhanced Granular-ball Training.
CoRR, March, 2026

NCSAC: Effective Neural Community Search via Attribute-Augmented Conductance.
IEEE Trans. Knowl. Data Eng., February, 2026

Pseudoarboricity-Based Skyline Important Community Search in Large Networks.
IEEE Trans. Knowl. Data Eng., February, 2026

Dual Channel Graph Convolutional Networks via Personalized PageRank.
IEEE CAA J. Autom. Sinica, January, 2026

Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs.
CoRR, January, 2026

GDBA: Defending graph neural networks via attribute debiasing.
Expert Syst. Appl., 2026

GFork: A gated fusion network on multi-granularity heterogeneous pruning graphs for effective text classification.
Expert Syst. Appl., 2026

From Representation to Clusters: A Contrastive Learning Approach for Attributed Hypergraph Clustering.
Proceedings of the ACM Web Conference 2026, 2026

Scalable and Provable Biclique-Preserving Clustering: The Power of Counting-based Approaches.
Proceedings of the ACM Web Conference 2026, 2026

DTMiner: A Data-Centric System for Efficient Temporal Motif Mining.
Proceedings of the 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2026

2025
Effective and Efficient Conductance-Based Community Search at Billion Scale.
IEEE Trans. Big Data, December, 2025

Provable Higher-Order Graph Clustering: The Power of Peeling-Based Approaches.
IEEE Trans. Knowl. Data Eng., September, 2025

Integral Densest Subgraph Search on Directed Graphs.
Proc. ACM Manag. Data, June, 2025

Why Are Learned Indexes So Effective but Sometimes Ineffective?
Proc. VLDB Endow., May, 2025

Truss Decomposition in Hypergraphs.
Proc. VLDB Endow., March, 2025

One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor.
Proc. ACM Manag. Data, 2025

Reproducibility Report for ACM SIGMOD 2025 Paper: 'Clementi: Efficient Load Balancing and Communication Overlap for Multi-FPGA Graph Processing'.
Proceedings of the Reproducibility Reports of the 2025 International Conference on Management of Data, 2025

CoATA: Effective Co-Augmentation of Topology and Attribute for Graph Neural Networks.
Proceedings of the 2025 International Conference on Multimedia Retrieval, 2025

On Temporal-Constraint Subgraph Matching.
Proceedings of the 41st IEEE International Conference on Data Engineering, 2025

A Data-Centric Hardware Accelerator for Efficient Adaptive Radix Tree.
Proceedings of the 62nd ACM/IEEE Design Automation Conference, 2025

TempGraph: An Efficient Chain-driven Temporal Graph Computing Framework on the GPU.
Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2025

Achieving Efficient Temporal Graph Transformation on the GPU.
Proceedings of the Advanced Parallel Processing Technologies, 2025

2024
Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach.
Proc. VLDB Endow., September, 2024

Effective Temporal Graph Learning via Personalized PageRank.
Entropy, July, 2024

QTCS: Efficient Query-Centered Temporal Community Search.
Proc. VLDB Endow., February, 2024

CCSS: Towards conductance-based community search with size constraints.
Expert Syst. Appl., 2024

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach.
CoRR, 2024

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach.
CoRR, 2024

Towards Truss-Based Temporal Community Search.
CoRR, 2024

GSD-GNN: Generalizable and Scalable Algorithms for Decoupled Graph Neural Networks.
Proceedings of the 2024 International Conference on Multimedia Retrieval, 2024

GB<sub>RAIN</sub>: Combating Textual Label Noise by Granular-ball based Robust Training.
Proceedings of the 2024 International Conference on Multimedia Retrieval, 2024

Text Adversarial Defense via Granular-Ball Sample Enhancement.
Proceedings of the 2024 International Conference on Multimedia Retrieval, 2024

Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

PSNE: Efficient Spectral Sparsification Algorithms for Scaling Network Embedding.
Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

2023
Query-Centered Temporal Community Search via Time-Constrained Personalized PageRank.
CoRR, 2023

Scalable and Effective Conductance-Based Graph Clustering.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Mining Stable Quasi-Cliques on Temporal Networks.
IEEE Trans. Syst. Man Cybern. Syst., 2022

Mining Diversified Top-$r$r Lasting Cohesive Subgraphs on Temporal Networks.
IEEE Trans. Big Data, 2022

Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration.
J. Comput. Sci. Technol., 2022

Significant Engagement Community Search on Temporal Networks: Concepts and Algorithms.
CoRR, 2022

Significant Engagement Community Search on Temporal Networks.
Proceedings of the Database Systems for Advanced Applications, 2022

2019
Big RDF Data Storage, Computation, and Analysis: A Strawman's Arguments.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

2018
Fully Dynamic Broadcasting under SINR.
Proceedings of the 37th IEEE International Performance Computing and Communications Conference, 2018


  Loading...