No. Title Author Year
1 Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k Saranurak, Thatchaphol et al. 2023
2 Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver Chalermsook, Parinya et al. 2022
3 Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary Bernstein, Aaron et al. 2022
4 Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary Bhattacharya, Sayan et al. 2022
5 Vertex Sparsifiers for Hyperedge Connectivity Jiang, Han et al. 2022
6 Pinning down the Strong Wilber 1 Bound for Binary Search Trees Chalermsook, Parinya et al. 2020
7 Multi-Finger Binary Search Trees Chalermsook, Parinya et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 7

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI