Issue Date | Title | Author(s) |
2020-01-01 | Efficient progressive minimum k-core search | Li, C; Zhang, F; Zhang, Y; Qin, L; Zhang, W; Lin, X |
2020-05-01 | Maximum biclique search at billion scale | Lyu, B; Qin, L; Lin, X; Zhang, Y; Qian, Z; Zhou, J |
2020-01-01 | Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees | Ouyang, D; Yuan, L; Qin, L; Chang, L; Zhang, Y; Lin, X |
2020-08 | Similarity query processing for high-dimensional data | Qin, J; Wang, W; Xiao, C; Zhang, Y |
2019-01-01 | Distributed subgraph matching on timely dataflow | Lai, L; Qing, Z; Yang, Z; Jin, X; Lai, Z; Wang, R; Hao, K; Lin, X; Qin, L; Zhang, W; Zhang, Y; Qian, Z; Zhou, J |
2019-11-01 | Efficient Progressive Minimum k-Core Search | Li, C; Zhang, F; Zhang, Y; Qni, L; Zhang, W; Lin, X |
2020-01-01 | Answering billion-scale label-constrained reachability queries within microsecond | Peng, Y; Zhang, Y; Lin, X; Qin, L; Zhang, W |
2021-01-01 | Efficiently answering reachability and path queries on temporal bipartite graphs | Chen, X; Wang, K; Lin, X; Zhang, W; Qin, L; Zhang, Y |
2017-02 | OLAK | Zhang, F; Zhang, W; Zhang, Y; Qin, L; Lin, X |
2021-01-01 | On querying historical k-cores | Yu, M; Wen, D; Qin, L; Zhang, Y; Zhang, W; Lin, X |