nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on the complexity of computing the number of reachable vertices in a digraph
|
Borassi, Michele |
|
2016 |
116 |
10 |
p. 628-630 3 p. |
artikel |
2 |
A technique for the concept-based detection of functional modules in an interaction network
|
Park, Jong-Min |
|
2016 |
116 |
10 |
p. 611-617 7 p. |
artikel |
3 |
Combining local and global information for product feature extraction in opinion documents
|
Yang, Liang |
|
2016 |
116 |
10 |
p. 623-627 5 p. |
artikel |
4 |
Complexity of a disjoint matching problem on bipartite graphs
|
Puleo, Gregory J. |
|
2016 |
116 |
10 |
p. 649-652 4 p. |
artikel |
5 |
Degree condition for completely independent spanning trees
|
Hong, Xia |
|
2016 |
116 |
10 |
p. 644-648 5 p. |
artikel |
6 |
Editorial Board
|
|
|
2016 |
116 |
10 |
p. IFC- 1 p. |
artikel |
7 |
Genetic algorithm-based parameter selection approach to single image defogging
|
Guo, Fan |
|
2016 |
116 |
10 |
p. 595-602 8 p. |
artikel |
8 |
Improved hardness results for unique shortest vector problem
|
Aggarwal, Divesh |
|
2016 |
116 |
10 |
p. 631-637 7 p. |
artikel |
9 |
Marking shortest paths on pushdown graphs does not preserve MSO decidability
|
Carayol, Arnaud |
|
2016 |
116 |
10 |
p. 638-643 6 p. |
artikel |
10 |
Security analysis of an RFID tag search protocol
|
Jannati, Hoda |
|
2016 |
116 |
10 |
p. 618-622 5 p. |
artikel |
11 |
Zhang neural networks for a set of linear matrix inequalities with time-varying coefficient matrix
|
Sun, Jia |
|
2016 |
116 |
10 |
p. 603-610 8 p. |
artikel |