The following papers will appear at ACM-SIAM Symposium on Discrete Algorithms (SODA26):
- "Dynamic Hierarchical j-Tree Decomposition and Its Applications" by Gramoz Goranci, Monika Henzinger, Peter Kiss, Ali Momeni and Gernot Zöcklein
- "Tree Embedding in High Dimensions: Dynamic and Massively Parallel" by Gramoz Goranci, Shaofeng H.-C. Jiang, Peter Kiss, Qihao Kong, Yi Qian and Eva Szilagyi
- "Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems" by Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss and Thatchaphol Saranurak
