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 1 to 20 of 25
next >
Issue Date
Title
Author(s)
1-Feb-2021
Attack and defense in the layered cyber-security model and their (1 ± ϵ)-approximation schemes
Supachai Mukdasanit
;
Sanpawat Kantabutra
1-Jan-2015
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
Geir Agnarsson
;
Raymond Greenlaw
;
Sanpawat Kantabutra
24-Dec-2008
The complexity of the evolution of GRAPH LABELINGS
Geir Agnarsson
;
Raymond Greenlaw
;
Sanpawat Kantabutra
24-Dec-2008
The complexity of the grid wireless mobility model
Sanpawat Kantabutra
;
Pattama Longani
21-Aug-2018
The Complexity of the Infinity Replacement Problem in the Cyber Security Model
Supachai Mukdasanit
;
Sanpawat Kantabutra
1-Jan-2014
The complexity of the overlay network verification and its related problems
Wattana Jindaluang
;
Sanpawat Kantabutra
;
Varin Chouvatut
1-Jan-2017
Fast and efficient parallel coarsest refinement
Nopadon Juneam
;
Sanpawat Kantabutra
6-Oct-2008
The graph relabeling problem and its variants
Geir Agnarsson
;
Raymond Greenlaw
;
Sanpawat Kantabutra
30-Jul-2010
Graph relabeling with stacked labels
Pochara Patthamalai
;
Sanpawat Kantabutra
1-Jan-2017
An improved approximation algorithm for the s-t path movement problem
Wattana Jindaluang
;
Jakarin Chawachat
;
Varin Chouvatut
;
Jittat Fakcharoenphol
;
Sanpawat Kantabutra
2017
An Improved Approximation Algorithm for the s-t Path Movement Problem
Wattana Jindaluang
;
Jakarin Chawachat
;
Varin Chouvatut
;
Jittat Fakcharoenpho
;
Sanpawat Kantabutra
1-Dec-2005
It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
Sanpawat Kantabutra
;
Wattana Jindaluang
;
Prapaporn Techa-angkoon
1-Jan-2014
Maximum coverage of radius-one sources in the wireless communication
Pattama Longani
;
Sanpawat Kantabutra
1-May-2012
A mobility model for studying wireless communication and the complexity of problems in the model
Raymond Greenlaw
;
Sanpawat Kantabutra
;
Pattama Longani
2016
Multi-sources Silmultanieous Communication in the Wireless Mobility Model is NP-complete
Pattama Longani
;
Nopadon Juneam
;
Sanpawat Kantabutra
1-Oct-2016
Multi-sources simultaneous communication in the wireless mobility model is NP-complete
Pattama Longani
;
Nopadon Juneam
;
Sanpawat Kantabutra
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