• Zhang Y, Yu J, Zhang Y and Qin L. Maintaining Top-$t$ Cores in Dynamic Graphs. IEEE Transactions on Knowledge and Data Engineering. 10.1109/TKDE.2023.3332638. 36:9. (4766-4780).

    https://ieeexplore.ieee.org/document/10316654/

  • Guo B and Sekerinski E. (2024). Simplified algorithms for order-based core maintenance. The Journal of Supercomputing. 10.1007/s11227-024-06190-x. 80:13. (19592-19623). Online publication date: 1-Sep-2024.

    https://link.springer.com/10.1007/s11227-024-06190-x

  • Ghaffari M and Trygub A. Parallel Dynamic Maximal Matching. Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. (427-437).

    https://doi.org/10.1145/3626183.3659982

  • Liu D, Wang R, Zou Z and Huang X. (2024). Fast Multilayer Core Decomposition and Indexing 2024 IEEE 40th International Conference on Data Engineering (ICDE). 10.1109/ICDE60146.2024.00211. 979-8-3503-1715-2. (2695-2708).

    https://ieeexplore.ieee.org/document/10597804/

  • Shi J, Dhulipala L and Shun J. (2024). Parallel Algorithms for Hierarchical Nucleus Decomposition. Proceedings of the ACM on Management of Data. 2:1. (1-27). Online publication date: 12-Mar-2024.

    https://doi.org/10.1145/3639287

  • Farhan M, Koehler H and Wang Q. (2023). BatchHL: batch dynamic labelling for distance queries on large-scale networks. The VLDB Journal — The International Journal on Very Large Data Bases. 33:1. (101-129). Online publication date: 1-Jan-2024.

    https://doi.org/10.1007/s00778-023-00799-9

  • Dhulipala L, Liu Q, Raskhodnikova S, Shi J, Shun J and Yu S. (2022). Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). 10.1109/FOCS54457.2022.00077. 978-1-6654-5519-0. (754-765).

    https://ieeexplore.ieee.org/document/9996885/