Select Publications
Preprints
2023, Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs, http://dx.doi.org/10.48550/arxiv.2312.01424
,2023, GPUSCAN$^{++}$:Efficient Structural Graph Clustering on GPUs, http://dx.doi.org/10.48550/arxiv.2311.12281
,2023, Efficient Non-Learning Similar Subtrajectory Search, http://dx.doi.org/10.48550/arxiv.2307.10082
,2022, Balanced Clique Computation in Signed Networks: Concepts and Algorithms, http://dx.doi.org/10.48550/arxiv.2204.00515
,2021, Towards User Engagement Dynamics in Social Networks, http://dx.doi.org/10.48550/arxiv.2110.12193
,2021, A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing [technical report], http://dx.doi.org/10.48550/arxiv.2107.08662
,2021, HUGE: An Efficient and Scalable Subgraph Enumeration System, http://dx.doi.org/10.48550/arxiv.2103.14294
,2020, GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions, http://dx.doi.org/10.48550/arxiv.2005.05537
,2020, Taming the Expressiveness and Programmability of Graph Analytical Queries, http://dx.doi.org/10.48550/arxiv.2004.09045
,2020, Binarized Graph Neural Network, http://dx.doi.org/10.48550/arxiv.2004.11147
,2020, CoinMagic: A Differential Privacy Framework for Ring Signature Schemes, http://dx.doi.org/10.48550/arxiv.2003.06826
,2019, A Survey and Experimental Analysis of Distributed Subgraph Matching, http://dx.doi.org/10.48550/arxiv.1906.11518
,2019, Efficient Algorithms for Densest Subgraph Discovery, http://dx.doi.org/10.48550/arxiv.1906.00341
,2017, Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval, http://dx.doi.org/10.48550/arxiv.1701.05003
,