No. Title Author Year
1 Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver Chalermsook, Parinya et al. 2022
2 Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary Bernstein, Aaron et al. 2022
3 Pinning down the Strong Wilber 1 Bound for Binary Search Trees Chalermsook, Parinya et al. 2020
4 Multi-Finger Binary Search Trees Chalermsook, Parinya et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 4


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