Sibo Wang

Orcid: 0000-0003-1892-6971

Affiliations:
  • Chinese University of Hong Kong, Hong Kong
  • University of Queensland, Brisbane, QLD, Australia (former)
  • Nanyang Technological University, Singapore (PhD 2016)


According to our database1, Sibo Wang authored at least 56 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs.
Proc. VLDB Endow., February, 2024

Efficient Algorithms for Personalized PageRank Computation: A Survey.
CoRR, 2024

2023
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks.
Proc. ACM Manag. Data, December, 2023

Efficient Approximation Framework for Attribute Recommendation.
Proc. ACM Manag. Data, December, 2023

Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach.
Proc. ACM Manag. Data, September, 2023

2-hop+ Sampling: Efficient and Effective Influence Estimation.
IEEE Trans. Knowl. Data Eng., 2023

Efficient Dynamic Weighted Set Sampling and Its Extension.
Proc. VLDB Endow., 2023

An Efficient Algorithm for Distance-based Structural Graph Clustering.
Proc. ACM Manag. Data, 2023

Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme.
Proc. ACM Manag. Data, 2023

Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs.
Proc. ACM Manag. Data, 2023

A Summary of ICDE 2022 Research Session Panels.
IEEE Data Eng. Bull., 2023

Rayleigh Quotient Graph Neural Networks for Graph-level Anomaly Detection.
CoRR, 2023

Subset Sampling and Its Extensions.
CoRR, 2023

Constrained Social Community Recommendation.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

PSPC: Efficient Parallel Shortest Path Counting on Large-Scale Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
Influence Maximization Revisited: Efficient Sampling with Bound Tightened.
ACM Trans. Database Syst., 2022

Fastest Path Query Answering using Time-Dependent Hop-Labeling in Road Network.
IEEE Trans. Knowl. Data Eng., 2022

Effective Indexing for Dynamic Structural Graph Clustering.
Proc. VLDB Endow., 2022

DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs.
Proc. VLDB Endow., 2022

Instant Graph Neural Networks for Dynamic Graphs.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Efficient Approximate Algorithms for Empirical Variance with Hashed Block Sampling.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Finding Top-r Influential Communities under Aggregation Functions.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Constrained Path Search with Submodular Function Maximization.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
GLAD: A Grid and Labeling Framework with Scheduling for Conflict-Aware kNN Queries.
IEEE Trans. Knowl. Data Eng., 2021

Massively Parallel Algorithms for Personalized PageRank.
Proc. VLDB Endow., 2021

Efficient Approximate Algorithms for Empirical Entropy and Mutual Information.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Learning Based Proximity Matrix Factorization for Node Embedding.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Approximate Graph Propagation.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

An Efficient Algorithm for the Anchored k-Core Budget Minimization Problem.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

2020
Efficient and robust data augmentation for trajectory analytics: a similarity-based approach.
World Wide Web, 2020

Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks.
Proc. VLDB Endow., 2020

Editorial of Special Issue of WISE 2019.
Data Sci. Eng., 2020

Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened.
Proceedings of the 2020 International Conference on Management of Data, 2020

Personalized PageRank to a Target Node, Revisited.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Inductive Link Prediction for Nodes Having Only Attribute Information.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Parallelizing approximate single-source personalized PageRank queries on shared memory.
VLDB J., 2019

Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries.
ACM Trans. Database Syst., 2019

PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs.
Proceedings of the 2019 International Conference on Management of Data, 2019

An Efficient Framework for Correctness-Aware kNN Queries on Road Networks.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Time-Dependent Hop Labeling on Road Network.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018
Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory.
VLDB J., 2018

Persisting RB-Tree into NVM in a Consistency Perspective.
ACM Trans. Storage, 2018

TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs.
Proceedings of the 2018 International Conference on Management of Data, 2018

Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks.
Proceedings of the 2018 International Conference on Management of Data, 2018

Scalable Hypergraph-Based Image Retrieval and Tagging System.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017
Revisiting the Stop-and-Stare Algorithms for Influence Maximization.
Proc. VLDB Endow., 2017

FORA: Simple and Effective Approximate Single-Source Personalized PageRank.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Semi-Supervised Event-related Tweet Identification with Dynamic Keyword Generation.
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

The Data Civilizer System.
Proceedings of the 8th Biennial Conference on Innovative Data Systems Research, 2017

2016
Efficient index structures for reachability and shortest path queries
PhD thesis, 2016

HubPPR: Effective Indexing for Approximate Personalized PageRank.
Proc. VLDB Endow., 2016

Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks.
Proc. VLDB Endow., 2016

2015
Crowd-Based Deduplication: An Adaptive Approach.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Efficient Route Planning on Public Transportation Networks: A Labelling Approach.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

2014
Reachability queries on large dynamic graphs: a total order approach.
Proceedings of the International Conference on Management of Data, 2014

2013
Efficient single-source shortest path and distance queries on large graphs.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013


  Loading...