ORCID as entered in ROS
![orcid_icon](/themes/resgate8/images/icons/ORCIDiD_icon24x24.png)
Select Publications
2023, Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs, , http://dx.doi.org/10.48550/arxiv.2312.01424
,2021, Towards User Engagement Dynamics in Social Networks, , http://dx.doi.org/10.48550/arxiv.2110.12193
,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, 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
,