nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A factor 2 approximation algorithm for the vertex cover P 3 problem
|
Tu, Jianhua |
|
2011 |
111 |
14 |
p. 683-686 4 p. |
artikel |
2 |
A note on exact distance labeling
|
Weimann, Oren |
|
2011 |
111 |
14 |
p. 671-673 3 p. |
artikel |
3 |
Approximating partition functions of the two-state spin system
|
Zhang, Jinshan |
|
2011 |
111 |
14 |
p. 702-710 9 p. |
artikel |
4 |
Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
|
Schmidt-Schauß, Manfred |
|
2011 |
111 |
14 |
p. 711-716 6 p. |
artikel |
5 |
Editorial Board
|
|
|
2011 |
111 |
14 |
p. IFC- 1 p. |
artikel |
6 |
Even faster parameterized cluster deletion and cluster editing
|
Böcker, Sebastian |
|
2011 |
111 |
14 |
p. 717-721 5 p. |
artikel |
7 |
Online algorithms for the general k-search problem
|
Zhang, Wenming |
|
2011 |
111 |
14 |
p. 678-682 5 p. |
artikel |
8 |
On the complexity of exact algorithm for L (2, 1)-labeling of graphs
|
Junosza-Szaniawski, Konstanty |
|
2011 |
111 |
14 |
p. 697-701 5 p. |
artikel |
9 |
Pattern matching in the Hamming distance with thresholds
|
Atallah, Mikhail J. |
|
2011 |
111 |
14 |
p. 674-677 4 p. |
artikel |
10 |
Security weaknesses of authenticated key agreement protocols
|
Nose, Peter |
|
2011 |
111 |
14 |
p. 687-696 10 p. |
artikel |