It's Elementary, My Dear Watson: Time-Optimal Sorting Algorithms on a Completely Overlapping Network. - Sanpawat Kantabutra; Wattana Jindaluang; Prapaporn Techa-angkoon (ISPA, 2005)

The Complexity of the Evolution of Graph Labelings. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (SNPD, 2008)

The Complexity of the Grid Wireless Mobility Model. - Sanpawat Kantabutra; Pattama Longani (SNPD, 2008)

On the parallel complexity of hierarchical clustering and CC-complete problems. - Raymond Greenlaw; Sanpawat Kantabutra (Complex., 2008)

On Embedding of a Hypercube in a Completely Overlapping Network. - Sanpawat Kantabutra; Jakarin Chawachat (Theory Comput. Syst., 2009)

A mobility model for studying wireless communication and the complexity of problems in the model. - Raymond Greenlaw; Sanpawat Kantabutra; Pattama Longani (Networks, 2012)

Survey of Clustering: Algorithms and Applications. - Raymond Greenlaw; Sanpawat Kantabutra (Int. J. Inf. Retr. Res., 2013)

The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (CoRR, 2015)

Fast Sequential and Parallel Vertex Relabelings of Km, m. - Sanpawat Kantabutra (Int. J. Found. Comput. Sci., 2015)

On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (Acta Cybern., 2016)

The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (Acta Cybern., 2016)

The structure and topology of rooted weighted trees modeling layered cyber-security systems. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (CoRR, 2016)

Fast and Efficient Parallel Coarsest Refinement. - Nopadon Juneam; Sanpawat Kantabutra (Fundam. Informaticae, 2017)

Attack and defense in the layered cyber-security model and their (1 ± ϵ)-approximation schemes. - Supachai Mukdasanit; Sanpawat Kantabutra (J. Comput. Syst. Sci., 2021)

Adiabatic Quantum Computation for Cyber Attack and Defense Strategies. - Sanpawat Kantabutra (ICS, 2022)

Probability-boosting technique for combinatorial optimization. - Sanpawat Kantabutra (PeerJ Comput. Sci., 2024)

Hybrid classical quantum computation for cybersecurity strategies in a layered cybersecurity model. - Jedsadakorn Kritsadakul; Sanpawat Kantabutra (J. Supercomput., 2025)