Skip navigation
Home
Browse
Communities
& Collections
Browse Items by:
Issue Date
Author
Title
Subject
Sign on to:
My Account
Receive email
updates
Edit Profile
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:
Sort by:
title
issue date
submit date
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 17 to 25 of 25
< previous
Issue Date
Title
Author(s)
1-Jan-2017
NC algorithms for minimum sum of diameters clustering
Nopadon Juneam
;
Sanpawat Kantabutra
1-Jan-2016
On cyber attacks and the maximum-weight rooted-subtree problem
Geir Agnarsson
;
Raymond Greenlaw
;
Sanpawat Kantabutra
1-Jan-2020
On phalanx graph search number
Ondřej Navrátil
;
Sanpawat Kantabutra
;
Sheng Lung Peng
1-Nov-2008
On the parallel complexity of hierarchical clustering and CC-complete problems
Raymond Greenlaw
;
Sanpawat Kantabutra
8-Feb-2016
On the parallel complexity of minimum sum of diameters clustering
Nopadon Juneam
;
Sanpawat Kantabutra
6-Oct-2008
The parallel complexities of the K-medians related problems
Sirion Vittayakorn
;
Sanpawat Kantabutra
;
Chularat Tanprasert
1-Jan-2016
The structure of rooted weighted trees modeling layered cyber-security systems
Geir Agnarsson
;
Raymond Greenlaw
;
Sanpawat Kantabutra
6-Oct-2008
Time-optimal user communication and source reachability algorithms in a two-dimensional grid wireless mobility model
Pattama Longani
;
Sanpawat Kantabutra
1-Jan-2014
Under-sampling by algorithm with performance guaranteed for class-imbalance problem
Wattana Jindaluang
;
Varin Chouvatut
;
Sanpawat Kantabutra