Kai Wang

Orcid: 0000-0002-3123-2184

Affiliations:
  • Shanghai Jiao Tong University, China
  • University of New South Wales, Sydney, Australia (former)


According to our database1, Kai Wang authored at least 45 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Discovering critical vertices for reinforcement of large-scale bipartite networks.
VLDB J., November, 2024

Efficient algorithms for reachability and path queries on temporal bipartite graphs.
VLDB J., September, 2024

Efficient Unsupervised Community Search with Pre-trained Graph Transformer.
Proc. VLDB Endow., May, 2024

RIGA: Rotation-Invariant and Globally-Aware Descriptors for Point Cloud Registration.
IEEE Trans. Pattern Anal. Mach. Intell., May, 2024

Enhancing Resilience in Website Fingerprinting: Novel Adversary Strategies for Noisy Traffic Environments.
IEEE Trans. Inf. Forensics Secur., 2024

Missing Data Imputation with Uncertainty-Driven Network.
Proc. ACM Manag. Data, 2024

Neural Attributed Community Search at Billion Scale.
CoRR, 2024

Optimizing Network Resilience via Vertex Anchoring.
Proceedings of the ACM on Web Conference 2024, 2024

Mining Quasi-Periodic Communities in Temporal Network.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Bipartite Graph Analytics: Current Techniques and Future Trends.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Querying Historical Cohesive Subgraphs Over Temporal Bipartite Graphs.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Butterfly Counting over Bipartite Graphs with Local Differential Privacy.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Maximal Biclique Enumeration: A Prefix Tree Based Approach.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Size-bounded Community Search over Large Bipartite Graphs.
Proceedings of the Proceedings 27th International Conference on Extending Database Technology, 2024

2023
Cohesive Subgraph Discovery Over Uncertain Bipartite Graphs.
IEEE Trans. Knowl. Data Eng., November, 2023

Accelerated butterfly counting with vertex priority on bipartite graphs.
VLDB J., March, 2023

Discovering Significant Communities on Bipartite Graphs: An Index-Based Approach.
IEEE Trans. Knowl. Data Eng., March, 2023

Scaling Up k-Clique Densest Subgraph Detection.
Proc. ACM Manag. Data, 2023

Influence Minimization via Blocking Strategies.
CoRR, 2023

Quantifying Node Importance over Network Structural Stability.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Index-Based Biclique Percolation Communities Search on Bipartite Graphs.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Minimizing the Influence of Misinformation via Vertex Blocking.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

IMinimize: A System for Negative Influence Minimization via Vertex Blocking.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Discovering Densest Subgraph over Heterogeneous Information Networks.
Proceedings of the Databases Theory and Applications, 2023

2022
Discovering key users for defending network structural stability.
World Wide Web, 2022

Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs.
VLDB J., 2022

Efficient Radius-Bounded Community Search in Geo-Social Networks.
IEEE Trans. Knowl. Data Eng., 2022

On discovering motifs and frequent patterns in spatial trajectories with discrete Fréchet distance.
GeoInformatica, 2022

Efficient Computation of Cohesive Subgraphs in Uncertain Bipartite Graphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Discovering Hierarchy of Bipartite Graphs with Cohesive Subgraphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficient Personalized Maximum Biclique Search.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficient Reinforcement of Bipartite Networks at Billion Scale.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Cohesive Subgraph Search Over Large Heterogeneous Information Networks
Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-97567-8, 2022

2021
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs.
Proc. VLDB Endow., 2021

Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs.
Inf. Sci., 2021

Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Efficient and Effective Community Search on Large-scale Bipartite Graphs.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Pareto-optimal Community Search on Large Bipartite Graphs.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

A Cohesive Structure Based Bipartite Graph Analytics System.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Cohesive Structure Based Network Analysis: From Motif Level to Subgraph Level.
PhD thesis, 2020

Efficient Bitruss Decomposition for Large-scale Bipartite Graphs.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength.
Proceedings of the Database Systems for Advanced Applications, 2020

2019
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks.
Proc. VLDB Endow., 2019

2018
Efficient Computing of Radius-Bounded k-Cores.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017
Efficient Motif Discovery in Spatial Trajectories Using Discrete Fréchet Distance.
Proceedings of the 20th International Conference on Extending Database Technology, 2017


  Loading...