| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A kernel of order 2 k − c log k for vertex cover
|
Lampis, Michael
|
|
2011
|
|
23-24 |
p. 1089-1091
3 p.
|
artikel
|
| 2 |
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
|
Bérczi, Kristóf
|
|
2009
|
|
23-24 |
p. 1227-1231
5 p.
|
artikel
|
| 3 |
A moment-based nonlocal-means algorithm for image denoising
|
Ji, Zexuan
|
|
2009
|
|
23-24 |
p. 1238-1244
7 p.
|
artikel
|
| 4 |
An analytical model for end-to-end communication channel over PLCN based on QBDs
|
Yan, Guofeng
|
|
2009
|
|
23-24 |
p. 1252-1259
8 p.
|
artikel
|
| 5 |
An encoding of partial algebras as total algebras
|
Diaconescu, Răzvan
|
|
2009
|
|
23-24 |
p. 1245-1251
7 p.
|
artikel
|
| 6 |
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
|
Liang, Zuosong
|
|
2011
|
|
23-24 |
p. 1104-1107
4 p.
|
artikel
|
| 7 |
Capacitated domination faster than O ( 2 n )
|
Cygan, Marek
|
|
2011
|
|
23-24 |
p. 1099-1103
5 p.
|
artikel
|
| 8 |
Characterization of minimally ( 2 , l ) -connected graphs
|
Gu, Xiaofeng
|
|
2011
|
|
23-24 |
p. 1124-1129
6 p.
|
artikel
|
| 9 |
Decision problems for Turing machines
|
Finkel, Olivier
|
|
2009
|
|
23-24 |
p. 1223-1226
4 p.
|
artikel
|
| 10 |
Editorial Board
|
|
|
2009
|
|
23-24 |
p. IFC-
1 p.
|
artikel
|
| 11 |
Editorial Board
|
|
|
2011
|
|
23-24 |
p. IFC-
1 p.
|
artikel
|
| 12 |
k-Fold unions of low-dimensional concept classes
|
Eisenstat, David
|
|
2009
|
|
23-24 |
p. 1232-1234
3 p.
|
artikel
|
| 13 |
Low-interference networks in metric spaces of bounded doubling dimension
|
Maheshwari, Anil
|
|
2011
|
|
23-24 |
p. 1120-1123
4 p.
|
artikel
|
| 14 |
Minterm-transitive functions with asymptotically smallest block sensitivity
|
Amano, Kazuyuki
|
|
2011
|
|
23-24 |
p. 1081-1084
4 p.
|
artikel
|
| 15 |
Mod ( 2 p + 1 ) -orientations in line graphs
|
Lai, Hong-Jian
|
|
2011
|
|
23-24 |
p. 1085-1088
4 p.
|
artikel
|
| 16 |
On the supports of recognizable series over a field and a single letter alphabet
|
Chapuy, Guillaume
|
|
2011
|
|
23-24 |
p. 1096-1098
3 p.
|
artikel
|
| 17 |
Pancyclicity of OTIS (swapped) networks based on properties of the factor graph
|
Malekimajd, M.
|
|
2011
|
|
23-24 |
p. 1114-1119
6 p.
|
artikel
|
| 18 |
Security vulnerability in a non-interactive ID-based proxy re-encryption scheme
|
Koo, Woo Kwon
|
|
2009
|
|
23-24 |
p. 1260-1262
3 p.
|
artikel
|
| 19 |
Stable sets in k-colorable P 5 -free graphs
|
Maffray, Frédéric
|
|
2009
|
|
23-24 |
p. 1235-1237
3 p.
|
artikel
|
| 20 |
The multiple domination and limited packing problems in graphs
|
Dobson, M.P.
|
|
2011
|
|
23-24 |
p. 1108-1113
6 p.
|
artikel
|
| 21 |
What Hill–Marty model learn from and break through Amdahlʼs law?
|
Yao, Erlin
|
|
2011
|
|
23-24 |
p. 1092-1095
4 p.
|
artikel
|
Tijdschrift beschrijving