Book Section:

·        “A Mobility Model for Studying Wireless Communication” in Roaming Securely in 802.11 Networks by Raymond Greenlaw and Paul Goransson, Elsevier Science and Technical Book Group, xxviii + 414 pp.

Book Chapter:

·        “Introduction to Clustering: Algorithms and Applications” by Raymond Greenlaw and Sanpawat Kantabutra in Dynamic and Advanced Data Mining for Progressing Technological Development, Editors: Dr. A. B. M. Shawkat Ali and Dr. Yang Xiang, 30 Pages, IGI Global, USA, In Press.

Journal Publications:

·        “NC Algorithms for the K-Centers Related Problems,” with S. Vittayakorn, Manuscript Preparation

·        “The Complexity of the Grid Wireless Mobility Model,” with P. Longani, Manuscript Preparation

·        “The Complexity of the Evolution of Graph Labelings,” with G. Agnarsson and R. Greenlaw, Submitted

·         “On the Parallel Complexity of Hierarchical Clustering and CC-complete Problems,” with R. Greenlaw, Complexity, Wiley, New Jersey, USA, in Press, 2007 (Impact Factor 1.051)

·         “On Embedding of a Hypercube in a Completely Overlapping Network,” with J. Chawachat, Theory of Computing Systems, Springer-Verlag, New York, USA, to the Springer link (Journal Ranking in Top 22.44%, Impact Factor 1.02)

·         “Parallel K-means Clustering Algorithm on NOWs,” with A. Couch,  NECTEC Technical Journal, NTJ Vol. 1, No. 6, January 2000 (cited internationally 20 times and was cited in the United States Patent 7039638)

Series Publications:

·        “It’s Elementary, My Dear Watson: Time-Optimal Sorting Algorithms on a Completely Overlapping Network,” with W. Jindaluang and P. Techa-angkoon, Lecture Notes in Computer Science, Editor: Yi Pan et al., Vol:3758, Springer-Verlag, 2005, to the Springer link (Acceptance Rate: ~16 % out of ~650 papers, Impact Factor 0.402)

Conference Publications:

·        “Graph Relabeling with Privileged Edge Labels,” with W. Techaploog, Proceedings of the 6th IEEE International Conference in Electrical Engineering/Electronics, Computer, Telecommunications, and Information Technology (ECTICON2009), May 6-9, 2009, Pattaya, Thailand

·        “The Complexity of the Grid Wireless Mobility Model,” with P. Longani, Proceedings of the 9th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD2008), August 6-8, 2008, Phuket, Thailand

·        “The Complexity of the Evolution of Graph Labelings,” with G. Agnarsson and R. Greenlaw, Proceedings of the 9th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD2008), August 6-8, 2008, Phuket, Thailand

·        “The Graph Relabeling Problem and Its Variants,” with G. Agnarsson and R. Greenlaw, Proceedings of the 5th IEEE International Conference in Electrical Engineering/Electronics, Computer, Telecommunications, and Information Technology (ECTICON2008), May 14-17, 2008, Krabi, Thailand

·        “The Parallel Complexities of the K-Medians Related Problems,” with S. Vittayakorn and C. Tanprasert, Proceedings of the 5th IEEE International Conference in Electrical Engineering/Electronics, Computer, Telecommunications, and Information Technology (ECTICON2008), May 14-17, 2008, Krabi, Thailand

·        “Time-Optimal User Communication and Source Reachability Algorithms in a Two-Dimensional Grid Wireless Mobility Model,” with P. Longani, Proceedings of the 5th IEEE International Conference in Electrical Engineering/Electronics, Computer, Telecommunications, and Information Technology (ECTICON2008), May 14-17, 2008, Krabi, Thailand

·        “The Complexity of Label Relocation Problems on Graphs,” S. Kantabutra, Proceedings of the 8th Asian Symposium on Computer Mathematics (ASCM2007), December 15-17, 2007, National University of Singapore, Singapore

·        “Embedding of a Mesh in a Completely Overlapping Network with Latency Hiding,” with W. Yaothanee, Proceedings of the 11th National Computer Science and Engineering Conference (NCSEC2007), November 19-21, 2007, Bangkok, Thailand

·        “A Mobility Model for Studying Wireless Communication,” with R. Greenlaw, Proceedings of the 15th International Conference of Forum for Interdisciplinary Mathematics on Interdisciplinary Mathematical and Statistical Techniques (IMST2007), May 20-23, 2007, Shanghai, P. R. China (Invited Paper)

·        “On the Parallel Complexity of Hierarchical Clustering and CC-complete Problems,” with R. Greenlaw, Proceedings of the Fourth Annual Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology International Conference (ECTI-CON 2007), May 9-12, 2007, Chiang Rai, Thailand

·        “Time-Optimal Graph Algorithms for Finding Adjacent and Non-Adjacent Nodes on a Completely Overlapping Network,” with R. Winit and S. Rattanaudomsawat, Proceedings of the Fourth Annual Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology International Conference (ECTI-CON 2007), May 9-12, 2007, Chiang Rai, Thailand

·        “Comparison-Based Sorting Algorithm with Some Constraints,” with S. Rattanaudomsawat, Proceedings of the 2005 Joint Computer Science and Software Engineering Conference (JCSSE’2005), November 17-18, 2005, Chonburi, Thailand

·        “Two Birds With One Stone: A Similarity-Guaranteed Clustering Algorithm and Its Search Tree,” with C. Bunkhumpornpat, Proceedings of the 2004 IEEE TENCON Conference, November 21-24, 2004, Chiang Mai, Thailand, to the IEEE link

·        “Dynamic Clustering-Based Round-Robin Scheduling Algorithm,” with P. Kornpitak and C. Naramittakapong, Proceedings of the Third International Symposium on Communications and Information Technology (ISCIT2003), September 03-05, 2003, Hatyai, Songkhla, Thailand (Pdf version)

·        “Pipelined K-means Algorithms on COWs,” with C. Naramittakapong and P. Kornpitak, Proceedings of the Third International Symposium on Communications and Information Technology (ISCIT2003), September 03-05, 2003, Hatyai, Songkhla, Thailand (Pdf version)

·        “Representation of y-clusters”, Proceedings of the International Conference on Computer Science and Its Applications (ICCSA2003), July 01-02, 2003, San Diego, California, USA (Pdf version)

·        “y-clustering Algorithms”, Proceedings of the Second International Symposium on Communications and Information Technology (ISCIT2002), October 23-25, 2002, Pattaya, Chonburi, Thailand (MS Word version, Pdf version)

Thesis and Dissertation:

·        “Efficient Representation Of Cluster Structure In Large Data Sets”, Ph.D. Dissertation, May 2001, Tufts University, Medford, Massachusetts, USA.

·        “The D Language -- C++ with Extensions of Safety”, Master Thesis, December 1996, Syracuse University, Syracuse, New York, USA.

Technical Reports:

·        “Approximation Algorithms for the Representative Points Problem of Clusters,” Theory of Computation Group, Chiang Mai University, 2006.

Last updated on February 21, 2009