Sukprasert, Pattara

1. Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver
   2022/05/30 by Chalermsook, Parinya, Huang, Chien-Chung, Nanongkai, Danupon +3 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary
   2022/07/11 by Bhattacharya, Sayan, Saranurak, Thatchaphol, Sukprasert, Pattara · 1 citation
   #Data Structures and Algorithms (cs.DS) #E.1 #FOS: Computer and information sciences #G.2.2
3. Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
   2023/11/07 by Pattara Sukprasert, Sukprasert, Pattara, Quanquan C. Liu +5 · 1 citation
   Computer Science · #Advanced Graph Neural Networks #Complexity and Algorithms in Graphs #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)