| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
$$(\alpha , \tau )$$(α,τ)-Monitoring for event detection in wireless sensor networks
|
Bi, Ran
|
|
2015
|
32 |
4 |
p. 985-1001
|
article
|
| 2 |
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
|
Wu, Chenchen
|
|
2015
|
32 |
4 |
p. 1017-1035
|
article
|
| 3 |
An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models
|
Wang, Cui
|
|
2015
|
32 |
4 |
p. 1052-1067
|
article
|
| 4 |
Approximate event detection over multi-modal sensing data
|
Gao, Jing
|
|
2015
|
32 |
4 |
p. 1002-1016
|
article
|
| 5 |
Approximate sorting of data streams with limited storage
|
Farnoud, Farzad
|
|
2015
|
32 |
4 |
p. 1133-1164
|
article
|
| 6 |
Approximation schemes for Euclidean vehicle routing problems with time windows
|
Song, Liang
|
|
2015
|
32 |
4 |
p. 1217-1231
|
article
|
| 7 |
A practical greedy approximation for the directed Steiner tree problem
|
Watel, Dimitri
|
|
2016
|
32 |
4 |
p. 1327-1370
|
article
|
| 8 |
Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
|
De Bonis, Annalisa
|
|
2015
|
32 |
4 |
p. 1254-1287
|
article
|
| 9 |
Directed Steiner trees with diffusion costs
|
Watel, Dimitri
|
|
2015
|
32 |
4 |
p. 1089-1106
|
article
|
| 10 |
Editorial for Special Issue: COCOA2014
|
Zhang, Zhao
|
|
2016
|
32 |
4 |
p. 1196
|
article
|
| 11 |
Efficient accuracy evaluation for multi-modal sensed data
|
Zhang, Yan
|
|
2015
|
32 |
4 |
p. 1068-1088
|
article
|
| 12 |
Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results
|
Wylie, Tim
|
|
2015
|
32 |
4 |
p. 1107-1132
|
article
|
| 13 |
Exemplar or matching: modeling DCJ problems with unequal content genome data
|
Yin, Zhaoming
|
|
2015
|
32 |
4 |
p. 1165-1181
|
article
|
| 14 |
Integer programming methods for special college admissions problems
|
Ágoston, Kolos Csaba
|
|
2016
|
32 |
4 |
p. 1371-1399
|
article
|
| 15 |
On the performance of mildly greedy players in cut games
|
Bilò, Vittorio
|
|
2015
|
32 |
4 |
p. 1036-1051
|
article
|
| 16 |
Preface: Special issue on computing and combinatorics conference and wireless algorithms, systems, and applications conference
|
Cai, Zhipeng
|
|
2016
|
32 |
4 |
p. 983-984
|
article
|
| 17 |
Reconfiguration of dominating sets
|
Suzuki, Akira
|
|
2015
|
32 |
4 |
p. 1182-1195
|
article
|
| 18 |
Serve or skip: the power of rejection in online bottleneck matching
|
Anthony, Barbara M.
|
|
2015
|
32 |
4 |
p. 1232-1253
|
article
|
| 19 |
The minimum vulnerability problem on specific graph classes
|
Aoki, Yusuke
|
|
2015
|
32 |
4 |
p. 1288-1304
|
article
|
| 20 |
The popular matching and condensation problems under matroid constraints
|
Kamiyama, Naoyuki
|
|
2015
|
32 |
4 |
p. 1305-1326
|
article
|
| 21 |
Towards the price of leasing online
|
Abshoff, Sebastian
|
|
2015
|
32 |
4 |
p. 1197-1216
|
article
|
Journal description