6 citations · 20 across the 19 of their papers we have counts for
3 papers · 2 filters
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak +3
Greedy BST (or simply Greedy) is an online self-adjusting binary search tree defined in the geometric view ([Lucas, 1988; Munro, 2000; Demaine, Harmon, Iacono, Kane, Patrascu, SODA…
Deterministic Small Vertex Connectivity in Almost Linear Time
Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
In the vertex connectivity problem, given an undirected -vertex -edge graph , we need to compute the minimum number of vertices that can disconnect after removing them…
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai +3
In the -edge-connected spanning subgraph (ECSS) problem, our goal is to compute a minimum-cost sub-network that is resilient against up to link failures: Given an -nod…