1. CMU Intellectual Repository

Browsing by Author Sanpawat Kantabutra

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 7 to 25 of 25 < previous 
Issue DateTitleAuthor(s)
1-Jan-2017Fast and efficient parallel coarsest refinementNopadon Juneam; Sanpawat Kantabutra
6-Oct-2008The graph relabeling problem and its variantsGeir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra
30-Jul-2010Graph relabeling with stacked labelsPochara Patthamalai; Sanpawat Kantabutra
1-Jan-2017An improved approximation algorithm for the s-t path movement problemWattana Jindaluang; Jakarin Chawachat; Varin Chouvatut; Jittat Fakcharoenphol; Sanpawat Kantabutra
2017An Improved Approximation Algorithm for the s-t Path Movement ProblemWattana Jindaluang; Jakarin Chawachat; Varin Chouvatut; Jittat Fakcharoenpho; Sanpawat Kantabutra
1-Dec-2005It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping networkSanpawat Kantabutra; Wattana Jindaluang; Prapaporn Techa-angkoon
1-Jan-2014Maximum coverage of radius-one sources in the wireless communicationPattama Longani; Sanpawat Kantabutra
1-May-2012A mobility model for studying wireless communication and the complexity of problems in the modelRaymond Greenlaw; Sanpawat Kantabutra; Pattama Longani
2016Multi-sources Silmultanieous Communication in the Wireless Mobility Model is NP-completePattama Longani; Nopadon Juneam; Sanpawat Kantabutra
1-Oct-2016Multi-sources simultaneous communication in the wireless mobility model is NP-completePattama Longani; Nopadon Juneam; Sanpawat Kantabutra
1-Jan-2017NC algorithms for minimum sum of diameters clusteringNopadon Juneam; Sanpawat Kantabutra
1-Jan-2016On cyber attacks and the maximum-weight rooted-subtree problemGeir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra
1-Jan-2020On phalanx graph search numberOndřej Navrátil; Sanpawat Kantabutra; Sheng Lung Peng
1-Nov-2008On the parallel complexity of hierarchical clustering and CC-complete problemsRaymond Greenlaw; Sanpawat Kantabutra
8-Feb-2016On the parallel complexity of minimum sum of diameters clusteringNopadon Juneam; Sanpawat Kantabutra
6-Oct-2008The parallel complexities of the K-medians related problemsSirion Vittayakorn; Sanpawat Kantabutra; Chularat Tanprasert
1-Jan-2016The structure of rooted weighted trees modeling layered cyber-security systemsGeir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra
6-Oct-2008Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility modelPattama Longani; Sanpawat Kantabutra
1-Jan-2014Under-sampling by algorithm with performance guaranteed for class-imbalance problemWattana Jindaluang; Varin Chouvatut; Sanpawat Kantabutra
Showing results 7 to 25 of 25 < previous