ORCID as entered in ROS
![orcid_icon](/themes/resgate8/images/icons/ORCIDiD_icon24x24.png)
Select Publications
2021, 'Efficient matrix factorization on heterogeneous CPU-GPU Systems', in Proceedings - International Conference on Data Engineering, pp. 1871 - 1876, http://dx.doi.org/10.1109/ICDE51399.2021.00169
,2021, 'Hypercore maintenance in dynamic hypergraphs', in Proceedings - International Conference on Data Engineering, pp. 2051 - 2056, http://dx.doi.org/10.1109/ICDE51399.2021.00199
,2021, 'PEFP: Efficient k-hop constrained s-t simple path enumeration on FPGA', in Proceedings - International Conference on Data Engineering, pp. 1320 - 1331, http://dx.doi.org/10.1109/ICDE51399.2021.00118
,2021, 'T3S: Effective representation learning for trajectory similarity computation', in Proceedings - International Conference on Data Engineering, pp. 2183 - 2188, http://dx.doi.org/10.1109/ICDE51399.2021.00221
,2021, 'A queueing-theoretic framework for vehicle dispatching in dynamic car-hailing', in Proceedings of the VLDB Endowment, pp. 2177 - 2189, http://dx.doi.org/10.14778/3476249.3476271
,2021, 'Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions', in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 2829 - 2838, http://dx.doi.org/10.1145/3448016.3457538
,2021, 'Critical Nodes Identification in Large Networks: An Inclination-Based Model', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 453 - 468, http://dx.doi.org/10.1007/978-3-030-90888-1_35
,2021, 'Efficiently answering reachability and path queries on temporal bipartite graphs', in Proceedings of the VLDB Endowment, pp. 1845 - 1858, http://dx.doi.org/10.14778/3467861.3467873
,2021, 'IndoorViz: A Demonstration System for Indoor Spatial Data Management', in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 2755 - 2759, http://dx.doi.org/10.1145/3448016.3452761
,2021, 'On querying historical k-cores', in Proceedings of the VLDB Endowment, pp. 2033 - 2045, http://dx.doi.org/10.14778/3476249.3476260
,2021, 'Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching', in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 925 - 937, http://dx.doi.org/10.1145/3448016.3457265
,2021, 'When the Recursive Diversity Anonymity Meets the Ring Signature', in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1359 - 1371, http://dx.doi.org/10.1145/3448016.3452825
,2021, 'BanditMTL: Bandit-based multi-task learning for text classification', Hybrid, pp. 5506 - 5516, presented at 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing,, Hybrid, https://aclanthology.org/2021.acl-long.428.pdf
,2020, 'Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs', in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1051 - 1066, http://dx.doi.org/10.1145/3318464.3389697
,2020, 'Global Reinforcement of Social Networks: The Anchored Coreness Problem', in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 2211 - 2226, http://dx.doi.org/10.1145/3318464.3389744
,2020, 'Progressive Top-K Nearest Neighbors Search in Large Road Networks', in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1781 - 1795, http://dx.doi.org/10.1145/3318464.3389746
,2020, 'Scaling Up Distance Labeling on Graphs with Core-Periphery Properties', in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1367 - 1381, http://dx.doi.org/10.1145/3318464.3389748
,2020, 'Efficient Maximal Balanced Clique Enumeration in Signed Networks', in The Web Conference 2020 - Proceedings of the World Wide Web Conference, WWW 2020, pp. 339 - 349, http://dx.doi.org/10.1145/3366423.3380119
,2020, 'Collective entity alignment via adaptive features', in Proceedings - International Conference on Data Engineering, pp. 1870 - 1873, http://dx.doi.org/10.1109/ICDE48307.2020.00191
,2020, 'Distributed streaming set similarity join', in Proceedings - International Conference on Data Engineering, pp. 565 - 576, http://dx.doi.org/10.1109/ICDE48307.2020.00055
,2020, 'Effective and efficient truss computation over large heterogeneous information networks', in Proceedings - International Conference on Data Engineering, pp. 901 - 912, http://dx.doi.org/10.1109/ICDE48307.2020.00083
,2020, 'Efficient bitruss decomposition for large-scale bipartite graphs', in Proceedings - International Conference on Data Engineering, pp. 661 - 672, http://dx.doi.org/10.1109/ICDE48307.2020.00063
,2020, 'Efficiently answering span-reachability queries in large temporal graphs', in Proceedings - International Conference on Data Engineering, pp. 1153 - 1164, http://dx.doi.org/10.1109/ICDE48307.2020.00104
,2020, 'Exploring finer granularity within the cores: Efficient (k, p)-Core computation', in Proceedings - International Conference on Data Engineering, pp. 181 - 192, http://dx.doi.org/10.1109/ICDE48307.2020.00023
,2020, 'Finding the best k in core decomposition: A time and space optimal solution', in Proceedings - International Conference on Data Engineering, pp. 685 - 696, http://dx.doi.org/10.1109/ICDE48307.2020.00065
,2020, 'I/O efficient approximate nearest neighbour search based on learned functions', in Proceedings - International Conference on Data Engineering, pp. 289 - 300, http://dx.doi.org/10.1109/ICDE48307.2020.00032
,2020, 'MC-Explorer: Analyzing and visualizing motif-cliques on large networks', in Proceedings - International Conference on Data Engineering, pp. 1722 - 1725, http://dx.doi.org/10.1109/ICDE48307.2020.00154
,2020, 'Speeding Up GED verification for graph similarity search', in Proceedings - International Conference on Data Engineering, pp. 793 - 804, http://dx.doi.org/10.1109/ICDE48307.2020.00074
,2020, 'StructSim: Querying structural node similarity at billion scale', in Proceedings - International Conference on Data Engineering, pp. 1950 - 1953, http://dx.doi.org/10.1109/ICDE48307.2020.00211
,2020, 'Task allocation in dependency-aware spatial crowdsourcing', in Proceedings - International Conference on Data Engineering, pp. 985 - 996, http://dx.doi.org/10.1109/ICDE48307.2020.00090
,2020, 'CoreCube: Core Decomposition in Multilayer Graphs', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Hong Kong, China, pp. 694 - 710, presented at WISE 2019 20th International Conference on Web Information Systems Engineering, Hong Kong, China, 19 January 2020, http://dx.doi.org/10.1007/978-3-030-34223-4_44
,2020, 'A dynamic answering path based fusion model for KGQA', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 235 - 246, http://dx.doi.org/10.1007/978-3-030-55130-8_21
,2020, 'A survey of community search over big graphs', in VLDB Journal, pp. 353 - 392, http://dx.doi.org/10.1007/s00778-019-00556-x
,2020, 'An empirical study on recent graph database systems', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 328 - 340, http://dx.doi.org/10.1007/978-3-030-55130-8_29
,2020, 'Answering billion-scale label-constrained reachability queries within microsecond', in Proceedings of the VLDB Endowment, pp. 812 - 825, http://dx.doi.org/10.14778/3380750.3380753
,2020, 'Aot: pushing the efficiency boundary of main-memory triangle listing', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 516 - 533, http://dx.doi.org/10.1007/978-3-030-59416-9_31
,2020, 'Demand-aware route planning for shared mobility services', in Proceedings of the VLDB Endowment, pp. 979 - 991, http://dx.doi.org/10.14778/3384345.3384348
,2020, 'Effective and efficient community search over large heterogeneous information networks', in Proceedings of the VLDB Endowment, pp. 854 - 867, http://dx.doi.org/10.14778/3380750.3380756
,2020, 'Efficient graph hierarchical decomposition with user engagement and tie strength', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 448 - 465, http://dx.doi.org/10.1007/978-3-030-59416-9_27
,2020, 'Efficient progressive minimum k-core search', in Proceedings of the VLDB Endowment, pp. 361 - 374, http://dx.doi.org/10.14778/3368289.3368300
,2020, 'Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees', in Proceedings of the VLDB Endowment, pp. 602 - 615, http://dx.doi.org/10.14778/3377369.3377371
,2020, 'Fully dynamic depthfirst search in directed graphs', in Proceedings of the VLDB Endowment, pp. 142 - 154, http://dx.doi.org/10.14778/3364324.3364329
,2020, 'GoGNN: Graph of graphs neural network for predicting structured entity interactions', in IJCAI International Joint Conference on Artificial Intelligence, pp. 1317 - 1323
,2020, 'Online programming education modeling and knowledge tracing', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 259 - 270, http://dx.doi.org/10.1007/978-3-030-55130-8_23
,2019, 'Hopconstrained st simple path enumeration: Towards bridging theory and practice', in Proceedings of the VLDB Endowment, pp. 463 - 476, http://dx.doi.org/10.14778/3372716.3372720
,2019, 'PatMat: A distributed pattern matching engine with Cypher', in International Conference on Information and Knowledge Management, Proceedings, pp. 2921 - 2924, http://dx.doi.org/10.1145/3357384.3357840
,2019, 'Selecting the optimal groups: Efficiently computing skyline k-cliques', in International Conference on Information and Knowledge Management, Proceedings, pp. 1211 - 1220, http://dx.doi.org/10.1145/3357384.3357991
,2019, 'Pivotal relationship identification: The k-truss minimization problem', in IJCAI International Joint Conference on Artificial Intelligence, Macao, China, pp. 4874 - 4880, presented at 28th International Joint Conference on Artificial Intelligence - IJCAI-19 – August 10-16 2019, Macao, China, Macao, China, 10 August 2019 - 16 August 2019, http://dx.doi.org/10.24963/ijcai.2019/677
,2019, 'K-core maximization: An edge addition approach', in IJCAI International Joint Conference on Artificial Intelligence, Macao, China, pp. 4867 - 4873, presented at Twenty-Eighth International Joint Conference on Artificial Intelligence, Macao, China, 10 August 2019, http://dx.doi.org/10.24963/ijcai.2019/676
,2019, 'Scaling distance labeling on small-world networks', in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1060 - 1077, http://dx.doi.org/10.1145/3299869.3319877
,