Hongchao Qin

Orcid: 0000-0003-4364-0633

According to our database¹, Hongchao Qin authored at least 36 papers between 2016 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Encoding Group Interests With Persistent Homology for Personalized Search.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Man Cybern. Syst., September, 2024

Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., July, 2024

Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., July, 2024

QTCS: Efficient Query-Centered Temporal Community Search.

[BibT_eX]

[DOI]

Proc. VLDB Endow., February, 2024

Effective Bug Detection in Graph Database Engines: An LLM-based Approach.

[BibT_eX]

[DOI]

CoRR, 2024

Mining Quasi-Periodic Communities in Temporal Network.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Maximal Biclique Enumeration: A Prefix Tree Based Approach.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

2023

Temporal Graph Cube.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., December, 2023

Densest Periodic Subgraph Mining on Large Temporal Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., November, 2023

Stable Subgraph Isomorphism Search in Temporal Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., June, 2023

Maximal Quasi-Cliques Mining in Uncertain Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Big Data, February, 2023

Parallel Colorful h-star Core Maintenance in Dynamic Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2023

Efficient Biclique Counting in Large Bipartite Graphs.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Efficient Resistance Distance Computation: The Power of Landmark-based Approaches.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Self-attention Hypergraph Pooling Network.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2023

Efficient Maximum Fair Clique Search over Large Networks.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

Explainable Hyperlink Prediction: A Hypergraph Edit Distance-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Neighborhood Skyline on Graphs: Concepts, Algorithms and Applications.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022

Periodic Communities Mining in Temporal Networks: Concepts and Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Mining Stable Communities in Temporal Networks by Density-Based Clustering.

[BibT_eX]

[DOI]

IEEE Trans. Big Data, 2022

Mining Bursting Core in Large Temporal Graph.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Fast Algorithm for Maximal k-plex Enumeration.

[BibT_eX]

[DOI]

CoRR, 2022

Filtration-Enhanced Graph Transformation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Colorful h-star Core Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Scaling Up Maximal <i>k</i>-plex Enumeration.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

Mining Periodic k-Clique from Real-World Sparse Temporal Networks.

[BibT_eX]

[DOI]

Proceedings of the Web and Big Data - 6th International Joint Conference, 2022

2020

Butterfly-Based Higher-Order Clustering on Bipartite Networks.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, Engineering and Management, 2020

Effective and Efficient Community Search in Directed Graphs Across Heterogeneous Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2020

2019

Mining Bursting Communities in Temporal Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Mining Periodic Cliques in Temporal Networks.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018

Trust-Aware Personalized Route Query Using Extreme Learning Machine in Location-Based Social Networks.

[BibT_eX]

[DOI]

Cogn. Comput., 2018

Group Identity Matching Across Heterogeneous Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2018, 2018

2017

An Effective Method for Community Search in Large Directed Attributed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mobile Ad-hoc and Sensor Networks - 13th International Conference, 2017

2016

Efficient Community Maintenance for Dynamic Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Web Technologies and Applications - 18th Asia-Pacific Web Conference, 2016

Hongchao Qin

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...