1. Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks;Proceedings of the VLDB Endowment;2024-07
2. Parallel Dynamic Maximal Matching;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
3. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
4. Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10