 | 2012 |
|---|
| 6 |       | Raymond Greenlaw,
Sanpawat Kantabutra,
Pattama Longani:
A mobility model for studying wireless communication and the complexity of problems in the model.
Networks 59(3): 320-330 (2012) |
| 2009 |
|---|
| 5 | | Sanpawat Kantabutra,
Jakarin Chawachat:
On Embedding of a Hypercube in a Completely Overlapping Network.
Theory Comput. Syst. 44(1): 105-116 (2009) |
| 2008 |
|---|
| 4 | | Geir Agnarsson,
Raymond Greenlaw,
Sanpawat Kantabutra:
The Complexity of the Evolution of Graph Labelings.
SNPD 2008: 79-84 |
| 3 | | Sanpawat Kantabutra,
Pattama Longani:
The Complexity of the Grid Wireless Mobility Model.
SNPD 2008: 85-90 |
| 2 | | Raymond Greenlaw,
Sanpawat Kantabutra:
On the parallel complexity of hierarchical clustering and CC-complete problems.
Complexity 14(2): 18-28 (2008) |
| 2005 |
|---|
| 1 | | Sanpawat Kantabutra,
Wattana Jindaluang,
Prapaporn Techa-angkoon:
It's Elementary, My Dear Watson: Time-Optimal Sorting Algorithms on a Completely Overlapping Network.
ISPA 2005: 252-262 |
Data released under the ODC-BY 1.0 license — See also our legal information page